К содержанию
РецензированоEN2011

Solving LR Conflicts Through Context Aware Scanning

C. Rodriguez Leon · L. Garcia Forte

Научные статьи · 2011

Аннотация

This paper presents a new algorithm to compute the exact list of tokens expected by any LR syntax analyzer at any point of the scanning process. The lexer can, at any time, compute the exact list of valid tokens to return only tokens in this set. In the case than more than one matching token is in the valid set, the lexer can resort to a nested LR parser to disambiguate. Allowing nested LR parsing requires some slight modifications when building the LR parsing tables. We also show how LR parsers can parse conflictive and inherently ambiguous languages using a combination of nested parsing and context aware scanning. These expanded lexical analyzers can be generated from high level specifications.

Доказательный фрагмент

«This paper presents a new algorithm to compute the exact list of tokens expected by any LR syntax analyzer at any point of the scanning process.»

Образец извлечения

Демо-превью

This paper presents a new algorithm to compute the exact list of tokens expected by any LR syntax analyzer at any point of the scanning process. Полный текст публикации CiteX не хранит — доступ к первоисточнику открывается по DOI согласно лицензии издателя и выбранному плану.

DOI не указан
Цитирований
0
Тип
Журнал
Страна
Узбекистан
Спросить CiteX об этой работе

Смежные источники