1. Introduction Formal Language: A set of strings (sequences of symbols) constrained by specific rules, formed over an alphabet (a finite set of symbols, denoted Σ).
Where: A, B are nonterminals; a is terminal; α, β, γ are strings of terminals/nonterminals.
Design CFG for balanced parentheses.
