2026-07-24T03:27:57Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6010 2024-03-06T10:29:54Z ddc:004 open_access

LLLR Parsing: a Combination of LL and LR Parsing Slivnik, Boštjan LL parsing LR languages left parse A new parsing method called LLLR parsing is defined and a method for producing LLLR parsers is described. An LLLR parser uses an LL parser as its backbone and parses as much of its input string using LL parsing as possible. To resolve LL conflicts it triggers small embedded LR parsers. An embedded LR parser starts parsing the remaining input and once the LL conflict is resolved, the LR parser produces the left parse of the substring it has just parsed and passes the control back to the backbone LL parser. The LLLR(k) parser can be constructed for any LR(k) grammar. It produces the left parse of the input string without any backtracking and, if used for a syntax-directed translation, it evaluates semantic actions using the top-down strategy just like the canonical LL(k) parser. An LLLR(k) parser is appropriate for grammars where the LL(k) conflicting nonterminals either appear relatively close to the bottom of the derivation trees or produce short substrings. In such cases an LLLR parser can perform a significantly better error recovery than an LR parser since the most part of the input string is parsed with the backbone LL parser. LLLR parsing is similar to LL(^*) parsing except that it (a) uses LR(k) parsers instead of finite automata to resolve the LL(k) conflicts and (b) does not perform any backtracking. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Boštjan Slivnik 2016 Is Part Of OASIcs, Volume 51, 5th Symposium on Languages, Applications and Technologies (SLATE'16) (2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.SLATE.2016.5 urn:nbn:de:0030-drops-60106 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2016.5 eng https://creativecommons.org/licenses/by/3.0/legalcode