On the 'correct prefix property' in precedence parsers (Q792099): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The theory of languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4057550 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: EULER: A generalization of ALGOL and its formal definition: Part 1 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the 'correct prefix property' in precedence parsers / rank | |||
Normal rank |
Latest revision as of 12:31, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the 'correct prefix property' in precedence parsers |
scientific article |
Statements
On the 'correct prefix property' in precedence parsers (English)
0 references
1983
0 references
Precedence parsers are very fast and simple in operation. Unfortunately, the common opinion is that the precedence technique has many disadvantages. Among other ones, the absence of the correct prefix property (CPP) has been stressed. This paper attempts to refute this opinion. A practical transformation is presented that accepts a mixed strategy precedence (MSP) grammar as an input. The transformation results in two new grammars, both of them satisfying the MSP property. The precedence parser for the first grammar equipped with the extended error detection capability due to \textit{S. P. Rhodes} [Ph. D. Dissertation, Univ. of California at Berleley (1973)] is guaranteed to have the CPP. In the case of the latter grammar, the classical MSP parser obeys the CPP. The transformation algorithm can be extended to accept LR(0) or SLR(1) grammars as inputs. (From the author's introduction.)
0 references
precedence parsers
0 references
correct prefix property
0 references