Bounded-Graph Construction for Noncanonical Discriminating-Reverse Parsers

Authors:
Jacques Farré;José Fortes Gálvez
Affiliations:
-;-
Venue:
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Year:
2001

Citing 4
Cited 1

A Yacc extension for LRR grammar parsing

Theoretical Computer Science
A Basis for Looping Extensions to Discriminating-Reverse Parsing

CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Generating LR(1) Parsers of Small Size

CC '92 Proceedings of the 4th International Conference on Compiler Construction
A Bounded Graph-Connect Construction for LR-regular Parsers

CC '01 Proceedings of the 10th International Conference on Compiler Construction

Bounded-connect noncanonical discriminating-reverse parsers

Theoretical Computer Science - Implementation and application automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new approach for the construction of NDR parsers, which defines a new form of items and keeps track of bounded sequences of subgraph connections. This improves the precise recovery of conflicts' right-hand contexts over the basic looping approach, and thus allows to extend the class of accepted grammars. Acceptance of at least all LALR(k) grammars, for a given k, is guaranteed. Moreover, the construction needs no subgraph copies. Since bounded-graph and basic looping constructions only differ in the accuracy of the conflicts' right-hand contexts computation, the NDR parsing algorithm remains unchanged.