What is the output of a lexical analyzer? o A parse tree o A list of tokens o Intermediate code o Machine code A programmer writes a program to multiply two numbers and uses the division operator by mistake (instead of the multiplication one). Which one of the following can detect this error? o Compiler o Interpreter o Semantic analyzer o Programmer The sequence of characters that make up a token is known as a o String o Lexeme o Pattern o Tree A recursive descent parser is a o Top down parser o Bottom up parser o Table based parser o LR(1) parser Which of the following grammars is the most powerful?

o Context sensitive o Context free o Regular o All of them have the same capability What is the output of Flex? o A C file with the code for a lexical analyzer o A C file with the code for a syntax analyzer o An executable file for a lexical analyzer o An executable file for a syntax analyzer What is the output of Bison? o A C file with the code for a lexical analyzer o A C file with the code for a syntax analyzer o An executable file for a lexical analyzer o An executable file for a syntax analyzer Which of the following regular expression denotes a language comprising all possible strings of even length over the alphabet (0,1) o 1+(1+0)* o (0+1)(1+0)* o (1+0) o (0+1)* Which of the following languages is described by the productions SAA, Aaa, A bb o L = {aaaa,aabb,bbaa,bbbb} o L = {abab,abaa,aaab,baaa} o L = {aaab,baba,bbaa,bbbb} o L = {aaaa,abab,bbaa,aaab} When designing a recursive descent parser, a function corresponding to each of the following is defined. o Terminals o Non-terminals o Null productions o Start symbol Bison constructs a o Top down parser o Bottom up parser o Recursive descent parser o None of the above Which section of a Flex files contains the rules o First o Second o Third

o Fourth Which of the following derivations does a top down parser use while parsing an input string? The input is assumed to be in left to right order. o Left most derivation o Right most derivation o Left most derivation in reverse o Right most derivation in reverse Regular expressions can be used to design o Lexical anaylzers o Parsers o Semantic analyzers o Logical error analyzers