search
Log In
0 votes
130 views
in Compiler Design 130 views

1 Answer

1 vote

Equality  means given two grammar whether they generate the same language .

Equality checks whether two grammar are equivalent .

Inclusion means suppose you have two grammar .One grammar  G1 generating some strings .

Inclusion  checks whether second grammar G2 generate  all the string generated by first grammar G1.

0

does converse holds for Equality  ..what i mean is given 2 different languages can we say that these 2 different languges can be derived from the same Grammar.

0
not making sense for me.How 2 different language is can be generated from same grammar.

Let us say L1=a^n b^n //n>=1and L2 =b^na^n//n>=1

Related questions

0 votes
0 answers
2
102 views
Q- the Grammer S-> aSb | bSa |SS |Ɛ a) unambiguous CFG b) ambiguous CFG c) not a CFG d) deterministic CFG
asked Nov 18, 2018 in Theory of Computation shashank joshi 102 views
0 votes
0 answers
3
76 views
Operator precedence parser even parses ambiguous grammars that are in form of operator grammars. I am inquiring about the nature of the ambiguous grammar. Could the language described by the operator grammar be both $DCFL$ or $NCFL$?
asked Dec 9, 2018 in Compiler Design 2019_Aspirant 76 views
3 votes
1 answer
4
643 views
lets consider a grammar as: $A\rightarrow Ab | Ac | a$ while checking whether it belongs to LL(1) grammar, we would point out that it has a left recursion as well as left factoring. I was wondering that what would be the case if we had lookahead, k, ... we are looking beyond the common symbol, A to decide the production rule to be applied. any further insights about the same will be very helpful.
asked Oct 2, 2017 in Compiler Design AskHerOut 643 views
...