Please use this identifier to cite or link to this item:
doi:10.22028/D291-26438 | Title: | An efficient ELL (1) - parser generator |
| Author(s): | Heckmann, Reinhold |
| Language: | English |
| Year of Publication: | 1985 |
| DDC notations: | 004 Computer science, internet |
| Publikation type: | Report |
| Abstract: | 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. |
| Link to this record: | urn:nbn:de:bsz:291-scidok-51290 hdl:20.500.11880/26494 http://dx.doi.org/10.22028/D291-26438 |
| Series name: | Bericht / A / Fachbereich Angewandte Mathematik und Informatik, Universität des Saarlandes |
| Series volume: | 1985/04 |
| Date of registration: | 2-Apr-2013 |
| Faculty: | MI - Fakultät für Mathematik und Informatik |
| Department: | MI - Informatik |
| Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
| File | Description | Size | Format | |
|---|---|---|---|---|
| fb14_1985_04.pdf | 50 MB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.