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.
KeywordsProduction Rule Recursive Call Recursive Procedure Input String Empty String
Unable to display preview. Download preview PDF.