Efficient Earley Parsing with Regular Right-hand Sides | Zendy

Trevor Jim | Zendy; Yitzhak Mandelbaum | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Efficient Earley Parsing with Regular Right-hand Sides

Author(s) -

Trevor Jim,

Yitzhak Mandelbaum

Publication year - 2010

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2010.08.037

Subject(s) - computer science , parsing , rule based machine translation , context free grammar , core (optical fiber) , context (archaeology) , parsing expression grammar , state (computer science) , programming language , s attributed grammar , translation (biology) , l attributed grammar , theoretical computer science , natural language processing , artificial intelligence , algorithm , telecommunications , paleontology , biochemistry , chemistry , messenger rna , gene , biology

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research