You can manage bookmarks using lists, please log in to your user account for this.
Media type:
E-Book;
Report
Title:
An efficient ELL (1) - parser generator
Contributor:
Heckmann, Reinhold
[Author]
imprint:
Scientific publications of the Saarland University (UdS), 2013-04-02
Language:
English
DOI:
https://doi.org/10.22028/D291-26438
Origination:
Footnote:
Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
Description:
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 s of the 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.