Abstract

Extended context free grammars (ECFG) are context free grammars (CFG) in which the right side or each production may be an arbitrary finite state machine. There are ECFG subsets, ELR(k) and ELALR(k) which correspond to the context free subsets, LR(k) and LALR(k).Although ECFGs recognize the same set of languages as CFGs, ECFGs have some important advantages over CFGs. They tend to be smaller and more readable, containing fewer productions and non-terminals than their context free counterparts. In addition, they allow for a degree of separation of syntax and semantics which is probably impossible to obtain with CFGs.This paper briefly describes ELR parsing and then discusses PEG, a ELALR(1) parser generator currently under development at University of Alabama in Birmingham.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.