Accession Number : AD0473758

Title :   GENERATING A RECOGNIZER FOR A BNF GRAMMAR,

Corporate Author : CARNEGIE INST OF TECH PITTSBURGH PA

Personal Author(s) : Earley, Jay

Report Date : 01 JUN 1965

Pagination or Media Count : 23

Abstract : This paper describes an algorithm which takes the BNF definition of the grammar of a language and constructs a set of productions for recognizing sentences of the language. These productions, constitute a language in which may be written a one-pass, one-push-down-stack recognizer, which involves no closed subroutines. Thus it goes directly from the basic definition of the grammar of a programming language to an efficient parser for the language which could easily be incorporated into a compiler. (Author)

Descriptors :   (*LANGUAGE, CHARACTER RECOGNITION), READING MACHINES, PROGRAMMING LANGUAGES, COMPILERS, SET THEORY.

Distribution Statement : APPROVED FOR PUBLIC RELEASE