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

• a)
  SLR
• b)
  LR
• c)
  LLR
• d)
  None 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)
  (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)
  Type 0 language
• b)
  Type 1 language
• c)
  Type 2 language
• d)
  Type 3 language

• a)
  True
• b)
  flase

• 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)
  {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)
  * has higher precedence than +
• b)
  – has higher precedence than *
• c)
  + and — have same precedence
• d)
  + has higher precedence than *

• 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)
  SLR parsing table
• b)
  Canonical LR parsing table
• c)
  LALR parsing table
• d)
  None of the mentioned

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

• a)
  Closure and goto operations work a little bit different
• b)
  Closure and goto operations work similarly
• c)
  Closure and additive operations work a little bit different
• d)
  Closure and associatively operations work a little bit different

• a)
  Variable declarations record is maintained
• b)
  L values and R values
• c)
  All of the mentioned
• d)
  None of the mentioned

• a)
  All the labels of the instructions are symbols
• b)
  Table has entry for symbol name address value
• c)
  Perform the processing of the assembler directives
• d)
  Created during pass 1

• a)
  First
• b)
  Second
• c)
  Third
• d)
  None of the mentioned

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

• 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)
  Re-allocation
• b)
  Allocation
• c)
  Linking
• d)
  Loading

• a)
  2 3 1 4
• b)
  2 1 4 3
• c)
  2 4 1 3
• d)
  2 3 4 1

• 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)
  S1 is correct and S2 is not correct
• b)
  Both S1 and S2 are correct
• c)
  Both S1 and S2 are not correct
• d)
  S1 is not correct and S2 is correct

• a)
  Detects errors
• b)
  None of the mentioned
• c)
  Errors are passed to the text phase
• d)
  All of the mentioned

• a)
  R1 UNION R2 is regular
• b)
  R1 INTERSECTION R2 is regular
• c)
  ∑ INTERSECTION R2 IS NOT REGULAR
• d)
  R2* IS NOT REGULAR

• 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)
  True
• b)
  Flase

• a)
  Logical Error
• b)
  Syntax Error
• c)
  Both Logical and Syntax Error
• d)
  Not Logical and Syntax Error

• a)
  Left linear grammar
• b)
  Right linear grammar
• c)
  Generic grammar
• d)
  All of the mentioned

• a)
  Accepted by DFA
• b)
  Accepted by PDA
• c)
  Accepted by LBA
• d)
  Accepted by Turing machine

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

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

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

• a)
  Type0
• b)
  Type1
• c)
  Type2
• d)
  Type3

• a)
  n/2
• b)
  n-1
• c)
  2n-1
• d)
  2^n

• a)
  True
• b)
  False

• a)
  [(a+b)*-(aa+bb)]*
• b)
  [(0+1)-(0b+a1)*(a+b)]*
• c)
  (01+11+10)*
• d)
  (1+2+0)*(1+2)*

• 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)
  It allocates space for the literals
• b)
  Calculates total length of the program
• c)
  Symbol table is built for the symbols and their value
• d)
  All of the mentioned

• a)
  Assembler
• b)
  Linker
• c)
  Loader
• d)
  Text editor

• a)
  Syntax
• b)
  Semantics
• c)
  Structure
• d)
  Library

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

• a)
  * has higher precedence than +
• b)
  – has higher precedence than *
• c)
  + and — have same precedence
• d)
  + has higher precedence than *

• a)
  Postfix notation
• b)
  Syntax Trees
• c)
  Three Address code
• d)
  All 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)
  (i. only
• b)
  (i. and (iii. only
• c)
  (ii. and (iii. only
• d)
  (iii. and (iv. only

• a)
  Insert symbols onto the stack
• b)
  Delete symbols from the stack
• c)
  Inserting or deleting symbols from the input
• d)
  All of the mentioned

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

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