1. Use recursion method to define grammar inductively, 2. Use semantic meanning
ID: 3865007 • Letter: 1
Question
1. Use recursion method to define grammar inductively,
2. Use semantic meanning for non-terminals method
for the following language:
strings have equal numbers of x and y. For example your language will accept following strings xy, xyxy, xyxyxy, xxxyyy, xxyxyy, but will reject xyx, xxxyy, xxy, yyxxx, ... .
Also show that grammar you created is ambiguos or not by using parse tree approach.
_______________________________________________________________________________________________
Develop a context-sensitive grammar that generates the language
L = { in jm kn lm | n, m 1}
Show the derivation of string "iijjjkklll" using your CSG grammar.
Explanation / Answer
The set of all strings over an alphabet is denoted by
which includes the empty string . For example for
= {0, 1}, = {, 0, 1, 00, 01, 10, 11, . . . }. Note
that is a countably infinite set. Also n denotes the
set of all strings over whose length is n. Hence
= 0 1 2 3 . . . and
+ = 1 2 3 . . . . Subsets of are called
languages. For example if = {a, b}
L1 = {, a, b}
L2 = {ab, aabb, aaabbb, . . . }
L3 = {w /|w|a = |w|b}
In the above example, L1 is finite, L2 and L3 are
infinite languages. denotes an empty language.
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.