Tweeted twitter.com/StackCompSci/status/693927050160295936 occurred Jan 31 '16 at 22:41 8 added 35 characters in body edited Jan 31 '16 at 0:58 Pu Vexi 1855 bronze badges Could you explain me, how can I check, that the language of first context-free grammar (G1) is a subset of the language of second context-free grammar (G2). G1 and G2 are two LL(1) grammars with identical alphabets: {a, b, c, d, f}  Production rules are look like: A -> αB  or A -> α  and α is a non-epsilon string (of terminal symbols). Context-free grammar G1: S1 -> aK K -> bC|cE C -> cB|d E -> bA|f A -> abC B -> acE  Context free grammar G2 : S2 -> aX X -> bZ|cY Z -> cV|d Y -> bU|f V -> aQ U -> aP Q -> cY P -> bZ  Automatic way is preferred. In additional, how can I check that the languages of two arbitrary context-free grammars are equal. Could you explain me, how can I check, that the language of first context-free grammar (G1) is a subset of the language of second context-free grammar (G2). G1 and G2 are two LL(1) grammars with identical alphabets: {a, b, c, d, f}  Production rules are look like: A -> αB  or A -> α  and α is a non-epsilon string (of terminal symbols). Context-free grammar G1: S1 -> aK K -> bC|cE C -> cB|d E -> bA|f A -> abC B -> acE  Context free grammar G2 : S2 -> aX X -> bZ|cY Z -> cV|d Y -> bU|f V -> aQ U -> aP Q -> cY P -> bZ  In additional, how can I check that the languages of two arbitrary context-free grammars are equal. Could you explain me, how can I check, that the language of first context-free grammar (G1) is a subset of the language of second context-free grammar (G2). G1 and G2 are two LL(1) grammars with identical alphabets: {a, b, c, d, f}  Production rules are look like: A -> αB  or A -> α  and α is a non-epsilon string (of terminal symbols). Context-free grammar G1: S1 -> aK K -> bC|cE C -> cB|d E -> bA|f A -> abC B -> acE  Context free grammar G2 : S2 -> aX X -> bZ|cY Z -> cV|d Y -> bU|f V -> aQ U -> aP Q -> cY P -> bZ  Automatic way is preferred. In additional, how can I check that the languages of two arbitrary context-free grammars are equal. 7 deleted 7 characters in body edited Jan 31 '16 at 0:26 Pu Vexi 1855 bronze badges Could you explain me, how can I check, that the language of first context-free grammar (G1) is a subset of the language of second context-free grammar (G2). G1 and G2 are two LL(1) grammars with identical alphabets: {a, b, c, d, f}  Production rules are look like: A -> αB  or A -> α  and α is a non-epsilon string (of terminal symbols). Context-free grammar G1: S1 -> aK K -> bC|cE C -> cB|d E -> bA|f A -> abC B -> acE  Context free grammar G2 : S2 -> aX X -> bZ|cY Z -> cV|d Y -> bU|f V -> aQ U -> aP Q -> cY P -> bZ  In additional, how can I check that the languages of two arbitrary context-free grammars are equal or not. Could you explain me, how can I check, that the language of first context-free grammar (G1) is a subset of the language of second context-free grammar (G2). G1 and G2 are two LL(1) grammars with identical alphabets: {a, b, c, d, f}  Production rules are look like: A -> αB  or A -> α  and α is a non-epsilon string (of terminal symbols). Context-free grammar G1: S1 -> aK K -> bC|cE C -> cB|d E -> bA|f A -> abC B -> acE  Context free grammar G2 : S2 -> aX X -> bZ|cY Z -> cV|d Y -> bU|f V -> aQ U -> aP Q -> cY P -> bZ  In additional, how can I check that the languages of two arbitrary context-free grammars are equal or not. Could you explain me, how can I check, that the language of first context-free grammar (G1) is a subset of the language of second context-free grammar (G2). G1 and G2 are two LL(1) grammars with identical alphabets: {a, b, c, d, f}  Production rules are look like: A -> αB  or A -> α  and α is a non-epsilon string (of terminal symbols). Context-free grammar G1: S1 -> aK K -> bC|cE C -> cB|d E -> bA|f A -> abC B -> acE  Context free grammar G2 : S2 -> aX X -> bZ|cY Z -> cV|d Y -> bU|f V -> aQ U -> aP Q -> cY P -> bZ  In additional, how can I check that the languages of two arbitrary context-free grammars are equal. 6 added 8 characters in body edited Jan 31 '16 at 0:17 Pu Vexi 1855 bronze badges Could you explain me, how can I check, that the language of first context-free grammar (G1) is a subset of the language of second context-free grammar (G2). G1 and G2 are two LL(1) grammars with identical alphabets: {a, b, c, d, f}  Production rules are look like: A -> αB  or A -> α  and α is a non-epsilon string (of terminal symbols). Context-free grammar G1: S1 -> aK K -> bC|cE C -> cB|d E -> bA|f A -> abC B -> acE  Context free grammar G2 : S2 -> aX X -> bZ|cY Z -> cV|d Y -> bU|f V -> aQ U -> aP Q -> cY P -> bZ  In additional, how can I check that the languages of two arbitraryarbitrary context-free grammarscontext-free grammars are equal or not. Could you explain me, how can I check, that the language of first context-free grammar (G1) is a subset of the language of second context-free grammar (G2). G1 and G2 are two LL(1) grammars with identical alphabets: {a, b, c, d, f}  Production rules are look like: A -> αB  or A -> α  and α is a non-epsilon string (of terminal symbols). Context-free grammar G1: S1 -> aK K -> bC|cE C -> cB|d E -> bA|f A -> abC B -> acE  Context free grammar G2 : S2 -> aX X -> bZ|cY Z -> cV|d Y -> bU|f V -> aQ U -> aP Q -> cY P -> bZ  In additional, how can I check that the languages of two arbitrary context-free grammars are equal or not. Could you explain me, how can I check, that the language of first context-free grammar (G1) is a subset of the language of second context-free grammar (G2). G1 and G2 are two LL(1) grammars with identical alphabets: {a, b, c, d, f}  Production rules are look like: A -> αB  or A -> α  and α is a non-epsilon string (of terminal symbols). Context-free grammar G1: S1 -> aK K -> bC|cE C -> cB|d E -> bA|f A -> abC B -> acE  Context free grammar G2 : S2 -> aX X -> bZ|cY Z -> cV|d Y -> bU|f V -> aQ U -> aP Q -> cY P -> bZ  In additional, how can I check that the languages of two arbitrary context-free grammars are equal or not. 5 edited title edited Jan 31 '16 at 0:07 Pu Vexi 1855 bronze badges 4 edited tags | link edited Jan 30 '16 at 23:30 Pu Vexi 1855 bronze badges 3 edited title | link edited Jan 30 '16 at 23:12 Pu Vexi 1855 bronze badges 2 deleted 1 character in body; edited title edited Jan 30 '16 at 22:46 Pu Vexi 1855 bronze badges 1 asked Jan 30 '16 at 22:40 Pu Vexi 1855 bronze badges