On different LL and LR parsers used in LLLR parsing
| Autor: | Boštjan Slivnik |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Computer Networks and Communications
Computer science Programming language business.industry LR parser 020207 software engineering 020101 civil engineering 02 engineering and technology Recursive descent parser computer.software_genre Top-down parsing Canonical LR parser 0201 civil engineering LL grammar Simple LR parser TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES 0202 electrical engineering electronic engineering information engineering LL parser Artificial intelligence business LALR parser computer Software Natural language processing |
| Zdroj: | Computer Languages, Systems & Structures. 50:108-126 |
| ISSN: | 1477-8424 |
| Popis: | As described in Slivnik (2016), LLLR parsing is a method that parses as much of its input string as possible using the backbone SLL(k) parser and uses small embedded canonical left LR(k) parsers to resolve LL conflicts. Once the LL conflict is resolved, the embedded parser produces the left parse of the substring it has just parsed and passes the control back to the backbone parser together with the information about how the backbone parser should realign its stack as a part of the input has been read by the embedded parser. The LLLR parser 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 same top-down strategy as the canonical LL(k) parser. In this paper, a more general approach towards LLLR parsing is presented as it is described how any kind of canonical LL(k) or LA(k)LL(k′) parser can be used as the backbone parser and how different kinds of embedded canonical left LR(k) or left LA(k)LR(k′) parsers can be used for LL conflict resolution. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect