Please use this identifier to cite or link to this item:
http://hdl.handle.net/10553/72929
Title: | A basis for looping extensions to discriminating-reverse parsing | Authors: | Farre, J Fortes Gálvez, José |
UNESCO Clasification: | 1203 Ciencia de los ordenadores | Issue Date: | 2001 | Journal: | Lecture Notes in Computer Science | Conference: | 5th International Conference on Implementation and Application of Automata | Abstract: | We present a noncanonical extension to the Discriminating Reverse parsing method, which accepts non-LR grammars. In cases of parsing conflict, actions are deferred and a mark is virtually pushed onto the parsing stack. Then, locally-canonical DR parsing resumes until sufficient right context is read to resolve the initial conflict. Marks code coverings of the right contexts that are compatible with the actions in conflict. A suboptimal solution for such a coding is proposed, which is computed from the DR automaton itself. The stack vocabulary is enlarged with the mark set, but no new state is added to the basic DR automaton. Moreover, conflict resolution basically uses the DR parser. The method determines at construction time whether all the conflicts can be resolved, and only produces deterministic parsers. | URI: | http://hdl.handle.net/10553/72929 | ISBN: | 978-3-540-42491-8 3-540-42491-1 |
ISSN: | 0302-9743 | DOI: | 10.1007/3-540-44674-5_10 | Source: | Implementation And Application Of Automata [ISSN 0302-9743], v. 2088, p. 122-134, (2001) |
Appears in Collections: | Actas de congresos |
SCOPUSTM
Citations
2
checked on Nov 24, 2024
WEB OF SCIENCETM
Citations
2
checked on Feb 25, 2024
Page view(s)
89
checked on Feb 10, 2024
Google ScholarTM
Check
Altmetric
Share
Export metadata
Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.