License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2016.79
URN: urn:nbn:de:0030-drops-64876
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6487/
Quaglia, Paola
Symbolic Lookaheads for Bottom-up Parsing
Abstract
We present algorithms for the construction of LALR(1) parsing tables, and of LR(1) parsing tables of reduced size. We first define specialized characteristic automata whose states are parametric w.r.t. variables symbolically representing lookahead-sets. The propagation flow of lookaheads is kept in the form of a system of recursive equations, which is resolved to obtain the concrete LALR(1) table. By inspection of the LALR(1) automaton and of its lookahead ropagation flow, we decide whether the grammar is LR(1) or not. In the positive case, an LR(1) parsing table of reduced size is computed by refinement of the LALR(1) table.
BibTeX - Entry
@InProceedings{quaglia:LIPIcs:2016:6487,
author = {Paola Quaglia},
title = {{Symbolic Lookaheads for Bottom-up Parsing}},
booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)},
pages = {79:1--79:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-016-3},
ISSN = {1868-8969},
year = {2016},
volume = {58},
editor = {Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6487},
URN = {urn:nbn:de:0030-drops-64876},
doi = {10.4230/LIPIcs.MFCS.2016.79},
annote = {Keywords: LALR(1) grammars; LR(1) grammars; bottom-up parsing}
}
|
Keywords: |
|
LALR(1) grammars; LR(1) grammars; bottom-up parsing |
|
Collection: |
|
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) |
|
Issue Date: |
|
2016 |
|
Date of publication: |
|
19.08.2016 |
