A Parser Generator Based on Earley's Algorithm

Authors

Jawaid Hakim, Washington University in St Louis

Document Type

Technical Report

Publication Date

1991-10-01

Filename

WUCS-91-51.pdf

Technical Report Number

WUCS-91-51

Abstract

Most parser generators are programs that take a context-free grammar specification for a language and generate a parser for that language. Usually, the parsers generated by these parser generators are based on some variations of LL(k) or LR(k) parsing algorithms. The parser generators discussed in this paper creates parsers based on Earlcy's Algorithm. This parser generator creates parsers from any arbitrary context-free grammar specifications; even from ambiguous, cyclic, and unbounded look ahead grammar. These parsers are more powerful than LL(k) and LR(k) parsers and enable the user to create many new applications.

Comments

Permanent URL: http://dx.doi.org/10.7936/K76H4FSG

Recommended Citation

Hakim, Jawaid, "A Parser Generator Based on Earley's Algorithm" Report Number: WUCS-91-51 (1991). All Computer Science and Engineering Research.
https://openscholarship.wustl.edu/cse_research/669