JUCS - Journal of Universal Computer Science 13(6): 737-752, doi: 10.3217/jucs-013-06-0737
A Methodology for Removing LALR(k) Conflicts
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 (2007) A Methodology for Removing LALR(k) Conflicts. JUCS - Journal of Universal Computer Science 13(6): 737-752. https://doi.org/10.3217/jucs-013-06-0737
Open Access
Abstract
Despite all the advances brought by LALR parsing method by DeRemer in the late 60's, conflicts reported by LALR parser generators are still removed in an old fashion and primitive manner, based on analysis of a huge amount of textual and low-level data stored on a single log file. For the purpose of minimizing the effort and time consumed in LALR conflict removal, which is definitely a laborious task, a methodology is proposed, along with the set of operations necessary to its realization. We also present a tool and the ideas behind it to support the methodology, plus its plugin facility, which permits the interpretation of virtually any syntax specification, regardless of the specification language used.
Keywords
lalr parsing, conflicts, methodology