JUCS - Journal of Universal Computer Science 14(21): 3447-3464, doi: 10.3217/jucs-014-21-3447
An LALR Parser Generator Supporting Conflict Resolution
expand article infoLeonardo Teixeira Passos‡, Mariza Andrade Silva Bigonha‡, Roberto S. Bigonha§
‡ Federal University of Minas Gerais, Brazil§ Universidade Federal de Minas Gerais, Brazil

Corresponding author: Leonardo Passos ( leonardo@dcc.ufmg.br )

© Leonardo Passos, Mariza Andrade Silva Bigonha, Roberto Bigonha.
This article is freely available under the J.UCS Open Content License.
Citation: Passos LT, Bigonha MAS, Bigonha RS (2008) An LALR Parser Generator Supporting Conflict Resolution. JUCS - Journal of Universal Computer Science 14(21): 3447-3464. https://doi.org/10.3217/jucs-014-21-3447
Open Access
Abstract
Despite all the advance brought by LALR parsing method by DeRemer in the late 60's, conflicts continue to be removed in a non-productive way, by means of analysis of a huge amount of textual and low level data dumped by the parser generator tool. For the purpose of changing this scenario, we present a parser generator capable of automatically removing some types of conflicts, along with a supported methodology that guides the process of manual removal. We also discuss the internal algorithms and how the created parsers are compact in terms of memory usage.
Keywords
lalr parsing, automatic conflict removal, table compression, methodology