Register

Recent questions tagged regular-grammar

2 votes
4 answers
61
grammer in compiler design
Which of the following is the most general phase-structured grammar? (a) regular (b) context-free (c) context-sensitive (d) none of the above
Which of the following is the most general phase-structured grammar?(a) regular (b) context-free(c) context-sensitive (d) none of the above
User Avatar
4 votes
2 answers
62
grammer in compiler design
Which of the following grammars are not phase-structured? (a) regular (b) context-free (c) context-sensitive (d) none of the above
Which of the following grammars are not phase-structured?(a) regular (b) context-free(c) context-sensitive (d) none of the above
User Avatar
2 votes
1 answer
63
grammer in compiler design
If a is a terminal and S, A, B are three non-terminals, then which of the following are regular grammars? (a) S → ε, A → aS|b (b) A → aB|a, B → bA|b (c) A → Ba|Bab (d) A → abB|aB
If a is a terminal and S, A, B are three non-terminals, then which of the following are regular grammars?(a) S → ε, A → aS|b(b) A → aB|a, B → bA|b(c) A → Ba|Ba...
User Avatar
7 votes
2 answers
64
Convert RE to Left Linear Grammer
How to convert a Regular Expression to Left Linear Grammar ? Eg : (0+1)*00(0+1)*
How to convert a Regular Expression to Left Linear Grammar ?Eg : (0+1)*00(0+1)*
User Avatar
0 votes
1 answer
68
Regular or Context Free Grammar?
Consider the following statement: if (expression) statement else statement Which of the following describe the above statement? A). Regular grammar B). Context free grammar C). Both (A) and (B) D). None of these
Consider the following statement:if (expression) statement else statement Which of the following describe the above statement?A). Regular grammarB). Context free grammarC...
User Avatar
40 votes
2 answers
70
GATE IT 2006 | Question: 29
Consider the regular grammar below $S \rightarrow bS \mid aA \mid \epsilon $ $A \rightarrow aS \mid bA$ ... $\{\epsilon\},\{wa \mid w \in (a + b)^* \text{and} \{wb \mid w \in (a + b)^*\}$
Consider the regular grammar below$S \rightarrow bS \mid aA \mid \epsilon $$A \rightarrow aS \mid bA$ The Myhill-Nerode equivalence classes for the language generated by ...
User Avatar
Page: