Efficient Earley Parsing with Regular Right-hand Sides

Authors:
Trevor Jim;Yitzhak Mandelbaum
Affiliations:
AT&T Labs Research;AT&T Labs Research
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2010

Citing 7
Cited 1

The C programming language

The C programming language
An efficient context-free parsing algorithm

Communications of the ACM
Transition network grammars for natural language analysis

Communications of the ACM
Programming Techniques: Regular expression search algorithm

Communications of the ACM
Disambiguation Filters for Scannerless Generalized LR Parsers

CC '02 Proceedings of the 11th International Conference on Compiler Construction
Cascaded ATN grammars

Computational Linguistics
SPPF-Style Parsing From Earley Recognisers

Electronic Notes in Theoretical Computer Science (ENTCS)

Parsing reflective grammars

Proceedings of the Eleventh Workshop on Language Descriptions, Tools and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new variant of the Earley parsing algorithm capable of efficiently supporting context-free grammars with regular right hand-sides. We present the core state-machine driven algorithm, the translation of grammars into state machines, and the reconstruction algorithm. We also include a theoretical framework for presenting the algorithm and for evaluating optimizations. Finally, we evaluate the algorithm by testing its implementation.