학술논문

LR; LR(1) grammar analyzer and parser generator. [IBM370; FORTRAN (ANSI X3. 9-1966)]
Document Type
Technical Report
Author
Source
Other Information: The vocabulary is limited to 500 items. The number of productions is limited to 500. The size of the parsing automaton is also limited based on the complexity and number of states. A relatively large number of simple states or a relatively small number of complex states is possible. Reference report, UCRL-82926
Subject
99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE COMPUTER CODES
L CODES
COMPUTERS
FORTRAN
IBM COMPUTERS
PROGRAMMING LANGUAGES 990200* -- Mathematics & Computers
Language
English
Abstract
LR is an LR(1) parsing system written entirely in ANSI standard FORTRAN-66. The system includes a grammar analyzer program which reads a context-free grammar as input and produces LR(1) parsing tables as output, and a skeleton parser that, when compiled with the tables as data, will parse the language defined by the grammar. Table generation also produces a complete grammar listing with error messages, diagnostic data, and a trace of the parser generation process.IBM370; FORTRAN (ANSI X3.9-1966); OS/370; One input unit (LUN20) and one output unit (LUN21) are required. Disk is suggested for output. The program uses approximately 40,000 decimal words of working storage at LLL. LR requires 278K bytes of storage to execute the sample problems on an IBM370/195.