Bissoy
Login
Get Advice on Live Video Call
Earn $ Cash $ with
consultations on Bissoy App
The grammar S → aSa | bS | c is?
A
LL(1) but not LR(1)
B
LR(1) but not LR(1)
C
Both LL(1) but not LR(1) & LR(1) but not LR(1)
D
None of the mentioned
Correct Answer:
Both LL(1) but not LR(1) & LR(1) but not LR(1)
First(aSa) = a First(bS) = b First(c) = c LR parsers are more powerful than LL (1) parsers and LR (1).
Which of the following has the same potency as ASA and better tolerated by patients?
A
Piroxicam
B
Phenylbutazone
C
Ibuprofen
D
Indomethacin
In American Standard Association (ASA) system, if the tool nomenclature is 8-6-5-5-10-15-2 mm, then the side rake angle will be
A
5°
B
6°
C
8°
D
10°
Analyse the two statements and give the correct answer:
Assertion (A): The State Government can declare any area asa "Sanctuary" if the area is of adequate ecological, faunal, floral, geomorphological, natural or zoological significance.
Reason (R): The purpose is to protect, propagate or develop wildlife or its environment.
A
Both (A) and (R) are true and (R) is the correct explanation of (A)
B
Both (A) and (R) are true but (R) is not the correct explanation of (A)
C
(A) is true but (R) is false
D
(A) is true but (R) is true
What is the full form of "ASA"?
A
Acidic Sulphate Anhylic
B
Acetylsalicylic acid
C
Airborne Sulphuric Acid
D
Activation Satellite Agency
Consider the production of the grammar S->AA A->aa A->bb Describe the language specified by the production grammar.
A
L = {aaaa,aabb,bbaa,bbbb}
B
L = {abab,abaa,aaab,baaa}
C
L = {aaab,baba,bbaa,bbbb}
D
L = {aaaa,abab,bbaa,aaab}
Consider the grammar given below E? E+E | E*E | E-E | E/E | E^E | (E) | id Assume that + and ^ have the same but least precedence, * and / have the next higher precedence but the same precedence and finally ^ has the highest precedence. Assume + and ^ associate to the left like * and / and that ^ associates to the right. Choose the correct for the ordered pairs (^,^), (-,-), (+,+), (*,*) in the operator precedence table constructed for the grammar.
A
All <
B
All >
C
< >, =
D
< > > >
A Regular Grammar is any right-linear or left-linear grammar.
A
True
B
False
Left Linear grammar can be converted to Right Linear grammar.
A
Yes
B
No
The grammar A → AA | (A) | e is not suitable for predictive-parsing because the grammar is?
A
Ambiguous
B
Left recursive
C
Right recursive
D
An operator grammar
The grammar A ->AA |( A)| ε is not suitable for predictive-parsing because the grammar is ___________
A
Ambiguous
B
Left-recursive
C
Right-recursive
D
An operator-grammar