Register

is regular grammar does not generate empty string?

412 views
0 votes
0 votes
User Avatar

1 Answer

0 votes
0 votes
Regular and cfg can generate epsilon in case of csl , recursive , re . If language = NULL in undecidable
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
2
ahmed65956 asked Sep 27, 2023
631 views
10. 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+1 E-> E+T E->T T->0|1|2|3|4|5|6|7|8|9
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...
User Avatar
3 votes
3 votes
4 answers
3
Harit asked Apr 25, 2016
5,611 views
Consider the following grammar. How many back tracks are required to generate the string aab from the above grammar?
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 | ε
User Avatar
0 votes
0 votes
0 answers
4
Md Sazzad asked Dec 23, 2023
152 views
How many strings are there of lowercase letters of length four or less, not counting the empty string?
How many strings are there of lowercase letters of length four or less, not counting the empty string?
User Avatar
Link Copied!