kontextfrei

Der CYK-Algorithmus am Beispiel
{ S → AB|BC, A → BA|a, B → CC|b, C → AB|a }
• Prüfe w = baaba ∈L(G)
• Berechne V i,j = {A ∈V | A ∗
−→ w i...w j}
{S, A, C}
— {S, A, C}
— {B} {B}
{S, A} {B} {S, C} {S, A}
{B} {A, C} {A, C} {B} {A, C}
b a a b a
• S ∈V1,5, also w ∈L(G)
THEORETISCHE INFORMATIK I §3: KONTEXTFREIE SPRACHEN 20 EIGENSCHAFTEN KONTEXTFREIER SPRACHEN