BDBComp
Parceria:
SBC
Basic Two-Stack Parser Construction. A Practical Replacement for LALR(1) Parsing

Michael Oudshoorn

A new construction method for deterministic one-symbol look-ahead parsers is presented. LR parser construction is generated by allowing nonterminals in the parser look-ahead. This effectively relaxes the requirement of parsing the reverse of the right-most derivation of a string/sentence. The deterministic push down automata of LR parsing is replaced by a practical two-stack automata. The class of grammars accepted properly contains the LR(k) grammars. Generated parsers are comparable in size and performance to LR parsers.

http://www.lbd.dcc.ufmg.br:8080/colecoes/sblp/2005/007.pdf

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato: bdbcomp@lbd.dcc.ufmg.br
     Mantida por:
LBD