1 indian and (0 or 1 or 2 or 3 ) Chinese=>3C1*(3C0+3C1+3C2+3C3)
2 indian and (0 or 1 or 2 or 3 ) Chinese=>3C2*(3C0+3C1+3C2+3C3)
3 indian and (0 or 1 or 2 or 3 ) Chinese=>3C3*(3C0+3C1+3C2+3C3)
No. Of a's is equal to no. Of b's
By tracing we get set of strings derived from a grammar
A to B is many to one that means in every relationship only one entity of B can participate and many entity of A is participate in one relationship. So, 1000 triples
Same for A to C. So, 10 triples
B and C is one to one. So, only 10 triples are possible.
Maximum no of triples is 1000
If beta is non-terminal then we have to define closure of beta
So to determine lookaheads of new production it is useful.
So, look ahead has effects on items....
A to B and A to C is many to one relationship that means
Every B and every C is participate in a relationship therefore 1000 triples or 10 triples.
Maximum no. Of triples of entities are 1000