L T P Total                                                                                                       Credits-4

4 0 0 4                                                                        Duration of Exam- Three hours




High level languages, Programming Paradigms, Language implementation. Syntactic structure – Language representation, Abstract syntax tree, Lexical syntax, Context Free grammars (CFG), Normal forms of CFG.


Structured programming, its need and design issues, block structures, types, variables, binding, types of binding, type checking, strong typing, type conversion, named constant, principle data types, character string, user defined data types, pointer and reference.


Fundamentals of subprogram, referencing, environment – local and non local parameter passing, subprogram name as parameter, overloaded subprogram, generic subprograms, co routine, CALL-RETURN structure, recursion, implementing non-local referencing environment, scope-static and dynamic, implementation of scopes.


Introduction, subprogram level concurrency, and synchronization, through semaphores, monitors and message passing, Introduction to Exception handling.


Fundamentals of functional programming, features and implementation, Types – values and operations, product of types, Lists and operations on Lists, Functions from a domain to a range, Function application and lexical scope. Binding of values and functions.


Fundamentals of logical programming, basic elements of Prolog, deficiencies and application of Prolog.



Suggested References


  1. T.W. Pratt, Programming Languages: Design & Implementation, PHI, 3rd Ed.


  1. Ravi Sethi, “Programming Languages – Concepts and Constructs”, Addison Wesley, 1989.




Leave a Reply

Your email address will not be published. Required fields are marked *