gs gs101 Regular Expressions and Languages - Lexical Analysis - Quiz No.2
gs gs101 Automata Theory Quiz
This quiz belongs to book/course code gs gs101 Automata Theory of gs organization. We have 92 quizzes available related to the book/course Automata Theory. This quiz has a total of 6 multiple choice questions (MCQs) to prepare and belongs to topic Regular Expressions and Languages. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to prepare online MCQs and quizzes.
NVAEducation also facilitates users to contribute in online competitions with other students to make a challenging situation to learn in a creative way. You can create one to one, and group competition on an topic of a book/course code. Also on NVAEducation you can get certifications by passing the online quiz test.
Question 2: ____________ is used for grouping up of characters into token.
Lexical Analyzer
oolex
jflex
All of the mentioned
Question 3: The action of parsing the source code into proper syntactic classes is known as:
Parsing
Interpretation analysis
Lexicography
Lexical Analysis
Question 4: Which of the following is the task of lexical analysis?
Building a uniform symbol table
Parsing the source code into tokens
Building a literal and identifier table
None of the mentioned
Question 5: The scanner outputs:
Stream of tokens
Image file
Intermediate code
Machine code
Question 6: The phase of compilation which involves type checking is:
Parsing
Scanning
Syntax directed translation
Semantic Analyzer
Online Quizzes of gs101 Automata Theory
Other Classes Of Problems - Randomized Algorithm - Quiz No.1
gs gs101
Automata Theory Online Quizzes
Push Down Automata - DPDA and Ambiguous Grammars - Quiz No.1
gs gs101
Automata Theory Online Quizzes
