Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
Journal of the ACM (JACM)
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
How to Talk to Your Computer so that It Will Listen
PADL '02 Proceedings of the 4th International Symposium on Practical Aspects of Declarative Languages
Building a large annotated corpus of English: the penn treebank
Computational Linguistics - Special issue on using large corpora: II
CommandTalk: a spoken-language interface for battlefield simulations
ANLC '97 Proceedings of the fifth conference on Applied natural language processing
Finite-state approximation of constraint-based grammars using left-corner grammar transforms
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Compact non-left-recursive grammars using the selective left-corner transform and factoring
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Practical issues in compiling typed unification grammars for speech recognition
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Grammar-based whitebox fuzzing
Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
An Introduction to Grammar Convergence
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Modular and efficient top-down parsing for ambiguous left-recursive grammars
IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
Speech recognition grammar compilation in Grammatical Framework
SLP '07 Proceedings of the Workshop on Grammar-Based Approaches to Spoken Language Processing
Typed Transformations of Typed Grammars: The Left Corner Transform
Electronic Notes in Theoretical Computer Science (ENTCS)
Explicitly recursive grammar combinators: a better model for shallow parser DSLs
PADL'11 Proceedings of the 13th international conference on Practical aspects of declarative languages
Proceedings of the 4th ACM symposium on Haskell
| Hi-index | 0.00 |
A long-standing issue regarding algorithms that manipulate context-free grammars (CFGs) in a "top-down" left-to-right fashion is that left recursion can lead to nontermination. An algorithm is known that transforms any CFG into an equivalent nonleft-recursive CFG, but the resulting grammars are often too large for practical use. We present a new method for removing left recursion from CFGs that is both theoretically superior to the standard algorithm, and produces very compact non-left-recursive CFGs in practice.