All questions of Parsing for Computer Science Engineering (CSE) Exam

• a)
  SLR
• b)
  LR
• c)
  LLR
• d)
  None of the mentioned

• a)
  (01)*0 = 0(10)*
• b)
  (0+1)*0(0+1)*1(0+1) = (0+1)*01(0+1)*
• c)
  (0+1)*01(0+1)*+1*0* = (0+1)*
• d)
  All of the mentioned

• a)
  Grammatical errors only
• b)
  Logical errors only
• c)
  Grammatical and logical errors
• d)
  None of the mentioned

• a)
  type-3 grammar
• b)
  type-2 grammar
• c)
  type-1 grammar
• d)
  type-0 grammar

• a)
  True
• b)
  flase

• a)
  {S->bS, S->b,S->aA, S->bA, A->aB, B->bB, B->aS, S->a}
• b)
  {S->aS,S->bA,A->bB,B->bBa,B->bB}
• c)
  {S->aaS,S->bbA,A->bB,B->ba}
• d)
  None of the mentioned

• a)
  The parsing starts
• b)
  It is possible to do so a left-to-right scan of the input.
• c)
  It is possible to do so a right-to-left scan of the input.
• d)
  Parsing ends

• A:

  7

• B:

  10

• C:

  12

• D:

  11

The answer is d.

• a)
  Is optimized to occupy less space
• b)
  Is optimized to take less time for execution
• c)
  Optimized the code
• d)
  None of the mentioned

• a)
  True
• b)
  Flase

• a)
  All subsets of a regular set are always regular
• b)
  All finite subsets of non-regular set are always regular
• c)
  Union of two non regular set of language is not regular
• d)
  Infinite times union of finite set is always regular

• a)
  Ambiguous
• b)
  Unambiguous
• c)
  Regular
• d)
  None of the mentioned

• a)
  Will be affecting.
• b)
  Does not have any affect.
• c)
  Shift will take place.
• d)
  Reduction will take place.

• a)
  Finite automata
• b)
  Push Down Automata
• c)
  Deterministic Automata
• d)
  None of the mentioned

• a)
  Type 0 language
• b)
  Type 1 language
• c)
  Type 2 language
• d)
  Type 3 language

• a)
  True
• b)
  False

• a)
  Is optimized to occupy less space
• b)
  Both of the mentioned
• c)
  Optimize the code
• d)
  None of the mentioned

• a)
  Rightmost Derivation
• b)
  Right most derivation in reverse
• c)
  Left most derivation
• d)
  Left most derivation in reverse

• a)
  Right Linear Grammar
• b)
  Left Linear Grammar
• c)
  Right & Left Linear Grammar
• d)
  None of the mentioned

• a)
  Only I)
• b)
  I) and ii)
• c)
  I), ii) and iii)
• d)
  I), ii) , iii) and iv)

• a)
  Q has to be regular
• b)
  Q cannot be regular
• c)
  Q need not be regular
• d)
  Q has to be a CFL

• a)
  SLR parsing table
• b)
  Canonical LR parsing table
• c)
  LALR parsing table
• d)
  None of the mentioned

• a)
  a*
• b)
  ab*
• c)
  (a/b)*
• d)
  a*b*c

• a)
  It has 2 or more than 2 left derivations for some terminal string ѡ є L (G)
• b)
  It has 1 or more than 2 left derivations for some terminal string ѡ є L (G)
• c)
  Both of the mentioned
• d)
  None of the mentioned

• a)
  Only S1
• b)
  Only S2
• c)
  Both S1 S2
• d)
  None of the mentioned

• a)
  Addressing mode
• b)
  Order of computations
• c)
  The usage of machine idioms
• d)
  All of the mentioned

• a)
  Removing left recursion only
• b)
   Factoring the grammar alone
• c)
  Factoring & left recursion removal
• d)
  None of the mentioned

• a)
  Compiler
• b)
  Interpreter
• c)
  Compiler or interpreter test
• d)
  None of the mentioned

• a)
  Parser
• b)
  Code optimization
• c)
  Code generator
• d)
  Lexical analyser

• a)
  Top down parser
• b)
  Bottom up parser
• c)
  Maybe both
• d)
  None of the mentioned

• a)
  Is similar to interpreter
• b)
  Uses source code as its input
• c)
  I s required to create a load module
• d)
  None of the mentioned

• a)
  Contains all constants in the program
• b)
  Is a permanent table of decision rules in the form of patterns for matching with the uniform symbol table to discover syntactic structure?
• c)
  Consist of a full or partial list of the token is as they appear in the program created by lexical analysis and used for syntax analysis and interpretation
• d)
  Is a permanent table which lists all keywords and special symbols of the language in symbolic form?

• a)
  Compiler
• b)
  A language expression
• c)
  Regular Expression
• d)
  None of the mentioned

• a)
  True
• b)
   False

• a)
  23131
• b)
  11233
• c)
  11231
• d)
  33211

• a)
  Unallocated storage
• b)
  Allocated storage whose access paths are destroyed?
• c)
  Allocated storage
• d)
  Uninitialized storage

• a)
  Regular grammar to CFG
• b)
  NDFA to DFA
• c)
  NDPDA to DPDA
• d)
  NDTM to DTM

• a)
  Ambiguous
• b)
  Unambiguous
• c)
  Complementation
• d)
  Concatenation Intersection

• a)
  Hierarchical Analysis
• b)
  Hierarchical Parsing
• c)
  None of the mentioned
• d)
  Hierarchical Analysis & Parsing

• a)
  Tracking declaration of a variable
• b)
  Correct use of L and R values
• c)
  All of the mentioned
• d)
  None of the mentioned

• a)
  All <
• b)
  All >
• c)
  < > , =
• d)
  < > > >

• a)
  If a state does not know whether it will make a shift operation using the production rule i or j for a terminal.
• b)
  If a state does not know whether it will make a shift or reduction operation using the production rule i or j for a terminal.
• c)
  If a state does not know whether it will make a reduction operation using the production rule i or j for a terminal.
• d)
  None of the mentioned

• a)
  Use same algorithm, but different parsing table.
• b)
  Same parsing table, but different algorithm.
• c)
  Their Parsing tables and algorithm are similar but uses top down approach.
• d)
  Both Parsing tables and algorithm are different.

• a)
  Regular
• b)
  Context free
• c)
  Context sensitive
• d)
  Recursive

• a)
  Position where next reduce or shift operation will occur
• b)
  The next step has use of Non-terminal for reduction
• c)
  used for reduction in a coming-up step along with a position in the sentential form where the next shift or reduce operation will occur
• d)
  used in the next step for reduction along with a position in the sentential form where the right hand side of the production may be found

• a)
  I only
• b)
  II only
• c)
  Both I and II
• d)
  Neither I nor II

• a)
  Left as well as right most derivations can be in Unambiguous grammar
• b)
  An LL (1) parser is a top-down parser
• c)
  LALR is more powerful than SLR
• d)
  Ambiguous grammar can’t be LR (k)

• a)
  Relocating loader itself
• b)
  Linker
• c)
  Assembler
• d)
  Macro Processor

• a)
  Union
• b)
  Intersection
• c)
  Complementation
• d)
  Concatenation

• a)
  The LALR(1) parser for a grammar G cannot have reduce-reduce conflict if the LR(1) parser for G does not have reduce-reduce conflict. 
• b)
  Symbol table is accessed only during the lexical analysis phase
• c)
  Data flow analysis is necessary for run-time memory management.
• d)
  LR(1) parsing is sufficient for deterministic context-free languages