Register

Recent questions tagged grammar

2 votes
1 answer
331
UGC NET CSE | June 2013 | Part 3 | Question: 35
Which of the following is/are the fundamental semantic model(s) of parameter passing? in mode out mode in-out mode all of the above
Which of the following is/are the fundamental semantic model(s) of parameter passing?in modeout modein-out modeall of the above
User Avatar
0 votes
1 answer
332
UGC NET CSE | June 2014 | Part 3 | Question: 74
Match the following $:$ ... $\text{a-iii, b-iv, c-i, d-ii}$ $\text{a-iii, b-iv, c-ii, d-i}$
Match the following $:$$\begin{array}{clcl} & \textbf{List – I} & & \textbf{List – II} \\ \text{a.} & \text{Chomsky Normal form} & \text{i.} & S \rightarrow b S S...
User Avatar
2 votes
1 answer
335
Peterlinz question
Please write grammar for it and explain with example. $L=\{w \: : n_a(w) > n_b(w) \}$
Please write grammar for it and explain with example.$L=\{w \: : n_a(w) n_b(w) \}$
User Avatar
1 votes
1 answer
336
Peterlinz exercise
Please solve this question with proper explanation: $L=\{ w : \: n_a(w) = 2n_b(w) \}$
Please solve this question with proper explanation:$L=\{ w : \: n_a(w) = 2n_b(w) \}$
User Avatar
3 votes
1 answer
340
Calculate the FIRST and FOLLOW for each non Terminal
Consider the Following Grammar P - > S S - > A | A ;S A - > id = E E - > E+E | E-E | E*E | E/E | (E) | T T - > id | num Calculate FIRST and FOLLOW for each non terminal.
Consider the Following GrammarP - SS - A | A ;S A - id = EE - E+E | E-E | E*E | E/E | (E) | TT - id | numCalculate FIRST and FOLLOW for each non terminal.
User Avatar
3 votes
2 answers
341
ambiguous grammar
An ambiguous grammar is one that produces more than one left most derivation for the same sentence. more than one right most derivation for the same sentence. more than one leftmost derivation for the different sentence. i and ii i or ii ii and iii ii or iii
An ambiguous grammar is one that producesmore than one left most derivation for the same sentence.more than one right most derivation for the same sentence.more than one ...
User Avatar
7 votes
4 answers
342
ISRO2011-68
Which of the following sentences can be generated by S -> aS $\mid$ bA A -> d $\mid$ cA bccdd abbcca abcabc abcd
Which of the following sentences can be generated by S - aS $\mid$ bAA - d $\mid$ cAbccddabbccaabcabcabcd
User Avatar
3 votes
1 answer
343
TOC CFG
If language $L=\{a^n b^n \mid n \geq 0\}$, then language $L^2$ is given by $\{a^{2n} b^{2n} \mid n \geq 0\}$ $\{a^n b^n a^n b^n \mid n \geq 0\}$ $\{a^n b^n \mid n \geq 0\}$ $\{a^n b^n a^m b^m \mid n, m \geq 0\}$
If language $L=\{a^n b^n \mid n \geq 0\}$, then language $L^2$ is given by$\{a^{2n} b^{2n} \mid n \geq 0\}$$\{a^n b^n a^n b^n \mid n \geq 0\}$$\{a^n b^n \mid n \geq 0\}$$...
User Avatar
0 votes
2 answers
344
Compiler Design Grammar
User Avatar
1 votes
2 answers
345
Toc CFG
The production rules for a given context-free grammar are $S \rightarrow aA, A \rightarrow bB, A \rightarrow aB$ and $B \rightarrow a$ in Chomsky normal form Greibach normal form Simple form None of the above
The production rules for a given context-free grammar are $S \rightarrow aA, A \rightarrow bB, A \rightarrow aB$ and $B \rightarrow a$ inChomsky normal formGreibach norma...
User Avatar
0 votes
2 answers
346
Compiler Design Phase
Analysis which determines the meaning of a statement once its grammatical structure becomes known is termed as (A) Semantic analysis (B) Syntax analysis (C) Regular analysis (D) General analysis
Analysis which determines the meaning of a statement once its grammatical structure becomes known is termed as (A) Semantic analysis (B) Syntax a...
User Avatar
0 votes
3 answers
348
Which of the following is most general phase structured grammar?
(A) Context – Sensitive (B) Regular (C) Context – Free (D) None of the above
(A) Context – Sensitive (B) Regular(C) Context – Free (D) None of the above
User Avatar
1 votes
2 answers
349
TOC Grammar
What is the Language represented by this L = {w / where w ={a ,b}} and Na(w)>=Nb(w)+1.What is the machine which can be used to process this lang ?
What is the Language represented by this L = {w / where w ={a ,b}} and Na(w)>=Nb(w)+1.What is the machine which can be used to process this lang ?
User Avatar
7 votes
7 answers
350
ISRO2008-7
Consider the grammar $S \rightarrow ABCc \mid bc$ $BA \rightarrow AB$ $Bb \rightarrow bb$ $Ab \rightarrow ab$ $Aa \rightarrow aa$ Which of the following sentences can be derived by this grammar? abc aab abcc abbc
Consider the grammar$S \rightarrow ABCc \mid bc$$BA \rightarrow AB$$Bb \rightarrow bb$$Ab \rightarrow ab$$Aa \rightarrow aa$Which of the following sentences can be derive...
User Avatar
2 votes
1 answer
352
Automata Grmmar Language
What is the Language represented by this given Grammar ? S ---> AS1 S1 ---> aS1b /eps A --->aA /eps Please solve it completely don't write just Answer because it need to know the method .
What is the Language represented by this given Grammar ?S - AS1S1 - aS1b /epsA ->aA /epsPlease solve it completely don't write just Answer because it need to know the ...
User Avatar
0 votes
2 answers
353
Automata Grammar Language
What is the relationship between a Language -to- Grammar and a Grammar -to -Language .Give an example for both. A. One -to- Many B. One -to- One C. Many -to- One D. Many to- Many
What is the relationship between a Language -to- Grammar and a Grammar -to -Language .Give an example for both.A. One -to- ManyB. One -to- OneC. Many -to- One D. Many to-...
User Avatar
1 votes
2 answers
354
Automata Language Grammar
What is one of the Grammar represented by this Language ? L = {a^n b^n+1 where n>=0} Give an Example for this.
What is one of the Grammar represented by this Language ?L = {a^n b^n+1 where n>=0} Give an Example for this.
User Avatar
2 votes
1 answer
359
How to remove Left recursion from this Grammar ?
A-->AA+/AA*/a is it eligible to be used by SR parse. If we apply SR parse on this grammar then what will be the order of activation Record in Stack
A >AA+/AA*/ais it eligible to be used by SR parse.If we apply SR parse on this grammar then what will be the order of activation Record in Stack
User Avatar
0 votes
1 answer
360
Compiler
There may exist a grammar that is non LL(1) but generating an LL(1) language. Explain whether the above statement is true or false .
There may exist a grammar that is non LL(1) but generating an LL(1) language.Explain whether the above statement is true or false .
User Avatar
Page: