Manuel Bermudez

In the Computer Science curriculum, the compilers course is dying. It has been relegated to a "specialized, optional" role in the ACM 2001 curriculum. However, some fundamental topics are covered only in that course, such as syntax analysis, computer translation with applications outside compilation, and language specification mechanisms such as regular expressions. In this paper, we present the outline of

We present the class of LAR(M,C,L) context-free grammars: a generalization of several classes of fixed and arbitrary lookahead LR grammars that appear in the literature. The parser construction is based on three parameters M,C and L; M and C determine the type of parser, and L is the amount of lookahead. Specific settings of these parameters yield fixed-lookahead grammar classes

The authors characterize the lookahead symbols in terms of very simple relations that bring out substantial structural similarities between SLR(1) and LALR(1) lookaheads. They present algorithms for computing SLR(1) and LALR(1) lookahead that are substantially simpler than those currently known. In contrast to existing algorithms which compute a lookahead set for each reduce move, the authors' algorithms compute all reduce

Page 1. Voltaire: A Database Programming Language with a Single Execution Model for Evaluating Queries, Constraints and Functions Sunit K. Gala Shamkant B. Navathe Manuel E. Bermudez UniSQL, Inc. College of Computing Dept. of Comp. &Info. Sc. 9390 Research Blvd. ...

This paper proposes a simple method for the application of a general model for lookahead parsing to regular right part grammars (RRPG's). Previous approaches have been limited to single LR grammar classes:LR(k) and LALR(k), for example. The present approach, however, makes several simple modifications to a general model of lookahead LR parsing, partitioning RRPG's into a infinite number of LR

Wait-free synchronization has been recognized in the literature as an effective concurrent programming technique. The concurrent programming community, however, has been slow to adopt this technique. This paper addresses the practical application of wait-free synchronization in the design of distributed applications. In this paper, we present an implementation of a server that uses wait-free synchronization. The resulting code is more easily seen to be fault tolerant. The performance analysis of the wait-free synchronization server outperformed a server that uses traditional locking techniques. This practical demonstration of the benefits of wait-free synchronization should help foster its adoption in the development of distributed applications.

For each state in the LR(0) automaton of a context-free grammar, there exists a language consisting of the valid strings that might be parsed from that state. Existing techniques for adding lookahead to an LR(0) automaton do not explicitly consider these “suffix” languages. Instead, existing techniques examine prefixes of suffix languages or some other simplification or approximation of them. We

We present a practical technique for computing lookahead for an LR(0) parser, that progressively attempts single-symbol, multi-symbol, and arbitrary lookahead. The technique determines the amount of lookahead required, and the user is spared the task of guessing it. The class of context-free grammars defined by our technique is a subset of the LR-regular grammars; we show that unlike LR-regular, the problem of determining whether an arbitrary grammar is in the class, is decidable. When restricted to k-symbol lookahead, the technique has the power of LALR(k) parsers. It has been successfully used to resolve multi-symbol lookahead conflicts in grammars for FORTRAN, Ada, C, COBOL, and PL/I, and its performance compares favorably with that of two well-known, commercially available parser generators.