Automata Theory Part E
Explore the Depths of Automata Theory
Test your knowledge and understanding of Automata Theory with our comprehensive quiz. Designed for students and enthusiasts alike, this quiz covers a range of topics, from context-free grammars to pushdown automata.
Join in to discover:
- 28 thought-provoking questions
- Insight into your understanding of CFG and PDA
- Challenge yourself and enhance your learning!
What is the property of trees used in representing the parsing of a statement using a CFG?
They are directed graphs
They are graphs with cycles
They are undirected graphs
They are graphs without cycles
What is the problem with using Λ (the empty string) in a context-free grammar?
It can cause ambiguity
It can generate too many strings
It can slow down parsing algorithms
It can cause errors in the grammar
What is a parse tree in language processing?
A graph representation of a derivation
A graph representation of a context-free grammar
A graph representation of a regular expression
A graph representation of a finite automaton
If G is the grammar S→SbS|a then……….
Is not ambiguous
G is ambiguous
Neither A nor B
Both A & B
A terminal string w∈LG is ambiguous if………
There exist two or more derivation trees for w
It has many branches
there exist two or more leftmost derivations of w
A & C
Grammar that produces more than one Parse tree for same sentence is …….
Ambiguous
Unambiguous
Complementation
Concatenation Intersection
A CFG is ambiguous if …….
It has more than one rightmost derivations
No parse tree can be generated for the CFG
None of the mentioned
It has more than one leftmost derivations
A given grammar is called ambiguous if …….
there is a sentence with more than one derivation tree corresponding to it
Two or more productions have the same non-terminal on the lefthand side
A derivation tree has more than one associated sentence
Brackets are not present in the grammar
A grammar with more than one parse tree is called
Unambiguous
Regular
Ambiguous
Push down grammar
Parsing is categorized into how many types?
2 Types
4Types
3 Types
5 Types
Removing ambiguity by
Eliminate “useless” variables
Eliminate Λ-productions: A→Λ
Eliminate unit productions: A→B
ALL
The transition a Push down automaton makes is additionally dependent upon the:
Stack
Terminals
Input tape
None of the mentioned
A pushdown automaton is a
6-tuple (Q, Σ, Γ, δ, q0, F)
5-tuple (Q, Σ, δ, q0, F)
A&B
None of the above
Which of the following are always unambiguous?
Non-Deterministic Regular grammars
Deterministic Context free grammars
Context sensitive grammar
None of the mentioned
A Pushdown Automata (PDA ) is a DFA equipped with a/an:
Array
Trees
Linked list
Single stack
A PDA is a 6-tuple M = (Q, Σ, Γ, δ, q0, Z0, F ), where Q is:
Finite set of states
The stack alphabet
The input alphabet
None of these
A grammar with more than one parse tree is called:
Unambiguous
Ambiguous
Regular
None
A …………. Is the graph representation of a derivation.
Parse tree
Hash Tables
Parse queue
Linked Lis
�…..grammar is about categorizing the statements of a language
CFG
CLG
CCL
FCG
�……is the graph representation of a derivation
CFG
Parse tree
Non is correct
Parsing
�….. Pushdown Automata (PDA ) is a DFA equipped with a single stack
CFGF
CLG
PDA
NFA
Which of the following is a method for converting a context-free grammar to Chomsky normal form:……….
Eliminating left-recursion and factoring out common prefixes
Splitting each non-terminal symbol into two symbols
Eliminating ε-productions and removing unit productions
Replacing each production rule with an equivalent regular expression.
Parsing can be expressed using a special type of graph called ………
NFA
Trees
Cycle exist
Derivation
A context-free grammar is ambiguous if …. :
It has more than one rightmost derivations
It has more than one leftmost derivations.
No parse tree can be generated for the CFG
None of the mentioned
Which of the following are always unambiguous?
. Deterministic Context free grammar
Context sensitive grammar
. Non- Deterministic Context free grammar.
None of the mentioned
A CFG is not closed under …..
Dot operation
Union operation
Concatenation operation
Iteration operation
Which of the following is an real-world programming language ambiguity?
Dangling else problem
Maze problem.
Halting problem
None of the mentioned
Which of the following is a parser for an ambiguous grammar?
GLR Parser
Both GLR and Chart Parsers
Chart Parsers
None of the mentioned
{"name":"Automata Theory Part E", "url":"https://www.quiz-maker.com/QPREVIEW","txt":"Test your knowledge and understanding of Automata Theory with our comprehensive quiz. Designed for students and enthusiasts alike, this quiz covers a range of topics, from context-free grammars to pushdown automata.Join in to discover:28 thought-provoking questionsInsight into your understanding of CFG and PDAChallenge yourself and enhance your learning!","img":"https:/images/course7.png"}
More Quizzes
Automata Theory True / False
301568
Automata Theory Part D
371866
Automata Theory Part A
50250
Automata Theory Part C
12669
صلي علي النبي ❤ ( NLP )
36180
Compiler design Lab Test
12625
Speech Perception Babey
1369
Animal Names Quiz
740
Prepositions 2 basic
211063
USED/USED TO/ BE USED TO/ GET USED TO
12658
BELGNAOUI DRISS- ALMANSOUR DAHBI HIGH SCHOOL- AIN Aouda
The gerund/ The to infinitive and The bare infinitive
50250
English Vocabulary Mastery Quiz
1478