Example 7.1.2.The construction in the proof of Theorem 7.1.1 appliedto Example 7.1.1 results in the following equivalent context-sensitive grammar
S _ DS | A, DA _ XaA, A _ Xa, Xa _ a,
DXa _ YXa, YXa _ YZ, YZ _ XaZ, XaZ _ XaXaD.
Example 7.1.3.A non-erasing grammar for {ak bk ck | k 1} (start = A).
A _ aABC, aB _ ab, C _ c,
A _ aBC, bB _ bb, CB _ BC.
As a sample derivation we have: A _ aABC _ aaBCBC _ aabCBC _ aabBCC _ aabbCC _ aabbcC _ aabbcc
Previous slide | Next slide | Back to first slide | View graphic version |