432 views
0 votes
0 votes

1 Answer

0 votes
0 votes
Regular and cfg can generate epsilon in case of csl , recursive , re . If language = NULL in undecidable

Related questions

683
views
0 answers
0 votes
ahmed65956 asked Sep 27, 2023
683 views
Give the translation scheme that converts infix to postfix form for the following grammar. Also generate the annotated parse tree for input string 2+6+1E- E+TE->TT->0|1|2...
5.8k
views
4 answers
3 votes
Harit asked Apr 25, 2016
5,776 views
Consider the following grammar. How many back tracks are required to generate the string aab from the above grammar?S → aB | aAbA → bAb | aB → aB | ε
184
views
0 answers
0 votes
Md Sazzad asked Dec 23, 2023
184 views
How many strings are there of lowercase letters of length four or less, not counting the empty string?