Efficient Earley Parsing with Regular Right-hand Sides

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. Key words: Context-free grammars, Earley parsing, regular right sides, scannerless parsing, transducers, augmented transition networks

• Type: Journal
• Year: 2010
• Where: ENTCS
• Authors: Trevor Jim, Yitzhak Mandelbaum
• Keywords: Algorithm, Context-free Grammars, ENTCS 2010, Parsing, Software Engineering