Register

Recent questions tagged context-free-grammar

293
views
1 answers
1 votes
PhD Qualifier Examination, Paper I
Give a context-free grammar for the set of all strings over the alphabet {a, b} with exactly twice as many a’s as b’s. Explain the working of the grammar by characterizing the strings generated by each non-terminal.
User Avatar
638
views
0 answers
0 votes
PDA | TOC | Practice Question
Identify the type of the given language and draw the corresponding automata for the language.$L=\left \{a^{i}b^{j}c^{k} \space\ | \space\ j=max(i,k) \right \}$A] RegularB] DCFLC] CFL but not DCFLD] Non-CFLPlease describe your selection.
User Avatar
318
views
1 answers
0 votes
Construct a grammar which generates all odd integers up to 999
User Avatar
980
views
2 answers
0 votes
made easy test series - parsing - context-free grammar
Consider the following context-free grammar:Find the number of unique productions in {Goto (A → D.BC, B) U Goto (A → .DBC, D)}
User Avatar
650
views
2 answers
3 votes
#Gate CS Applied Course Mock Test
Is this Language a CFL?If yes, Can you please explain the implementation.
User Avatar
686
views
1 answers
1 votes
Test series Made easy
How to solve this ? Please help.
User Avatar
259
views
1 answers
1 votes
made easy test 1 2022
how option 2 is correct becz regular lang. dosnt accept comparision can anyone explain?
User Avatar
5.1k
views
1 answers
2 votes
Greibach Normal Form
Convert the following grammar into Greibach Normal Form.E-> E + T | TT-> T*F | FF->(E) | a I am unable to process this type of grammer into GNF, Can someone please provide a detailed explaination?
User Avatar
393
views
1 answers
3 votes
Applied Test Series
How to approach with such questions. Do we have to generate strings to validate the property of the grammars ?
User Avatar
288
views
2 answers
1 votes
can someone share the approach for the following que
14.Show that the grammar S → aSb |SS| e is ambiguous, but that the language denoted by it is not.Can someone share the approach for second part.
User Avatar
719
views
1 answers
2 votes
TIFR CSE 2021 | Part B | Question: 9
Let $L$ be a context-free language generated by the context-free grammar $G = (V, \Sigma, R, S)$ where $V$ is the finite set of variables, $\Sigma$ the finite set of ... ast }${L}'=\left \{ xx \mid x \in L \right \}$None of the above
User Avatar
3.2k
views
1 answers
0 votes
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 10
Consider an $\varepsilon$-tree CFG. If for every pair of productions $A\rightarrow u$ and $A\rightarrow v$If $\text{FIRST(u)} \cap \text{FIRST(v)}$ is empty then the CFG ... $(A)$ and $(B)$None of the above
User Avatar
1.5k
views
1 answers
0 votes
NIELIT 2016 MAR Scientist B - Section C: 29
The CFG $S \to aS\mid bS\mid a\mid b$ is equivalent to $(a+b)$(a+b)(a+b)^*$(a+b)(a+b)$all of these
User Avatar
1.2k
views
1 answers
0 votes
NIELIT 2017 DEC Scientist B - Section B: 7
Let $G$ be a grammar in CFG and let $W_1,W_2\in L(G)$ such that $\mid W_1\mid=\mid W_2\mid$ then which of the following statements is true?Any ... .Some derivation of $W_1$ may be shorter than the derivation of $W_2$None of the options
User Avatar
1.3k
views
1 answers
0 votes
NIELIT 2017 DEC Scientist B - Section B: 26
The grammar $S\rightarrow aSb\mid bSa\mid SS\mid \varepsilon $ is:Unambiguous CFGAmbiguous CFGNot a CFGDeterministic CFG
User Avatar
492
views
2 answers
0 votes
UGC NET CSE | December 2005 | Part 2 | Question: 4
Which sentence can be generated by $S\rightarrow d/bA, A\rightarrow d/ccA$ :$\text{bccddd}$\text{aabccd}$\text{ababccd}$\text{abbbd}$
User Avatar
1.6k
views
2 answers
0 votes
UGC NET CSE | January 2017 | Part 3 | Question: 22
Let $G= (V,T,S,P)$ be a context-free grammer such that every one of its productions is of the form $A\rightarrow v$, with $\mid v \mid=K> 1$. The derivation tree for any ...
User Avatar
536
views
1 answers
0 votes
TIFR CSE 2020 | Part B | Question: 6
Consider the context-free grammar below ($\epsilon$ denotes the empty string, alphabet is $\{a,b\}$):$S\rightarrow \epsilon \mid aSb \mid bSa \mid SS.$What ... $a$ and $b$
User Avatar
Page: