GENERATING A RECOGNIZER FOR A BNF GRAMMAR,

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)

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1965
Accession Number
AD0473758

Entities

People

  • Jay Earley

Organizations

  • Carnegie Institute of Technology

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Compilers
  • Computer Programming
  • Computer Programs
  • Grammars
  • Language
  • Linguistics
  • Procedures (Computers)
  • Production
  • Programming Languages
  • Social Sciences

Readers

  • Computer Science.
  • Database Systems and Applications
  • Speech Processing/Speech Recognition.