JOURNAL ARTICLE
Extended LL(k) grammars and parsers
Abstract
A class of context-free grammars, called "Extended LL(k)" or ELL(k), is defined. This class has been shown to include LL(k) grammars as proper subset, and there are some grammars which are ELL(k) grammars but not LALR(k) grammars.An algorithm to construct persers for ELL(k) grammars is proposed in this paper.Before this paper had been completed, PL/O language was taken as a sample. A parser was constructed for it by ELL(k) technique.
Keywords:
Rule-based machine translation Parsing expression grammar L-attributed grammar Indexed grammar Context-free grammar Computer science Deterministic context-free grammar Tree-adjoining grammar Context-sensitive grammar Phrase structure grammar Programming language Parsing Embedded pushdown automaton Class (philosophy) Natural language processing Artificial intelligence
Metrics
1
Cited By
0.00
FWCI (Field Weighted Citation Impact)
7
Refs
0.12
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Topics
Natural Language Processing Techniques
Physical Sciences → Computer Science → Artificial Intelligence
Algorithms and Data Compression
Physical Sciences → Computer Science → Artificial Intelligence
semigroups and automata theory
Physical Sciences → Computer Science → Computational Theory and Mathematics
Related Documents
JOURNAL ARTICLE
Automatically generating SL parsers from LL(1) grammars
David T. BarnardJames R. Cordy
Journal: Computer Languages Year: 1989 Vol: 14 (2)Pages: 93-98
BOOK-CHAPTER
On constructing LL(k) parsers
Seppo SippuEljas Soisalon-Soininen
Lecture notes in computer science Year: 1979 Pages: 585-595
BOOK-CHAPTER
LL(k) parsing for attributed grammars
D. R. MiltonCharles N. Fischer
Lecture notes in computer science Year: 1979 Pages: 422-430