Lexing and parsing Modula-2

Authors:
David Spector
Affiliations:
Prime Computer, Inc., Framingham, Massachusetts
Venue:
ACM SIGPLAN Notices
Year:
1983

Citing 0
Cited 4

Unifying view of recent LALR(1) lookahead set algorithms

SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Efficient construction of LR(k) states and tables

ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic code generation for microprocessor based systems

Proceedings of the 1985 ACM SIGSMALL symposium on Small systems
Generalized probabilistic LR parsing of natural language (Corpora) with unification-based grammars

Computational Linguistics - Special issue on using large corpora: I

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper attempts to be a complete description, from the implementor's viewpoint, of the basic lexing and parsing requirements of the Modula-2 language. The lexical structure is described informally, while the syntax is specified formally by an LALR(1) grammar expressed in BNF (Backus-Naur Form).Further information is available in the Modula-2 language definition [1].