Desenvolva uma Gramática Livre do Contexto (GLC) sobre o alfabeto Σ = {x, y, z, w}, que reconheça a linguagem L = {w | w possui xyw ou wzz como prefixo, wzx ou wyx como subpalavra e xyy ou xwz como sufixo}.

G = ({exp, pre, presub, sub, subsuf, suf, alf}, {x, y, z, w}, P, exp)
P = {< exp >     ->  < pre > < alf > < sub > < alf > < suf >
                 |   < presub > < alf > < suf >
                 |   < pre > < alf > < subsuf >
                 |   xywzxyy
                 |   xywzxwz
                 |   xywyxyy
                 |   xywyxwz
     < pre >     ->  xyw
                 |   wzz
     < presub >  ->  xywzx
                 |   xywyx
     < sub >     ->  wzx
                 |   wyx
     < subsuf >  ->  wzxyy
                 |   wzxwz
                 |   wyxyy
                 |   wyxwz
     < suf >     ->  xyy 
                 |   xwz
     < alf >     ->  < alf > x
                 |   < alf > y
                 |   < alf > z
                 |   < alf > w
                 |   ε  }

G = ({exp, pre, presub, sub, subsuf, suf, alf}, {x, y, z, w}, P, exp)
P = {< exp >     ->  < pre > < alf > < sub > < alf > < suf >
                 |   < presub > < alf > < suf >
                 |   < pre > < alf > < subsuf >
                 |   xywzxyy
                 |   xywzxwz
                 |   xywyxyy
                 |   xywyxwz
     < pre >     ->  xyw
                 |   wzz
     < presub >  ->  xywzx
                 |   xywyx
     < sub >     ->  wzx
                 |   wyx
     < subsuf >  ->  wzxyy
                 |   wzxwz
                 |   wyxyy
                 |   wyxwz
     < suf >     ->  xyy 
                 |   xwz
     < alf >     ->  x < alf >
                 |   y < alf >
                 |   z < alf >
                 |   w < alf >
                 |   ε  }