gs gs101 Regular Expressions and Languages - Lexical Analysis - Quiz No.1
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 10 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 1: Lexemes can be referred to as:
elements of lexicography
sequence of alphanumeric characters in a token
lexical errors
none of the mentioned
Question 2: If the lexical analyser finds a lexeme with the same name as that of a reserved word,it _________
overwrites the word
overwrites the functionality
generates an error
something else
Question 3: The methodology to show an error when the analyzer faces a keyword over an user’s input is based on:
rule priority
longest match rule
keyword-out rule
none of mentioned
Question 5: Which among the following statement is correct?
Statement 1: When the analyzer scans ‘int’ and ‘intvalue’, it is not able to decide whether the int leads to a keyword or an identifier.
Statement 2: Longest Match Rule
Statement 1: When the analyzer scans ‘int’ and ‘intvalue’, it is not able to decide whether the int leads to a keyword or an identifier.
Statement 2: Longest Match Rule
Statement 1 is assertion, Statement 2 is the reason
Statement 1 is assertion, Statement 2 is the solution
There is no such Statement 2
This is not a function of Lexical Analyzer
Question 6: The output of the lexical and syntax analyzer can stated as:
parse stream, parse tree
token tree, parse tree
token stream, parse tree
all of the mentioned
Question 7: Which among the following is not a tool to construct lexical analyzer from a regular expression?
lex
flex
jflex
none of the mentioned
Question 8: A program that performs lexical analysis is termed as:
scanner
lexer
tokenizer
all of the mentioned
Question 9: Lexers and parsers are not found in which of the following?
compiler front end processing
prettyprinters
linters
none of the mentioned
Question 10: Which phase of compiler includes Lexical Analysis?
1
2
3
Its primary function, not in any phase
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
