search
Log In
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Sep 2019
  1. Satbir

    567 Points

  2. Bikram

    566 Points

  3. GAITONDE

    348 Points

  4. Vimal Patel

    87 Points

  5. Shaik Masthan

    38 Points

  6. BLACK_CLOUD

    14 Points

  7. sekhar_1621

    13 Points

  8. OgbeborBeatrice

    13 Points

  9. RAMYA.F

    9 Points

  10. vkw1111

    9 Points

Recent questions tagged grammar

0 votes
1 answer 10 views
I have a language $L= \{a^nb^nc^m : n, m \ge 0\}$. Now, I wanted to determine whether this language is linear or not. So, I came up with this grammar: $S \rightarrow A\thinspace|\thinspace Sc$ $A \rightarrow aAb \thinspace | \thinspace \lambda$ I'm pretty ... So, I'm unable to find whether the language is linear or not and what goes wrong in above logic with either case. Please help.
asked Sep 11 in Theory of Computation Vimal Patel 199 points 10 views
0 votes
0 answers 15 views
Which of the following grammar(s) produce regular languages?
asked Aug 9 in Theory of Computation siva_skl 6 points 15 views
0 votes
1 answer 16 views
Identify from the following the string generated by following $ S→SS , $ $S \rightarrow \ (S_1, $ $ S_1→S) ,$ $S_1 \rightarrow ) $ A. $(( ) ( ) ))$ B. $((((( )))))) ($ C. $( ) ( ) ( ) ( ))$ D.$ (( ) ((( )) ( )))$
asked Jul 31 in Theory of Computation kshubham538 -6 points 16 views
2 votes
4 answers 137 views
What is the maximum number of language a context-free Grammar (CFG) can generate? Three Two One Infinite
asked Jul 31 in Compiler Design akshat sinha 12 points 137 views
0 votes
1 answer 9 views
Consider the production grammar S→AB | AS A→a | aA B→b Which of the following regular expressions corresponding to the production grammar?
asked Jul 17 in Theory of Computation kshubham538 -6 points 9 views
0 votes
1 answer 18 views
Write the grammar for the following language : $L = \{w : n_a (w)= n_b (w) + 1\}$ where no. of $a’s$ is one more than no. of $b’s.$
asked Jul 6 in Theory of Computation googlegoku 9 points 18 views
0 votes
1 answer 7 views
Is it possible that there is a grammar which is RE but not recursive? If so then is there any example?
asked Jul 3 in Theory of Computation Shubhm 20 points 7 views
0 votes
0 answers 13 views
Find grammar for the language on $\sum$={a} L={w | |w| mod 3>0} is this correct? S->aA A->aB | $\varepsilon$ B->aS | $\varepsilon$
asked Jun 20 in Theory of Computation aditi19 29 points 13 views
To see more, click for the full list of questions or popular tags.
...