Recent questions tagged grammer - GATE CSE Doubts

0 votes

0 answers

Ace Test Series
I know A,B,C are valid answer But can anyone confirm if D is also valid..We have epsilon in RHS it should not be Operator Grammer so D should be also valid???...can i get help

asked Jan 9 in Compiler Design by vipin.gautam1906 (5 points) | 16 views

0 votes

0 answers

Madeeasy workbook (Parsing)
Consider the following grammer: S → S | S;S S → V = E V → id[E] | id E → id | (E) Find the number of conflicts in LR(0).

asked Nov 20, 2019 in Compiler Design by chinmayetw (5 points) | 15 views

0 votes

0 answers

Made easy test sereise
Is following grammar has language which is inherently ambiguous? $S \rightarrow aaAb | aab | A$ $A \rightarrow aaAb | aAb | \epsilon$ I think that this grammar has unambiguous grammar as follow. Let's first rewrite the grammar as below such that this ... to perform $S \rightarrow A$. Please help me with this. I want to know whether this language is inherenly ambigous or not?

asked Sep 13, 2019 in Compiler Design by Vimal Patel (1.5k points) | 38 views

0 votes

1 answer

Gate 2002 theory of computer
Which of the following is true? The complement of recursive language is recursive the compliment of recursively enumerable language is recursively enumerable the complement of recursively enumerable language is either recursive or recursively enumerable ... -L but universal language also contains recursively enumerable languages then how option(a) can he right

asked Jul 18, 2019 in Theory of Computation by Hashim1996 (5 points) | 55 views

To see more, click for the full list of questions or popular tags.

8,968 questions

3,119 answers

14,340 comments

95,792 users