Manuel E. Bermudez

Learn More
We present a practical technique that provides an <italic>LR</italic> (0) parser with either fixed or arbitrary look-ahead. The construction algorithm is based on certain paths in the <italic>LR</italic> (0) state diagram, which must be restricted to a maximum length <italic>m</italic>. The technique determines the amount of look-ahead required, and the(More)
Recent LALR(1) aIgorithms involve the computation (via graph algorithms) of certain Follow sets, for nonterminaI transitions in the LR(0) automaton. In this paper we show that these Follow sets are merely the ordinary, well-known Follow sets, in a certain context-free grammar calIed G’, which is related to the user’s grammar G. By using G’ instead of G, the(More)
Voltaire is a set-oriented, imperative database programming language. The data definition facility is similar to that of most semantic data models. The class definition incorporates both structure and behavior; classes and functions have an equivalent semantics in Voltaire. There are no arbitrary restrictions on the persistence of values-even functions can(More)
A popular but &#8220;not-quite&#8221; correct technique for computing LALR(1) look-ahead sets has been formalized by DeRemer and Pennello and dubbed NQLALR(l). They also claim that the class of SLR(l) grammars is a subset of the class of NQLALR(1) grammars. We prove here that no such relationship exists between those two classes. We do so with a(More)
The generation of an LR parser consists of constructing a parse table, with one row per state (in a push-down automaton), and one column per terminal symbol. Traditionally, this is carried out row by row, with the computation of one row depending (potentially) on all the others. We present a technique for carrying out the lookahead computation of SLR (1)(More)
  • 1