Advertisement

Context-free grammars

  • Alexander Shen
Part of the Modern Birkhäuser Classics book series (MBC)

Abstract

To define a context free grammar we should:
  • fix a finite set A, called an alphabet, whose elements are called symbols or letters; finite sequences of symbols are called strings or words;

  • divide all symbols in A into two classes: terminal symbols and nonterminal symbols;

  • choose a nonterminal symbol called the initial symbol, or axiom;

  • fix a finite set of productions, or production rules; each production has the form K → X, where K is some nonterminal and X is a string that may contain both terminal and nonterminal symbols.

Keywords

Production Rule Recursive Call Recursive Procedure Input String Empty String 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1997

Authors and Affiliations

  • Alexander Shen
    • 1
  1. 1.Institute of Problems of Information TransmissionMoscowRussia

Personalised recommendations