An Efficient Context-Free Parsing Algorithm

DMCA

An Efficient Context-Free Parsing Algorithm (1970)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Jay Earley

Citations:

798 - 0 self

BibTeX

@MISC{Earley70anefficient,
    author = {Jay Earley},
    title = {An Efficient Context-Free Parsing Algorithm},
    year = {1970}
}

OpenURL

Abstract

A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar top-down algorithm. It has a time bound proportional to n 3 (where n is the length of the string being parsed) in general; it has an n 2 bound for unambiguous grammars; and it runs in linear time on a large class of grammars, which seems to include most practical context-free programming language grammars. In an empirical comparison it appears to be superior to the top-down and bottom-up algorithms studied by Griffiths and Petrlck.

Keyphrases

efficient context-free parsing algorithm empirical comparison large class efficient general context-free algorithm linear time bottom-up algorithm parsing algorithm familiar top-down algorithm practical context-free programming language grammar unambiguous grammar

DMCA