Conflict detection and resolution in a lexical analyzer generator (Q1178249)

We show that lexical conflict detection and resolution can be done in an automatic way by reading the context-free grammar describing the syntax of a language. Each conflict is resolved on the basis of the current LALR(1) parser state (it resembles the idea of indirect lexical analyzer \textit{A. V. Aho} and \textit{J. D. Ullman}[The theory of parsing, translation and compiling, Vol. I Parsing, Prentice-Hall (1972)]. We define lexical conflicts (2) and discuss conflict detection and the problem of automatic left context uncovery.