On the relation between context-free grammars and parsing expression grammars
Authors:
- Fabio MascarenhasFMFabio Mascarenhas
- Sérgio MedeirosSMSérgio Medeiros
- Roberto IerusalimschyRIRoberto Ierusalimschy
- 1 September 2014
- journal article
- Published by Elsevier in Science of Computer Programming
- Vol. 89, 235-250
Abstract
No abstract availableKeywords
All Related Versions
This publication has 14 references indexed in Scilit:
- GLL parse-tree generationScience of Computer Programming, 2013
- From EBNF to PEGFundamenta Informaticae, 2013
- GLL ParsingElectronic Notes in Theoretical Computer Science, 2010
- Applying Classical Concepts to Parsing Expression GrammarFundamenta Informaticae, 2009
- ANTLR: A predicated‐LL(k) parser generatorSoftware: Practice and Experience, 1995
- From $LL$-regular to $LL(1)$ grammars : transformations, covers and parsingRAIRO. Informatique théorique, 1982
- Ll-regular grammarsInternational Journal of Computer Mathematics, 1980
- LL-regular grammarsInformation Processing Letters, 1975
- Parsing algorithms with backtrackInformation and Control, 1973
- Top-down syntax analysisActa Informatica, 1971