Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged ambiguous
0
votes
0
answers
31
Ambiguity
Ques. S --> Aa/bAc/dc A --> d Isn't this grammar Ambiguous? If First(S) has more than one production giving the same first value, isn't it ambiguous?
Ques. S Aa/bAc/dc A d Isn't this grammar Ambiguous?If First(S) has more than one production giving the same first value, isn't it ambiguous?
Warlock lord
846
views
Warlock lord
asked
Aug 22, 2017
Compiler Design
ambiguous
grammar
+
–
2
votes
1
answer
32
REGULAR OR NOT
As given that 1st is not regular and 2nd is regular as 1st not form AP but 2nd form.but if in 2nd we fix value of m and n same then it will work as 1st(not regular) so 2nd also should not be regular.as i know if we fix m or n value as any constant it will be AP but what if same???
As given that 1st is not regular and 2nd is regular as 1st not form AP but 2nd form.but if in 2nd we fix value of m and n same then it will work as 1st(not regular) so 2n...
learner_geek
568
views
learner_geek
asked
Aug 8, 2017
Theory of Computation
theory-of-computation
set-theory&algebra
compiler-design
ambiguous
regular-language
+
–
2
votes
1
answer
33
REGULAR OR NOT
Please mention reason with answer:-
Please mention reason with answer:-
learner_geek
376
views
learner_geek
asked
Aug 8, 2017
Theory of Computation
theory-of-computation
compiler-design
ambiguous
regular-language
set-theory&algebra
+
–
0
votes
1
answer
34
TestBook TestSeries
Consider the following statements : i) An ambiguous grammar can not generate DCFL. ii) An unambiguous grammar will always generate deterministic context free language. iii) Any non-empty language admits an ambiguous grammar. iv) All regular grammars are unambiguous. Which of the above is/are TRUE? i) and iv) only ii) and iii) only iii) only ii) and iv) only
Consider the following statements :i) An ambiguous grammar can not generate DCFL.ii) An unambiguous grammar will always generate deterministic context free language.iii) ...
vnc
388
views
vnc
asked
Jan 29, 2017
Theory of Computation
theory-of-computation
ambiguous
+
–
0
votes
0
answers
35
Self Doubt
By seeing a grammar I can say it is ambiguous or not. But How can I say it is inherently ambiguous or not.?
By seeing a grammar I can say it is ambiguous or not. But How can I say it is inherently ambiguous or not.?
Lucky sunda
749
views
Lucky sunda
asked
Jan 22, 2017
Theory of Computation
theory-of-computation
inherently-ambiguous
ambiguous
+
–
0
votes
1
answer
36
Test by Bikram | Mock GATE | Test 1 | Question: 34
Consider the following grammar for Boolean expression: $E$ $\rightarrow$ $E$ OR $E$ $E$ $\rightarrow$ $E$ AND$E$ $E$ $\rightarrow$ NOT $E$ $E$ $\rightarrow$ $\left ( E \right )$ $E$ $\rightarrow$ TRUE $E$\rightarrow$ FALSE $E$ $\ ... grammar is Ambiguous Non-ambiguous $LL$ $\left ( 1 \right )$ Both$\left ( A \right )$ and $\left ( C \right )$
Consider the following grammar for Boolean expression:$E$ $\rightarrow$ $E$ OR $E$$E$ $\rightarrow$ $E$ AND$E$$E$ $\rightarrow$ NOT $E$$E$ $\rightarrow$ $\left ( E \right...
Bikram
394
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
grammar
ambiguous
compiler-design
+
–
0
votes
0
answers
37
Grammar ambiguity and parsing
$\begin{align*} \text {stmt} &\rightarrow \text{if expr then stmt else stmt} \\ & \;\; \;\; | \text{ if expr then stmt} \\ & \;\; \;\; | \text{ other} \end{align*}$ Which of the following statement/s is ... and the ambiguity cannot be resolved. B. The grammar is unambiguous C. The grammar is ambiguous and the ambiguity can be resolved D. None of these
$$\begin{align*} \text {stmt} &\rightarrow \text{if expr then stmt else stmt} \\ & \;\; \;\; | \text{ if expr then stmt} \\ & \;\; \;\; | \text{ other} \end{align*}$$Whic...
dd
961
views
dd
asked
Dec 15, 2016
Compiler Design
compiler-design
ambiguous
dangling-else-problem
parsing
+
–
2
votes
3
answers
38
Theory-of-computation
S-> S+S | S*S | a | € Which is false? a) G is ambiguous b) L is ambiguous c) both a and b d) none
S- S+S | S*S | a | €Which is false? a) G is ambiguous b) L is ambiguous c) both a and bd) none
Chetnawadhwa
671
views
Chetnawadhwa
asked
Nov 8, 2016
Theory of Computation
theory-of-computation
ambiguous
inherently-ambiguous
grammar
+
–
2
votes
2
answers
39
ambiguous grammar
Consider the following context-free grammar S → SS + | SS*| a for the string aa + a*. Is the grammar ambiguous ?
Consider the following context-free grammarS → SS + | SS*| a for the string aa + a*. Is the grammar ambiguous ?
Shashank Chandekar
4.2k
views
Shashank Chandekar
asked
Nov 3, 2016
Compiler Design
ambiguous
compiler-design
grammar
theory-of-computation
+
–
2
votes
2
answers
40
How to determine whether the grammar is regular or not?
If any grammer is given, how can we tell that the grammar is regular or not? Is that any perticular method?
If any grammer is given, how can we tell that the grammar is regular or not? Is that any perticular method?
Kaushal28
2.3k
views
Kaushal28
asked
Sep 21, 2016
Theory of Computation
compiler-design
ambiguous
set-theory&algebra
+
–
1
votes
1
answer
41
Parse trees
How will we treat the given two parse trees..? Are they same i.e one is has been derived using lmd n other using rmd or they both will be treated as two diffent parse trees concluding it as ambiguous.. Only with reference to the string 'b' otherwise i know its ambiguous...
How will we treat the given two parse trees..? Are they same i.e one is has been derived using lmd n other using rmd or they both will be treated as two diffent parse tr...
Chetnawadhwa
1.4k
views
Chetnawadhwa
asked
Jul 22, 2016
Theory of Computation
ambiguous
grammar
compiler-design
+
–
3
votes
2
answers
42
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 ...
vivekpinto07
3.9k
views
vivekpinto07
asked
Jun 24, 2016
Unknown Category
parsing
compiler-design
grammar
ambiguous
+
–
5
votes
4
answers
43
ISRO2015-22
Consider the following relational query on the above database: SELECT S.name FROM Suppliers S Where S.sid NOT IN (SELECT C.sid FROM Catalog C WHERE C.pid NOT IN (SELECT P.pid FROM Parts P WHERE P.color <>'blue')) Find the names of ... names of all suppliers who have supplied only non-blue parts Find the names of all suppliers who have not supplied only non-blue part.
Consider the following relational query on the above database:SELECT S.name FROM Suppliers S Where S.sid NOT IN (SELECT C.sid FROM Catalog C WHERE C.pid NOT IN (SELECT P....
go_editor
5.0k
views
go_editor
asked
Jun 17, 2016
Databases
isro2015
databases
sql
ambiguous
+
–
4
votes
1
answer
44
Draw a Parse Tree and verify whether this grammar is Ambiguous or Not .
X--> X(Y) / Y Y--> (X)Y / 0 / 1 / Eps
X X(Y) / YY (X)Y / 0 / 1 / Eps
shekhar chauhan
1.2k
views
shekhar chauhan
asked
Jun 2, 2016
Compiler Design
compiler-design
parsing
ambiguous
+
–
112
votes
7
answers
45
GATE CSE 2016 Set 1 | Question: 50
Consider the following proposed solution for the critical section problem. There are $n$ processes : $P_0....P_{n-1}$. In the code, function $\text{pmax}$ ... in the critical section at any time The bounded wait condition is satisfied The progress condition is satisfied It cannot cause a deadlock
Consider the following proposed solution for the critical section problem. There are $n$ processes : $P_0....P_{n-1}$. In the code, function $\text{pmax}$ returns an inte...
Sandeep Singh
47.2k
views
Sandeep Singh
asked
Feb 12, 2016
Operating System
gatecse-2016-set1
operating-system
process-synchronization
difficult
ambiguous
+
–
43
votes
4
answers
46
GATE CSE 2016 Set 2 | Question: 13
Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in the ascending order, which of the following are TRUE? Quicksort runs in $\Theta (n^2)$ time Bubblesort runs in $\Theta (n^2)$ time Mergesort runs ... Insertion sort runs in $\Theta (n)$ time I and II only I and III only II and IV only I and IV only
Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in the ascending order, which of the following are TRUE?Qu...
Akash Kanase
14.2k
views
Akash Kanase
asked
Feb 12, 2016
Algorithms
gatecse-2016-set2
algorithms
sorting
time-complexity
normal
ambiguous
+
–
7
votes
1
answer
47
Can Regular Grammar be ambiguous ?
Aditya
8.8k
views
Aditya
asked
Aug 6, 2015
Compiler Design
compiler-design
regular-grammar
ambiguous
+
–
2
votes
1
answer
48
LR(K) grammer can be ambigious or not?
ansaritk
867
views
ansaritk
asked
Dec 17, 2014
Compiler Design
compiler-design
parsing
lr-parser
ambiguous
+
–
65
votes
9
answers
49
GATE IT 2004 | Question: 13
Let $P$ be a singly linked list. Let $Q$ be the pointer to an intermediate node $x$ in the list. What is the worst-case time complexity of the best-known algorithm to delete the node $x$ from the list ? $O(n)$ $O(\log^2 n)$ $O(\log n)$ $O(1)$
Let $P$ be a singly linked list. Let $Q$ be the pointer to an intermediate node $x$ in the list. What is the worst-case time complexity of the best-known algorithm to del...
Ishrat Jahan
24.6k
views
Ishrat Jahan
asked
Nov 1, 2014
DS
gateit-2004
data-structures
linked-list
normal
ambiguous
+
–
76
votes
10
answers
50
GATE CSE 2014 Set 2 | Question: 33
A computer has twenty physical page frames which contain pages numbered $101$ through $120$. Now a program accesses the pages numbered $\text{1, 2, ..., 100}$ in that order, and repeats the access sequence THRICE. Which one of ... as the optimal page replacement policy for this program? Least-recently-used First-in-first-out Last-in-first-out Most-recently-used
A computer has twenty physical page frames which contain pages numbered $101$ through $120$. Now a program accesses the pages numbered $\text{1, 2, ..., 100}$ in that ord...
go_editor
28.3k
views
go_editor
asked
Sep 28, 2014
Operating System
gatecse-2014-set2
operating-system
page-replacement
ambiguous
+
–
55
votes
3
answers
51
GATE CSE 2014 Set 1 | Question: 3
Let $G=(V,E)$ be a directed graph where $V$ is the set of vertices and $E$ the set of edges. Then which one of the following graphs has the same strongly connected components as $G$ ? $G_1$ = $(V,E_1)$ ... $u$ to $v$ in $E\}$ $G_4$ = $(V_4,E)$ where $V_4$ is the set of vertices in $G$ which are not isolated
Let $G=(V,E)$ be a directed graph where $V$ is the set of vertices and $E$ the set of edges. Then which one of the following graphs has the same strongly connected compon...
go_editor
16.7k
views
go_editor
asked
Sep 26, 2014
DS
gatecse-2014-set1
data-structures
graph-theory
ambiguous
+
–
86
votes
7
answers
52
GATE CSE 2009 | Question: 47
While opening a $TCP$ connection, the initial sequence number is to be derived using a time-of-day (ToD) clock that keeps running even when the host is down. The low order $32$ bits of the counter of the ToD clock is to be used for the initial sequence numbers ... sequence numbers used for packets of a connection can increase? $0.015$/s $0.064$/s $0.135$/s $0.327$/s
While opening a $TCP$ connection, the initial sequence number is to be derived using a time-of-day (ToD) clock that keeps running even when the host is down. The low orde...
Kathleen
25.2k
views
Kathleen
asked
Sep 22, 2014
Computer Networks
gatecse-2009
computer-networks
tcp
difficult
ambiguous
+
–
65
votes
6
answers
53
GATE CSE 2012 | Question: 15
Which of the following statements are TRUE about an SQL query? P : An SQL query can contain a HAVING clause even if it does not have a GROUP BY clause Q : An SQL query can contain a HAVING clause only if it has a GROUP BY clause R : All attributes used ... Not all attributes used in the GROUP BY clause need to appear in the SELECT clause P and R P and S Q and R Q and S
Which of the following statements are TRUE about an SQL query?P : An SQL query can contain a HAVING clause even if it does not have a GROUP BY clauseQ : An SQL query can ...
gatecse
39.7k
views
gatecse
asked
Aug 5, 2014
Databases
gatecse-2012
databases
easy
sql
ambiguous
+
–
Page:
« prev
1
2
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register