Scribd
Upload
22 views2 pages

SSQBANK

The document contains sample question banks for 6 modules covering topics in Computer Science and Engineering for the academic year 2022-23. Module 1 includes questions on assembler design, object code derivation, program reloading, instruction formats, assembler directives, machine architecture and addressing modes. Module 2 covers compiler applications, phases, lexing, grammars and closures. Module 3 focuses on grammar concepts like FOLLOW, FIRST, ambiguity, parsing tables and left recursion. Module 4 discusses Lex and Yacc programs, their basic sections and how they communicate.

Uploaded by

Uma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
22 views2 pages

SSQBANK

The document contains sample question banks for 6 modules covering topics in Computer Science and Engineering for the academic year 2022-23. Module 1 includes questions on assembler design, object code derivation, program reloading, instruction formats, assembler directives, machine architecture and addressing modes. Module 2 covers compiler applications, phases, lexing, grammars and closures. Module 3 focuses on grammar concepts like FOLLOW, FIRST, ambiguity, parsing tables and left recursion. Module 4 discusses Lex and Yacc programs, their basic sections and how they communicate.

Uploaded by

Uma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Computer Science and Engineering

Academic Year: 2022-23

Question Bank (6th SEM)

Module 1

1. Name the various assembler design methods? What is a multi-pass assembler?


2. Derive the object code for 0017 J CLOOP
(J=3C, CLOOP=0006, PC=001A)
3. Derive the object code for J @ RETADDR
(J=3C, RETADDR=0030, PC=002D)
4. What are the various program relocation methods of loader?
5. Explain in detail about the instruction format of SIC/XE.
6. What is the use of assembler directive? Give examples.
7. Explain in detail about SIC/XE machine architecture
8. Describe the various machine independent assembler features
9. Name the various addressing modes in SI/XE with examples
10. Write a notes on Text record, Modification record and End record

Module 2

1. What are the applications of a compiler?


2. Explain the various phases of compiler with examples
3. Define the terms Lexeme, token and pattern
4. What is regular definition how it can use for grammar productions
5. What is clean closure and positive closure

Module 3

1. Derive the FOLLOW of all the non terminals for the following CFG
S->AaB, A->b|є, B->c

2. Find FOLLOW of Q for the following CFG


P->xQRS, Q->yz|z, R->w|ϵ, S->y
3. Find FIRST and FOLLOW of all the non terminals
S->ABCDE, A->a| ϵ, B->B| ϵ, C->c, D->d| ϵ, E->E| ϵ
4. Consider the CFG, E->E+E, E->E-E, E->E*E, E->E/E, E->id, show that the
grammar is ambiguous for the sentence id+id*id.
5. Derive the parsing table for the following grammar, E->E+T/T, T->T*F/F, F-
> (E)/id by removing left recursion
6. Describe the shift-reduce paring process in detail with an example
7. Eliminate left recursion from the following grammar
S->Ab/ac/sd, B->bBc, C->g
8. Parse the CFG with shift reduce parsing E->E+T|T, T->T*F|F, F->(E)|id
9. Write a note on Top down and Bottom up parser with examples
10. Find FOLLOW of the CFG S->Bb|Cd, B->Ab|є, C->cC| ϵ

Module 4

1. Explain the three basic section of LEX program with example


2. Write a Yacc program to evaluate an arithmetic expression, and explain the
various sections
3. Define the terms yylex(), yywrap(), yyerror(), yyparse()
4. Write a lex program t eliminate comment lines.
5. Describe how Lexer and parser communicate with a diagram
6. Write a lex program to count the number of digits in an expression
7. With a neat diagram explain the oerations of LEX and YACC.

You might also like