Conflict detection and resolution in a lexical analyzer generator (Q1178249): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimization of LR(k) parsers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3484364 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5592246 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3042365 / rank | |||
Normal rank |
Revision as of 12:23, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Conflict detection and resolution in a lexical analyzer generator |
scientific article |
Statements
Conflict detection and resolution in a lexical analyzer generator (English)
0 references
26 June 1992
0 references
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.
0 references
lexical analysis
0 references
compiler compilers
0 references
scanner generators
0 references