3. 3
Grammar
how words and their component parts combine to form sentences
I think (O)
Sentence → Subject Verb
think think I (X)
exp → num + num
7 + 5 (O)
+ 2 5 (X)
4. 4
Grammar
G = ( VN, VT, P, S )
VN = A finite set of non-terminal symbols
VT = A finite set of terminal symbols
P = A finite set of production rules
S = S∈N, start symbol
5. 5
Grammar
S ⇒ aA (S → aA)
S ⇒ abS (A → bS)
S ⇒ abbB (S → bB)
S ⇒ abbaS (B → aS)
S ⇒ abba (S → E)
P : S → aA | bB | Epsilon
P : A → bS
P : B → aS
G = ({S, A}, {a, b}, P, S)
VN VT
8. 8
Regular Grammar
P : S → aA | c
P : A → Sb
G = ({S, A}, {a, b, c}, P, S)
S ⇒ aA ⇒ aSb ⇒ acb
S ⇒ aA ⇒ aSb ⇒ aaAb
S ⇒ aaSbb ⇒ aacbb
L(G) = { ancbn | n ≥ 0 }
↔ r"a*cb*" (X)
P : S → aA | c
P : A → bS
G = ({S, A}, {a, b, c}, P, S)
S ⇒ aA ⇒ abS ⇒ abc
S ⇒ aA ⇒ abS ⇒ abaA
S ⇒ ababS ⇒ ababc
L(G) = { (ab)n c | n ≥ 0 }
↔ r "(?:ab)*c" (O)
11. 11
Context Free Grammar
P : A → α
V*
P : S → aA | c
P : A → Sb
V* = ( VN U VT )*, A string of variables and/or terminals
12. 12
Context Free Grammar
P : S → ( S )
P : S → EpsilonP :
G = ({S}, {( , )}, P, S)
S ⇒ ( S ) ⇒ ( )
S ⇒ ( S ) ⇒ (( S )) ⇒ (( ))
S ⇒ ( S ) ⇒ (( S )) ⇒ ((( S ))) ⇒ ((( )))
L(G) = { (n )n | n ≥ 1 } ↔ r"(*)*" (X)
13. 13
Relation between RL and CFL
Context Free Language
Regular Language
Every Regular Language is Context Free Language!