6 search results - page 1 / 2 » Notes On LR Parser Design |
49
Voted
COLING
1994
14 years 11 months ago
1994
CC
2004
Springer
15 years 3 months ago
2004
Springer
The Generalized LR (GLR) parsing algorithm is attractive for use in parsing programming languages because it is asymptotically efficient for typical grammars, and can parse with an...
PLDI
1997
ACM
15 years 1 months ago
1997
ACM
A major research goal for compilers and environments is the automatic derivation of tools from formal specifications. However, the formal model of the language is often inadequat...
APL
1992
ACM
15 years 1 months ago
1992
ACM
We present the design and implementation of APL Intrinsic Functions for a Finite State Machine (also known as a Finite State Automaton) which recognizes regular languages, and a P...
178
Voted
POPL
2004
ACM
15 years 10 months ago
2004
ACM
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...