CSC 335 Notes 2 Chapter 4: Context-Free Languages & Grammars (CFLs & CFGs)

Subscribe to read and download this work.

Context-Free Languages

Applications of CFLs & CFGs

Structure of a production

CFG conventions

Syntactic Expressions in Programming Languages

String membership

Generalization of derivation

Left-most & Right-most Derivation Styles

How to prove that your CFGs How to prove that your CFGs are correct

Parse Trees, Derivations, and Recursive Inferences

Interchangeability of different CFG representations

The connection between CFLs Connection between CFLs and RLs

CFLs & Regular Languages

Ambiguity in CFGs and CFLs

Removing Ambiguity in Expression Evaluations

Inherently Ambiguous CFLs