JNTUH Results Release Information & College Re-open Info

Coming to the results of the exams conducted in the month of November ( 2-1 Regular, 3-1 Regular,4-1 Regular )  are going to be released mostly in the first week of January firstly 4th year results will be out followed by 3rd and 2nd year there will be one week gap between 4th year ,3rd year,2nd year results respectively . 

 

 As Previously we said colleges being reopened tomorrow i.e 7-12-2015 . Most of the students requested to increase holidays but JNTUH didn't even respond on that issue and  the academic calendar  which is updated previously is only confirmed for this academic year i.e supplementary exams will be conducted in the month of feb going into the details as most of the students requested to conduct supply exams with other schedule rather then conducting with regular exams , JNTUH officials had Agreed for it and given the academic calendar according to It. CLICK HERE  For Academic Calendar Of  second semester:

Most Important Quetions In Linear and Digital Integrated Circuits

UNIT-1

1. Classification of ic’s (8)
2. Explain epitaxial growth, Photolithography process (8)
3. Fabrication of resistor, capacitor, diode, transistor(by giving sample circuits) (16)
4. Isolation techniques

---

Unit -2 1. Explain Block diagram of op-amp (8)
2. Explain ac characteristics of op-amp (8)
3. Explain application of op-amp as integrator and diffrentiator ( read all applications )(8)

---

Unit 3 1. Explain three op-amp instrumentation amplifier with diagram (16)
2. Explain op-amp as comparator (8)
3. Explain D/A convertors (8)
4. Explain A/D convertors using any two methods /(16)

---

Unit 4

1 .explain ic 565 with neat block diagram (16)
2. explain application of ic 555 timer (16)
3. explain functional block diagram of ic 555 timer.(8)

---

Unit -5

1. Explain ic voltage regulator with neat sketch (16)
2. Explain ic 8038 with neat block diagram (16)
3. 3. Explain switching regulators (16)

---

TIPS :
Be knowledgeable in all IC pin details .this will surely help u to get more marks in first unit study all base planar process. So that u can attend both part A and part B question.
In case of 4th unit , study both PLL and VCO question so that u can attend one part B question (99%). In 5^th unit ,study function generator and switching regulator (especially )..it may come surely ....

---

Principles of programming language important quetions unit wise

PPL IMPORTANT QUESTIONS

UNIT-I

1.Explain in detail about various language evaluation criteria and the characteristics that affect them.

2. Explain the process of compilation.

3 Explain about various programming domains.

4 What are the factors that influence the basic design of programming languages?

5 Explain in detail about various language implementation methods.

6. Explain the Language categories.

UNIT-II

1. Distinguish between language generators and language recognizers.

2 Give grammar for simple assignment statements.  Give an unambiguous grammar for if-then-else statement

3.Give BNF and EBNF versions of an expression grammar.

4. Explain about attribute grammars in detail

5.What do you mean by denotational semantic? Give denotational semantics of a simple logical loop.

6. What do you mean by axiomatic semantics? Give the weakest precondition for a sequence of statements

7.Compute the weakest precondition for each of the following assignment statements and post conditions:

a) a=2*(b-1)-1 {a>0}

b) b=(c+10)/3 {b>6}

c) a=a+2*b-1 {a>1}

d) x=2*y+x-1 {x>11}.

8. Distinguish between general language generator and general language recognizer.

9. Describe the basic concept of denotational semantics.

UNIT-III

1 Distinguish between static scoping and dynamic scoping with an example.

2. Explain about user defined ordinal types.

3.Explain about associative arrays.

4. What do you mean by type coercion? Define narrowing and widening conversions

5. Distinguish between name type compatibility and structure type compatibility.

6. Define static, fixed stack-dynamic, stack-dynamic, fixed heap-dynamic and heap-dynamic arrays. What are the advantages of each?

7. Explain about subscript bindings and various array categories

8. Explain the concept of pointers.

UNIT-IV

1. Explain about iteration based on data structures.

2.What are guarded commands?

3.What do you mean by a functional side-effect?

4. What are the design issues of multiple selection constructs?

5What is a mixed mode expression?

6 What are the design issues for logically controlled loop statements

7.What are the design issues for selection structures?

8.What is a short-circuit evaluation?

9. Define functional side effect. How does operand evaluation order interact with functional side effects?

                                                             Unit-5



Explain the basic

primitives of LISP. Give suitable examples

127



Explain the operations that can be performed on atoms & lists in LISP



Discuss basic elements of LISP. Give ex



Write a lisp fn which computes nth Fibonacci number



Explain ML inferencing process



Explain about the

datatypes and their values in python.



What is the importance of module library in python.



What is the difference between a tuple and a list ?



Explain the main features of Imperative Languages.



Write a detail note on functions in ML.

electronic mesurements and instrumentation important quetions of all units

UNIT-1

1. List out the dynamic characteristics of any measurement system.

2. What are the types of error measurement system?

3. What are the static characteristics important?

4. What is standard? What are the different types of standard?

5. What is the function of manipulation element in a measurement system?

6. What are the primary standards? Where are they used?

7. What is primary sensing element?

8. What is calibration?

9. Define the terms precision and sensitivity?

10. Define static error.

11. Distinguish re-productibility and repeatability.

12. Show the block diagram indicating functional elements of measurement system.

13. Distinguish between zero drift and span drift.

14. Define a dynamic response of an instrument.

15. What are the different calibration methodologies?

16. Define limiting errors and instrumental errors.

17. Mention any four static characteristics of measuring instruments.

18. Distinguish between direct and indirect methods of measurements.

19. What is the significance of calibration?

20. What is meant by accuracy and precision of an instrument?

21. List the different types of possible errors in measurements.

22. What is the difference between analog and digital instrument?

23. What are absolute instruments?

24. What is a secondary instrument?

25. How are secondary instruments classified?

16 Marks

1. Draw the block diagram showing the basic functional elements of an instrument and explain the functions of each.

2. Define limiting errors. Derive the expression for relative limiting errors.

3. Explain in detail calibration techniques and draw the calibration curve in general.

4. Give the methods of using any three standard inputs being used for analyzing the dynamic response of system with neat sketches.

5. Explain on the static and dynamic characteristics of a measurement system.

6. Describe in detail the different types of dynamic errors in a measurement system.

7. By using a micro meter screw the following readings were taken of a certain physical length

UNIT -II

2 Marks

1. What is creeping and how it is prevented?

2. What is the working principle of wattmeter employed in measuring instruments?

3. How are the analog instruments classified on the basis of method used for comparing the unknown quantity?

4. Give the advantages of moving iron meters.

5. What are different methods of measurement of frequency in the power frequency range?

6. Explain why it is necessary to make the potential coil circuit purely resistive in wattmeters.

7. What are the advantages of digital instruments over analog instruments?

8. How are resistors are checked using digital multimeters?

9. What is auto ranging?

10. Define resolution of DVM.

11. What are volt-ampere hour and watt-hour?

12. What is the purpose of instrument transformers?

13. What are the various principles of analog type electrical instruments?

14. Give the importance of iron loss measurements.

15. What is the reason for using MI on both A.C and D.C?

16. What is the precaution to be followed while using current transformer?

17. What is transfer instrument?

18. Why the PMMC instrument is not used for a.c measurements?

19. What is the principle of ramp type digital voltmeter?

20. Which torque is absent in energy meter? Why?

21. Explain the purpose of Schmitt trigger in digital frequency meter.

22. What are the essential parts of a ramp type digital voltmeter?

23. Define nominal rate of instrument transformer.

24. Explain the following term as applied to digital displays 3 ½ digit and 4-½ digit display.

25. Explain the principle of digital phase meter.

16 Marks

1. Derive the torque equation of electrodynamometer type instrument.

2. Explain with neat circuit diagram the working of successive approximation type DVM.

3. Draw the circuit diagram of digital phase meter and explain its working.

4. Give the construction and principle of operation of single phase induction type energy meter.

5. Describe the construction and functioning of mechanical type frequency meter.

6. Explain the functioning of Ferro-dynamic type electrical resonance frequency meter.

7. Describe the construction and working of PMMC instrument. Derive the equation for deflection if the instruments are spring controlled.

8. Derive the torque equation for an electro dynamometer type of wattmeter.

9. Write briefly with neat figures on (i) Principle of operation of a current transformer (ii) B-H curve analysis of a magnetic circuit.

10. Explain the working of moving iron instruments.

11. Explain the function of 3 phase energy meter and wattmeter.

12. How the range of d.c. Ammeter and d.c voltmeter can be extended? Derive the expressions to calculate shunt resistance and multiplier resistance.

13. Draw and explain the circuit diagram of digital frequency meter.

14. Explain the working of a digital multimeter with a schematic block diagram.

15. Explain the construction, working principle of a three-phase wattmeter. What is the importance of deflecting torque in these analog instruments?

UNIT-3

 
2 Marks

1. State the advantages of using the bridge circuits for the measurement.

2. What is the sensitivity of Wheat stone bridge?

3. What are the sources of errors in Wheat stone bridge?

4. Give the application and limitations of Wheat stone bridge.

5. Which measurement can be carried out by Maxwell bridge?

6. List the advantages of using standard capacitor in Maxwell bridge.

7. Give the advantage and limitations of Maxwell bridge.

8. What is Hay’s bridge?

9. Compare Hay’s bridge with Maxwell bridge.

10. What is Wien’s bridge?

11. Give the classification of external interference signals.

12. What is capacitance interference?

13. What is electrostatic shielding?

14. What is inductive interference?

15. State the method of reducing inductive interference.

16. What is electromagnetic interference?

17. State the sources of EM waves, which can cause interference.

18. State the method of reducing ground loop interference.

19. What is the standardization of potentiometer?

20. Write the application of d.c. Potentiometers.

21. Write the application of a.c. potentiometers.

16 Marks

1. Derive the bridge balance condition for the Maxwell bridge and Schering bridge

2. Explain in detail about the laboratory type DC potentio meter.

3. Describe about the multiple earth and earth loops.

4. Explain the different techniques of grounding.

5. Describe the circuit of Kelvin double bridge used for measurement of low resistance.

6. Explain how the inductance is measured in terms of known capacitance using Maxwell’s bridge.

7. Explain the working of Schering bridge.

8. Which bridge is used to measure frequency and explain the measurement procedure?

9. With neat diagram explain in detail about Hay bridge.

10. Explain about the Anderson bridge.

UNIT-4

 
2 Marks

1. What are the advantages and disadvantages of FM method of magnetic tape recording?

2. What are the different types of amplifiers used for CRO’s?

3. Give the principle of LCD type display device.

4. Draw a neat diagram on X-Y recorder.

5. Write two advantages of LED on electronic displays.

6. What are the advantages of magnetic tape recorder?

7. What is isolation probe?

8. State the features of ink-jet printers.

9. What are the various methods of recording data?

10. In what way line printers are advantages over dot matrix printer?

11. What are the different types of magnetic recording?

12. What are the different materials used on LED?

13. What are data loggers?

14. What are the functions of data loggers?

15. What are the basic components of data loggers?

16. List the advantages of LCD.

17. What is the sweeper in oscilloscope?

18. List the controllers normally found on XY recorder.

19. What is a recorder? How are the classified?

20. Define the deflection sensitivity of CRT.

21. List the main parts of cathode ray tube.

22. Discuss the advantages and disadvantages of PDM recording.

23. What is the basic operating principle of digital tape recording?

24. What are the basic components of a tape recorder?

25. What are the advantages of LCD over LED?

16 Marks

1. Explain the FM method of magnetic tape recording and explain its advantages and disadvantages.

2. Describe the principle of working and circuit diagram of a digital oscilloscope.

3. With neat figure explain the working principle of a digital CRO. What are its advantages of analog CRO.

4. Explain in detail how the data stored in magnetic disk and tape.

5. Describe the construction and working of LCD’s , mention the difference between light scattering and field effect types of LCD’s also explain the advantages of LCDs.

6. Discuss in detail about various types of recorders.

7. Discuss in detail about dot matrix displays.

8. Explain the various methods of magnetic recording.

9. Describe the pulse duration modulation (PDM) as used in magnetic tape recording and explain its merits and demerits.

10. With neat figure explain the construction and working principle of a digital storage oscilloscope. Compare its advantages over an analog CRO.

UNIT-5
1.) 2 Marks

1. Define transducer.

2. Mention some advantages of electrical transducers.

3. Mention some basic requirements of a transducer.

4. What are the classifications of transducers?

5. What is primary transducer?

6. What is secondary transducer?

7. What is active transducer? Mention some example.

8. What is passive transducer? Mention some example.

9. What is analog and digital transducers?

10. What is inverse transducer?

11. What are the types of potentiometers?

12. What are the advantages and disadvantages of potentiometers?

13. Define strain gauges.

14. Define gauge factor.

15. Mention types of strain gauge.

16. What is resistance thermometer?

17. What are the advantages and disadvantages of resistance thermometers?

18. What is thermistor? State the advantage and disadvantages.

19. What is inductive transducer?

20. Mention some advantages and disadvantages of LVDT.

21. Mention the applications of LVDT.

22. What is the basic principle of capacitive transducer?

23. Mention some advantages and disadvantages of capacitive transducer.

24. What is piezo electric effect?

25. What are the materials used for piezo electric transducer?

26. What are the types of DAS? State the applications also.

27. What are the essential functions of digital DAC?

28. What are the types of ADC?

29. What are the types of DAC?

30. What is smart sensor? Mention some applications.

2.) 16 Marks

1. How the transducers are classified on the basis of principle of operation?

2. Explain the generalized diagram of a digital data acquisition system?

3. Describe the different modes of operation of piezo electric transducers.

4. Describe in details the successive approximation method of ADC.

5. Describe the different principles of working of capacitive transducers.

6. Explain the construction and principle of working of a LVDT.

7. Explain about the thermistor and thermocouples.

8. Discuss R-2R ladder type DAC.

9. Explain the resistive transducer with respective potentiometer.

10. Explain the principle of operation of piezo electric transducer.

11. Discuss in detail about optical encoder, Resistive encoder and shaft encoder.

12. Explain in detail about ADC and DAC converters.

3.) 16 Marks

1. How the transducers are classified on the basis of principle of operation?

2. Explain the generalized diagram of a digital data acquisition system?

3. Describe the different modes of operation of piezo electric transducers.

4. Describe in details the successive approximation method of ADC.

5. Describe the different principles of working of capacitive transducers.

6. Explain the construction and principle of working of a LVDT.

7. Explain about the thermistor and thermocouples.

8. Discuss R-2R ladder type DAC.

9. Explain the resistive transducer with respective potentiometer.

10. Explain the principle of operation of piezo electric transducer.

11. Discuss in detail about optical encoder, Resistive encoder and shaft encoder.

12. Explain in detail about ADC and DAC converters.

Compiler Design Important Questions Must Read

compiler design short quetions with answers of all units

Compiler Design – Set 1

1. What is a compiler?

A compiler is a program that reads a program written in one language –the source language and translates it into an equivalent program in another language-the target language. The compiler reports to its user the presence of errors in the source program.

2. What are the two parts of a compilation? Explain briefly.

Analysis and Synthesis are the two parts of compilation.

The analysis part breaks up the source program into constituent pieces and creates an intermediate representation of the source program.

The synthesis part constructs the desired target program from the intermediate representation.

3. List the subparts or phases of analysis part.

Analysis consists of three phases:

• Linear Analysis.
• Hierarchical Analysis.
• Semantic Analysis.

4. Depict diagrammatically how a language is processed.

Skeletal source program

↓

Preprocessor

↓

Source program

↓

Compiler

↓

Target assembly program

↓

Assembler

↓

Relocatable machine code

↓

Loader/ link editor ←library, relocatable object files

↓

Absolute machine code

5. What is linear analysis?

Linear analysis is one in which the stream of characters making up the source program is read from left to right and grouped into tokens that are sequences of characters having a collective meaning.

Also called lexical analysis or scanning.

6. List the various phases of a compiler.

The following are the various phases of a compiler:

• Lexical Analyzer
• Syntax Analyzer
• Semantic Analyzer
• Intermediate code generator
• Code optimizer
• Code generator

7. What are the classifications of a compiler?

Compilers are classified as:

• · Single- pass
• · Multi-pass
• · Load-and-go
• · Debugging or optimizing

8. What is a symbol table?

A symbol table is a data structure containing a record for each identifier, with fields for the attributes of the identifier. The data structure allows us to find the record for each identifier quickly and to store or retrieve data from that record quickly.

Whenever an identifier is detected by a lexical analyzer, it is entered into the symbol table. The attributes of an identifier cannot be determined by the lexical analyzer.

9. Mention some of the cousins of a compiler.

Cousins of the compiler are:

• · Preprocessors
• · Assemblers
• · Loaders and Link-Editors

10. List the phases that constitute the front end of a compiler.

The front end consists of those phases or parts of phases that depend primarily on the source language and are largely independent of the target machine. These include

• · Lexical and Syntactic analysis
• · The creation of symbol table
• · Semantic analysis
• · Generation of intermediate code

A certain amount of code optimization can be done by the front end as well. Also includes error handling that goes along with each of these phases.

11. Mention the back-end phases of a compiler.

The back end of compiler includes those portions that depend on the target machine and generally those portions do not depend on the source language, just the intermediate language. These include

• · Code optimization
• · Code generation, along with error handling and symbol- table operations.

12. Define compiler-compiler.

Systems to help with the compiler-writing process are often been referred to as compiler-compilers, compiler-generators or translator-writing systems.

Largely they are oriented around a particular model of languages , and they are suitable for generating compilers of languages similar model.

13. List the various compiler construction tools.

The following is a list of some compiler construction tools:

• · Parser generators
• · Scanner generators
• · Syntax-directed translation engines
• · Automatic code generators
• · Data-flow engines

14. Differentiate tokens, patterns, lexeme.

• · Tokens- Sequence of characters that have a collective meaning.
• · Patterns- There is a set of strings in the input for which the same token is produced as output. This set of strings is described by a rule called a pattern associated with the token
• · Lexeme- A sequence of characters in the source program that is matched by the pattern for a token.

15. List the operations on languages.

• · Union – L U M ={s | s is in L or s is in M}
• · Concatenation – LM ={st | s is in L and t is in M}
• · Kleene Closure – L* (zero or more concatenations of L)
• · Positive Closure – L+ ( one or more concatenations of L)

16. Write a regular expression for an identifier.

An identifier is defined as a letter followed by zero or more letters or digits.

The regular expression for an identifier is given as

letter (letter | digit)*

17. Mention the various notational shorthands for representing regular expressions.

• · One or more instances (+)
• · Zero or one instance (?)
• · Character classes ([abc] where a,b,c are alphabet symbols denotes the regular expressions a | b | c.)
• · Non regular sets

18. What is the function of a hierarchical analysis?

Hierarchical analysis is one in which the tokens are grouped hierarchically into nested collections with collective meaning.

Also termed as Parsing.

19. What does a semantic analysis do?

Semantic analysis is one in which certain checks are performed to ensure that components of a program fit together meaningfully.

Mainly performs type checking.

20. List the various error recovery strategies for a lexical analysis.

Possible error recovery actions are:

• · Panic mode recovery
• · Deleting an extraneous character
• · Inserting a missing character
• · Replacing an incorrect character by a correct character
• · Transposing two adjacent characters

Compiler Design – Set 2

1. Define parser.

Hierarchical analysis is one in which the tokens are grouped hierarchically into nested collections with collective meaning.

Also termed as Parsing.

2. Mention the basic issues in parsing.

There are two important issues in parsing.

• · Specification of syntax
• · Representation of input after parsing.

3. Why lexical and syntax analyzers are separated out?

Reasons for separating the analysis phase into lexical and syntax analyzers:

• Simpler design.
• Compiler efficiency is improved.
• Compiler portability is enhanced.

4. Define a context free grammar.

A context free grammar G is a collection of the following

• · V is a set of non terminals
• · T is a set of terminals
• · S is a start symbol
• · P is a set of production rules

G can be represented as G = (V,T,S,P)

Production rules are given in the following form

Non terminal → (V U T)*

5. Briefly explain the concept of derivation.

Derivation from S means generation of string w from S. For constructing derivation two things are important.

i) Choice of non terminal from several others.

ii) Choice of rule from production rules for corresponding non terminal.

Instead of choosing the arbitrary non terminal one can choose

i) either leftmost derivation – leftmost non terminal in a sentinel form

ii) or rightmost derivation – rightmost non terminal in a sentinel form

6. Define ambiguous grammar.

A grammar G is said to be ambiguous if it generates more than one parse tree for some sentence of language L(G).

i.e. both leftmost and rightmost derivations are same for the given sentence.

7. What is a operator precedence parser?

A grammar is said to be operator precedence if it possess the following properties:

1. No production on the right side is ε.

2. There should not be any production rule possessing two adjacent non terminals at the right hand side.

8. List the properties of LR parser.

1. LR parsers can be constructed to recognize most of the programming languages for which the context free grammar can be written.

2. The class of grammar that can be parsed by LR parser is a superset of class of grammars that can be parsed using predictive parsers.

3. LR parsers work using non backtracking shift reduce technique yet it is efficient one.

9. Mention the types of LR parser.

• · SLR parser- simple LR parser
• · LALR parser- lookahead LR parser
• · Canonical LR parser

10. What are the problems with top down parsing?

The following are the problems associated with top down parsing:

• · Backtracking
• · Left recursion
• · Left factoring
• · Ambiguity

11. Write the algorithm for FIRST and FOLLOW.

FIRST

1. If X is terminal, then FIRST(X) IS {X}.

2. If X → ε is a production, then add ε to FIRST(X).

3. If X is non terminal and X → Y1,Y2..Yk is a production, then place a in FIRST(X) if for some i , a is in FIRST(Yi) , and ε is in all of FIRST(Y1),…FIRST(Yi-1);

FOLLOW

1. Place $ in FOLLOW(S),where S is the start symbol and $ is the input right endmarker.

2. If there is a production A → αBβ, then everything in FIRST(β) except for ε is placed in FOLLOW(B).

3. If there is a production A → αB, or a production A→ αBβ where FIRST(β) contains ε , then everything in FOLLOW(A) is in FOLLOW(B).

12. List the advantages and disadvantages of operator precedence parsing.

Advantages

This typeof parsing is simple to implement.

Disadvantages

1. The operator like minus has two different precedence(unary and binary).Hence it is hard to handle tokens like minus sign.

2. This kind of parsing is applicable to only small class of grammars.

13. What is dangling else problem?

Ambiguity can be eliminated by means of dangling-else grammar which is show below:

stmt → if expr then stmt

| if expr then stmt else stmt

| other

14. Write short notes on YACC.

YACC is an automatic tool for generating the parser program.

YACC stands for Yet Another Compiler Compiler which is basically the utility available from UNIX.

Basically YACC is LALR parser generator.

It can report conflict or ambiguities in the form of error messages.

15. What is meant by handle pruning?

A rightmost derivation in reverse can be obtained by handle pruning.

If w is a sentence of the grammar at hand, then w = γn, where γn is the nth right-sentential form of some as yet unknown rightmost derivation

S = γ0 => γ1…=> γn-1 => γn = w

16. Define LR(0) items.

An LR(0) item of a grammar G is a production of G with a dot at some position of the right side. Thus, production A → XYZ yields the four items

A→.XYZ

A→X.YZ

A→XY.Z

A→XYZ.

17. What is meant by viable prefixes?

The set of prefixes of right sentential forms that can appear on the stack of a shift-reduce parser are called viable prefixes. An equivalent definition of a viable prefix is that it is a prefix of a right sentential form that does not continue past the right end of the rightmost handle of that sentential form.

18. Define handle.

A handle of a string is a substring that matches the right side of a production, and whose reduction to the nonterminal on the left side of the production represents one step along the reverse of a rightmost derivation.

A handle of a right – sentential form γ is a production A→β and a position of γ where the string β may be found and replaced by A to produce the previous right-sentential form in a rightmost derivation of γ. That is , if S =>αAw =>αβw,then A→β in the position following α is a handle of αβw.

19. What are kernel & non-kernel items?

Kernel items, whish include the initial item, S’→ .S, and all items whose dots are not at the left end.

Non-kernel items, which have their dots at the left end.

20. What is phrase level error recovery?

Phrase level error recovery is implemented by filling in the blank entries in the predictive parsing table with pointers to error routines. These routines may change, insert, or delete symbols on the input and issue appropriate error messages. They may also pop from the stack.

Compiler Design – Set 3

1. What are the benefits of intermediate code generation?
   • A Compiler for different machines can be created by attaching different back end to the existing front ends of each machine.
   • A Compiler for different source languages can be created by proving different front ends for corresponding source languages t existing back end.
   • A machine independent code optimizer can be applied to intermediate code in order to optimize the code generation.

2. What are the various types of intermediate code representation?

There are mainly three types of intermediate code representations.

• · Syntax tree
• · Postfix
• · Three address code

3. Define backpatching.

Backpatching is the activity of filling up unspecified information of labels using appropriate semantic actions in during the code generation process.In the semantic actions the functions used are mklist(i),merge_list(p1,p2) and backpatch(p,i)

4. Mention the functions that are used in backpatching.

• · mklist(i) creates the new list. The index i is passed as an argument to this function where I is an index to the array of quadruple.
• · merge_list(p1,p2) this function concatenates two lists pointed by p1 and p2. It returns the pointer to the concatenated list.
• · backpatch(p,i) inserts i as target label for the statement pointed by pointer p.

5. What is the intermediate code representation for the expression a or b and not c?

The intermediate code representation for the expression a or b and not c is the three address sequence

t1 := not c

t2 := b and t1

t3 := a or t2

6. What are the various methods of implementing three address statements?

The three address statements can be implemented using the following methods.

• · Quadruple : a structure with atmost four fields such as operator(OP),arg1,arg2,result.
• · Triples : the use of temporary variables is avoided by referring the pointers in the symbol table.
• · Indirect triples : the listing of triples has been done and listing pointers are used instead of using statements.

7. Give the syntax-directed definition for if-else statement.

1. S → if E then S1

E.true := new_label()

E.false :=S.next

S1.next :=S.next

S.code :=E.code | | gen_code(E.true ‘: ‘) | | S1.code

2. S → if E then S1 else S2

E.true := new_label()

E.false := new_label()

S1.next :=S.next

S2.next :=S.next

S.code :=E.code | | gen_code(E.true ‘: ‘) | | S1.code| | gen_code(‘go to’,S.next) | |gen_code(E.false ‘:’) | | S2.code

Compiler Design – Set 4

1. Mention the properties that a code generator should possess.

• · The code generator should produce the correct and high quality code. In other words, the code generated should be such that it should make effective use of the resources of the target machine.
• · Code generator should run efficiently.
  • · Define and use – the three address statement a:=b+c is said to define a and to use b and c.
  • · Live and dead – the name in the basic block is said to be live at a given point if its value is used after that point in the program. And the name in the basic block is said to be dead at a given point if its value is never used after that point in the program.

2. List the terminologies used in basic blocks.

3. What is a flow graph?

A flow graph is a directed graph in which the flow control information is added to the basic blocks.

• · The nodes to the flow graph are represented by basic blocks
• · The block whose leader is the first statement is called initial block.
• · There is a directed edge from block B1 to block B2 if B2 immediately follows B1 in the given sequence. We can say that B1 is a predecessor of B2.

4. What is a DAG? Mention its applications.

Directed acyclic graph(DAG) is a useful data structure for implementing transformations on basic blocks.

DAG is used in

• · Determining the common sub-expressions.
• · Determining which names are used inside the block and computed outside the block.
• · Determining which statements of the block could have their computed value outside the block.
• · Simplifying the list of quadruples by eliminating the common su-expressions and not performing the assignment of the form x := y unless and until it is a must.

5. Define peephole optimization.

Peephole optimization is a simple and effective technique for locally improving target code. This technique is applied to improve the performance of the target program by examining the short sequence of target instructions and replacing these instructions by shorter or faster sequence.

6. List the characteristics of peephole optimization.

• · Redundant instruction elimination
• · Flow of control optimization
• · Algebraic simplification
• · Use of machine idioms

7. How do you calculate the cost of an instruction?

The cost of an instruction can be computed as one plus cost associated with the source and destination addressing modes given by added cost.

MOV R0,R1 1

MOV R1,M 2

SUB 5(R0),*10(R1) 3

8. What is a basic block?

A basic block is a sequence of consecutive statements in which flow of control enters at the beginning and leaves at the end without halt or possibility of branching.

Eg. t1:=a*5

t2:=t1+7

t3:=t2-5

t4:=t1+t3

t5:=t2+b

9. How would you represent the following equation using DAG?

a:=b*-c+b*-c

Compiler Design – Set 5

1. Mention the issues to be considered while applying the techniques for code optimization.

• · The semantic equivalence of the source program must not be changed.
• · The improvement over the program efficiency must be achieved without changing the algorithm of the program.
  • · The machine dependent optimization is based on the characteristics of the target machine for the instruction set used and addressing modes used for the instructions to produce the efficient target code.
  • · The machine independent optimization is based on the characteristics of the programming languages for appropriate programming structure and usage of efficient arithmetic properties in order to reduce the execution time.
    • · Available expressions
    • · Reaching definitions
    • · Live variables
    • · Busy variables

2. What are the basic goals of code movement?
   • To reduce the size of the code i.e. to obtain the space complexity.
   • To reduce the frequency of execution of code i.e. to obtain the time complexity.

3. What do you mean by machine dependent and machine independent optimization?

4. What are the different data flow properties?

5. List the different storage allocation strategies.

The strategies are:

• · Static allocation
• · Stack allocation
• · Heap allocation

6. What are the contents of activation record?

The activation record is a block of memory used for managing the information needed by a single execution of a procedure. Various fields f activation record are:

• · Temporary variables
• · Local variables
• · Saved machine registers
• · Control link
• · Access link
• · Actual parameters
• · Return values

7. What is dynamic scoping?

In dynamic scoping a use of non-local variable refers to the non-local data declared in most recently called and still active procedure. Therefore each time new findings are set up for local names called procedure. In dynamic scoping symbol tables can be required at run time.

8. Define symbol table.

Symbol table is a data structure used by the compiler to keep track of semantics of the variables. It stores information about scope and binding information about names.

9. What is code motion?

Code motion is an optimization technique in which amount of code in a loop is decreased. This transformation is applicable to the expression that yields the same result independent of the number of times the loop is executed. Such an expression is placed before the loop.

10. What are the properties of optimizing compiler?

The source code should be such that it should produce minimum amount of target code.

There should not be any unreachable code.

Dead code should be completely removed from source language.

The optimizing compilers should apply following code improving transformations on source language.

i) common subexpression elimination

ii) dead code elimination

iii) code movement

iv) strength reduction

11. What are the various ways to pass a parameter in a function?

• · Call by value
• · Call by reference
• · Copy-restore
• · Call by name

12. Suggest a suitable approach for computing hash function.

Using hash function we should obtain exact locations of name in symbol table.

The hash function should result in uniform distribution of names in symbol table.

The hash function should be such that there will be minimum number of collisions. Collision is such a situation where hash function results in same location for storing the names.