scientific article

zbMath0306.68049MaRDI QIDQ4062666

Jay Earley

Publication date: 1975

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Related Items (10)

BUP: A bottom-up parser embedded in Prolog ⋮ Parsing schemata and correctness of parsing algorithms ⋮ Schrödinger's token ⋮ Efficient parsing algorithms for general context-free parsers ⋮ Early action in an Earley parser ⋮ Lower bounds on the size of deterministic parsers ⋮ Sublogarithmic ambiguity ⋮ Upper bounds on the size of LR(k) parsers ⋮ Parallel on-line parsing in constant time per word ⋮ A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead

This page was built for publication: