Generation of efficient LALR parsers for regular right part grammars (Q1058307): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Simple <i>LR(k)</i> grammars / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient Computation of LALR(1) Look-Ahead Sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the definition of ELR(k) and ELL(k) grammars / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Regular right part grammars and their parsers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Constructing LR parsers for regular right part grammars / rank | |||
Normal rank | |||
Revision as of 17:43, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generation of efficient LALR parsers for regular right part grammars |
scientific article |
Statements
Generation of efficient LALR parsers for regular right part grammars (English)
0 references
1986
0 references
A method for building small fast LALR parsers for regular right part grammars is given. No grammar transformation is required. No extra state of the LALR parser for the recognition of strings generated by a right part is required. At some reduce states the parser may refer to lookback states (states in which the parser may be restarted after the reduction). An optimizing algorithm to reduce these references is also given.
0 references
