Question: Prove that the languages in Figure C 2.39 lie in the regions claimed. Figure 2.39 Nondeterministic language: {abc : n > 1} U{abd:n > 1}

Prove that the languages in Figure C 2.39 lie in the regions claimed.

Figure 2.39

Nondeterministic language: {a 1} U{a"b"d:n > 1} Inherently ambiguous language: {a'b'c* : i= jor j = k; i, j, k > 1} Language with LL(k) grammar but no LL(k-1) grammar: {a"(b | c | b'd)" : n2 1} Language with LR(0) grammar but no LL grammar: n" class="fr-fic fr-dib">

Nondeterministic language: {a"b"c : n > 1} U{a"b"d:n > 1} Inherently ambiguous language: {a'b'c* : i= jor j = k; i, j, k > 1} Language with LL(k) grammar but no LL(k-1) grammar: {a"(b | c | b'd)" : n2 1} Language with LR(0) grammar but no LL grammar: n 11 {a"b" : n > 1}U {a"c" : n > 1}

Step by Step Solution

3.33 Rating (156 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Nondeterministic language L1 a n b n c n 1 a n b 2n d n 1 Our proof is easier if we first show that the language X3a i b i c i is not context free Suppose the contrary Let G be an arbitrary grammar fo... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Language Pragmatics Questions!