Trending ▼   ResFinder  

2003 Course Voice Networks (I)

3 pages, 29 questions, 0 questions with responses, 0 total responses,    0    0
pune_eng
  
+Fave Message
 Home > pune_eng >

Formatting page ...

Total No. of Questions : 12] P985 [Total No. of Pages : 3 [3664]-195 B.E. (E & TC) VOICE NETWORKS (2003 Course) Time : 3 Hours] [Max. Marks : 100 Instructions to the candidates:1) Answers to the two sections should be written in separate books. 2) Neat diagrams must be drawn wherever necessary. 3) Figures to the right indicate full marks. 4) Assume suitable data, if necessary. SECTION - I Q1) a) b) Write a Lex specification to read a C program and calculate number of new line characters, tabs and white spaces in the program. [8] Whether lexical analysis detects any errors? Explain with example.[8] OR Q2) a) b) c) Q3) a) b) Explain with example various compiler construction tools. [9] Why compilation phases are divided into front-end and back-end? what are the advantages? [4] Explain the following : [3] i) token ii) pattern iii) lexeme Show that the following grammar is LR(1) but not LALR(1) S Aa | bAc | Bc | bBa A d B d Explain Recursive-Descent parser with an example. [10] [8] OR P.T.O.

Formatting page ...

Formatting page ...

 

  Print intermediate debugging step

Show debugging info


 


Tags : Pune, Engineering, University of Pune, Engineering question papers, Pune University, previous year question papers, question papers, india, model question paper, pune university paper pattern, pune university syllabus, old question papers  

© 2010 - 2024 ResPaper. Terms of ServiceContact Us Advertise with us

 

pune_eng chat