Applications - Parsers Online Exam Quiz
Applications - Parsers GK Quiz. Question and Answers related to Applications - Parsers. MCQ (Multiple Choice Questions with answers about Applications - Parsers
LALR in LALR parser stands for:
Options
A : Left aligned left right parser
B : Look ahead left to right parser
C : Language Argument left to right parser
D : None of the mentioned
Pigeonhole principle can be applied in the following computer science algorithms:
Options
A : hashing algorithm
B : lossless compression algorithm
C : both (a) and (b)
D : none of the mentioned
State true or false:^ Statement: LALR parsers uses tables rather than mutually recursive functions.
Options
A : TRUE
B : FALSE
C : -
D : -
State true or false:^ Statement: Pumping lemma gives a necessary but not sufficient condition for a language to be regular.
Options
A : TRUE
B : FALSE
C : -
D : -
The language of balanced paranthesis is
Options
A : regular
B : non regular
C : may be regular
D : none of the mentioned
Which kind of proof is used to prove the regularity of a language?
Options
A : Proof by contradiction
B : Direct proof
C : Proof by induction
D : None of the mentioned
Which of the following can be a LALR parser generator?
Options
A : YACC
B : GNU Bison
C : YACC and GNU Bison
D : None of the mentioned
Which of the following is true for a predictive parser?
Options
A : Recursive Descent parser
B : no backtracking
C : Recursive Descent parser and no backtracking
D : None of the mentioned
Which of the following is/are an example of pigeon hole principle?
Options
A : Softball team
B : Sock picking
C : Hair counting
D : All of the mentioned
Which of the following parsers do not relate to Bottom up parsing?
Options
A : LL parser
B : Recursive descent parser
C : Earley parsers
D : All of the mentioned
Ambiguous Grammar more Online Exam Quiz
Applications of Pumping Lemma/Pigeonhole principle