An efficient ELL(1)-parser generator (Q1060852)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3909767
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient ELL(1)-parser generator |
scientific article; zbMATH DE number 3909767 |
Statements
An efficient ELL(1)-parser generator (English)
0 references
1986
0 references
Extended context-free grammars also called regular right part grammars allow for compact and readable descriptions of the syntax of programming languages. Recursion in conventional context-free grammars can in most cases be replaced by iteration. Parser tables of predictive LL-parsers for extended grammars can be generated very efficiently if the length of look-ahead is 1. The generation time is proportional to the size of the parser table, that is the product of grammar size and number of terminal symbols.
0 references
extended context-free grammars
0 references
regular right part grammars
0 references
predictive LL-parsers
0 references
parser table
0 references
0.8335947394371033
0 references
0.8107141256332397
0 references
0.7978292107582092
0 references
