Programming Languages (36PJ)
course in Czech language

full-time study course, currently not teaching
Number of teaching periods (lectures + seminars): 3+2
Termination: Credit, examination

  Summary:  

  Foundations of compilers. Methods of designing and implementing of lexical analysers, parsers and syntax directed translators. Semantic analysis and attribute grammars. Programming language structures and their implementation. Foundations of nonprocedural programming languages.

  Course Syllabus:  
 
  • Regular grammars and finite state automata, implementation of FSA
  • Lexical analyzer, design, implementation
  • LL(1) grammars, recursive descent
  • Syntax driven translation, L-attributed grammars
  • Internal form of program, symbol table
  • Procedural programming languages, type checking
  • Structured data types, internal representation
  • Control structures, exception handling
  • Procedures and functions, block structure of programs, memory management
  • Modular structure of programs
  • Features of object oriented programming
  • Functional programming and languages
  • Logic programming and languages
  • Free

  Seminar syllabus:  
 
  • Regular grammars and finite state automata
  • Implementation of finite state automata
  • Implementation of lexical analyzer
  • LL(1) grammars
  • Parser driven by recursive descent
  • L-attributed translation driven by recursive descent
  • Translation into internal form
  • Translation into internal form
  • Internal form interpretation
  • Internal representation of structured data types
  • Memory allocation
  • Exception handling
  • Consultations on semestral projects
  • Free

  Literature:  
  Pratt,T.W., Zelkowitz,M.V.: Programming Languages. Third Edition. Prentice Hall, London, 1999.

Generated: 24.07.2011 13:09