计算机语法和编程英文版.pptVIP

L4CFG cs466(Prasad) L4CFG * Context-free Grammars cs466(Prasad) L4CFG * Recursive definition Grammar Derivation cs466(Prasad) L4CFG * What is the syntax of the description (meta-language)? External form of the grammar How do we associate a language with such a description? Semantics or use of the grammar Generators: Grammars specify languages by generating strings in the language. Recognizers: Grammars can be viewed as a notation for describing a family of recognition algorithms. cs466(Prasad) L4CFG * CFG = (V, ,P,S) V : Finite set of variables/non-terminals : Alphabet/Finite