Back to Search Start Over

An extension of knuth's algorithm for parsing context-free languages

Authors :
A.A. Ordyan
S.S. Lavrov
Source :
USSR Computational Mathematics and Mathematical Physics. 15:187-200
Publication Year :
1975
Publisher :
Elsevier BV, 1975.

Abstract

AN EXTENSION of Knuth's algorithm for parsing context-free languages is considered. The algorithm proposed is not a left-sided parsing algorithm. It is shown how, by slightly changing the grammar, it is in many cases possible to attain unique parsing by means of an extension of Knuth's algorithm.

Subjects

Subjects :
Theoretical computer science
Parsing
Computer science
Knuth's Algorithm X
General Engineering
Dancing Links
Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)
computer.software_genre
Top-down parsing
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES
Parser combinator
Computer Science::Mathematical Software
S-attributed grammar
Top-down parsing language
Algorithm
computer
Bottom-up parsing

Details

ISSN :
00415553
Volume :
15
Database :
OpenAIRE
Journal :
USSR Computational Mathematics and Mathematical Physics
Accession number :
edsair.doi...........87b91018d96cb8e426681833ea7ca999
Full Text :
https://doi.org/10.1016/0041-5553(75)90178-0
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details