Manuel Bermudez | University of Florida (original) (raw)
Papers by Manuel Bermudez
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Page 1. Fourth LACCEI International Latin American and Caribbean Conference for Engineering and T... more Page 1. Fourth LACCEI International Latin American and Caribbean Conference for Engineering and Technology (LACCET'2006) Breaking Frontiers and Barriers in Engineering: Education, Research and Practice 21-23 June 2006, Mayagüez, Puerto Rico ...
Bookmarks Related papers MentionsView impact
In the Computer Science curriculum, the compilers course is dying. It has been relegated to a &am... more 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
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Page 1. > REPLACE THIS LINE WITH YOUR PAPER IDENTIFICATION NUMBER (DOUBLE-CLICK HERE TO EDIT) ... more Page 1. > REPLACE THIS LINE WITH YOUR PAPER IDENTIFICATION NUMBER (DOUBLE-CLICK HERE TO EDIT) < 1 AbstractIn the Computer Science curriculum, the compilers course is dying. It has been relegated to a ...
Bookmarks Related papers MentionsView impact
International Journal of Computer Mathematics, 1989
We present the class of LAR(M,C,L) context-free grammars: a generalization of several classes of ... more 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
Bookmarks Related papers MentionsView impact
The authors characterize the lookahead symbols in terms of very simple relations that bring out s... more 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
Bookmarks Related papers MentionsView impact
International Journal of Parallel Programming, 1990
Page 1. International Journal of Parallel Programming, Vol. 19, No. 3, 1990 Parallel Construction... more Page 1. International Journal of Parallel Programming, Vol. 19, No. 3, 1990 Parallel Construction of SLR(1) and LALR (1) Parsers Manuel E. Bermudez, 1 Richard Newman-Wolfe, 1 and George Logothetis 2 Received January 1990; Revised September 1990 ...
Bookmarks Related papers MentionsView impact
Page 1. Voltaire: A Database Programming Language with a Single Execution Model for Evaluating Qu... more 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. ...
Bookmarks Related papers MentionsView impact
Information Processing Letters, 1989
Bookmarks Related papers MentionsView impact
International Journal of Computer Mathematics, 1997
This paper proposes a simple method for the application of a general model for lookahead parsing ... more This paper proposes a simple method for the application of a general model for lookahead parsing to regular right part grammars (RRPG&amp;#39;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&amp;#39;s into a infinite number of LR
Bookmarks Related papers MentionsView impact
ACM Transactions on Programming Languages and Systems, 1988
Page 1. TECHNICAL CORRESPONDENCE On the (non-) Relationship between SLR(l) and NQLALR(l) Grammars... more Page 1. TECHNICAL CORRESPONDENCE On the (non-) Relationship between SLR(l) and NQLALR(l) Grammars MANUEL E. BERMUDEZ University of Florida and KARL M. SCHIMPF University of California, Santa Cruz A ...
Bookmarks Related papers MentionsView impact
International Journal of Computer Mathematics, 1988
A single construction method for SLR, LALR, NQLALR and NQSLR parsers is presented. The latter two... more A single construction method for SLR, LALR, NQLALR and NQSLR parsers is presented. The latter two are generalizations of NQLALR(l) grammars, defined for the first time here. The construction method is based on two relations that capture the essential structure of the problem of computing fixed look-ahead for LR parsers. These relations capture both the similarities and the differences among
Bookmarks Related papers MentionsView impact
Page 1. Abstract -The initial hype created by the emergence of mobile computing technologies has ... more Page 1. Abstract -The initial hype created by the emergence of mobile computing technologies has slowly given way to a large amount of skepticism. Even though some m-commerce applications have already made their way ...
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Page 1. Fourth LACCEI International Latin American and Caribbean Conference for Engineering and T... more Page 1. Fourth LACCEI International Latin American and Caribbean Conference for Engineering and Technology (LACCET'2006) Breaking Frontiers and Barriers in Engineering: Education, Research and Practice 21-23 June 2006, Mayagüez, Puerto Rico ...
Bookmarks Related papers MentionsView impact
In the Computer Science curriculum, the compilers course is dying. It has been relegated to a &am... more In the Computer Science curriculum, the compilers course is dying. It has been relegated to a &quot;specialized, optional&quot; 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
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Page 1. > REPLACE THIS LINE WITH YOUR PAPER IDENTIFICATION NUMBER (DOUBLE-CLICK HERE TO EDIT) ... more Page 1. > REPLACE THIS LINE WITH YOUR PAPER IDENTIFICATION NUMBER (DOUBLE-CLICK HERE TO EDIT) < 1 AbstractIn the Computer Science curriculum, the compilers course is dying. It has been relegated to a ...
Bookmarks Related papers MentionsView impact
International Journal of Computer Mathematics, 1989
We present the class of LAR(M,C,L) context-free grammars: a generalization of several classes of ... more 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
Bookmarks Related papers MentionsView impact
The authors characterize the lookahead symbols in terms of very simple relations that bring out s... more 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
Bookmarks Related papers MentionsView impact
International Journal of Parallel Programming, 1990
Page 1. International Journal of Parallel Programming, Vol. 19, No. 3, 1990 Parallel Construction... more Page 1. International Journal of Parallel Programming, Vol. 19, No. 3, 1990 Parallel Construction of SLR(1) and LALR (1) Parsers Manuel E. Bermudez, 1 Richard Newman-Wolfe, 1 and George Logothetis 2 Received January 1990; Revised September 1990 ...
Bookmarks Related papers MentionsView impact
Page 1. Voltaire: A Database Programming Language with a Single Execution Model for Evaluating Qu... more 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. ...
Bookmarks Related papers MentionsView impact
Information Processing Letters, 1989
Bookmarks Related papers MentionsView impact
International Journal of Computer Mathematics, 1997
This paper proposes a simple method for the application of a general model for lookahead parsing ... more This paper proposes a simple method for the application of a general model for lookahead parsing to regular right part grammars (RRPG&amp;#39;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&amp;#39;s into a infinite number of LR
Bookmarks Related papers MentionsView impact
ACM Transactions on Programming Languages and Systems, 1988
Page 1. TECHNICAL CORRESPONDENCE On the (non-) Relationship between SLR(l) and NQLALR(l) Grammars... more Page 1. TECHNICAL CORRESPONDENCE On the (non-) Relationship between SLR(l) and NQLALR(l) Grammars MANUEL E. BERMUDEZ University of Florida and KARL M. SCHIMPF University of California, Santa Cruz A ...
Bookmarks Related papers MentionsView impact
International Journal of Computer Mathematics, 1988
A single construction method for SLR, LALR, NQLALR and NQSLR parsers is presented. The latter two... more A single construction method for SLR, LALR, NQLALR and NQSLR parsers is presented. The latter two are generalizations of NQLALR(l) grammars, defined for the first time here. The construction method is based on two relations that capture the essential structure of the problem of computing fixed look-ahead for LR parsers. These relations capture both the similarities and the differences among
Bookmarks Related papers MentionsView impact
Page 1. Abstract -The initial hype created by the emergence of mobile computing technologies has ... more Page 1. Abstract -The initial hype created by the emergence of mobile computing technologies has slowly given way to a large amount of skepticism. Even though some m-commerce applications have already made their way ...
Bookmarks Related papers MentionsView impact