00:01
Hello students, the ambiguity in derivation tree, let us consider the string as the x, y, x, x, y as an example.
00:11
So the first derivative tree, the first derivative tree for this will be as the x, y, x, x, x, that will be as the x, y, x, y, x and the final will be x, y, x, x, y.
00:32
So the second derivative tree for this will be as s of x, y, x, y, y with the small x, x, y, y and the last will be as x, y, x, x, y.
00:49
So both of these leads to the same string that is the x, y, x, x, y but have the different derivation part indicating that the grammar is an ambiguous.
01:02
So this is known to be an ambiguity, this is known to be an ambiguity in derivation tree, in the derivation tree which means that we have the same string, the tree leads to the same string, to the same string but have the different path, but have the different derivation path, derivation path indicating that the grammar is an ambiguous.
01:56
The second is as the chomczyk normal form that is the cnf, cnf.
02:09
So it converts the grammar to cnf, we need to eliminate the production with the more than two non -terminal and the unit production.
02:20
So for that the first step is to eliminate, the first step is to eliminate the unit product, unit productions, productions whereas this is as x, small x, y, capital x, y, capital x with e x, y, x, y, y, y, y, x, x, if we are using as if of x, y, y is less than x.
03:00
So we are using the condition as the x will be as x, y, y of small y by small x's.
03:07
Now we need to convert the remaining product, so convert the remaining products, productions whereas the s string will be as a of b, a, c, d, e if f, g.
03:34
So we are terming as a, b, a, c, d, e if f, g...
