Title:

Principles of Compiler Design

Code:ZAP
Ac.Year:ukončen 2004/2005
Term:Summer
Curriculums:
ProgrammeFieldYearDuty
EI-BC-3VTB2nd Stage/2nd YearElective
EI-MSC-3VTN1stCompulsory
EI-MSC-5VTI2nd Stage/1st YearCompulsory
Language of Instruction:Czech, English
Public info:http://www.fit.vutbr.cz/study/courses/ZAP/public/
Credits:6
Completion:examination (written)
Type of
instruction:
Hour/semLecturesSeminar
Exercises
Laboratory
Exercises
Computer
Exercises
Other
Hours:39120014
 ExamsTestsExercisesLaboratoriesOther
Points:55200025
Guarantor:Meduna Alexander, prof. RNDr., CSc. (DIFS)
Lecturer:Kolář Dušan, doc. Dr. Ing. (DIFS)
Meduna Alexander, prof. RNDr., CSc. (DIFS)
Instructor:Bidlo Radek, Ing. (DIFS)
Blatný Petr, Ing. (DIFS)
Kaláb Petr, Ing. (DIFS)
Kolář Dušan, doc. Dr. Ing. (DIFS)
Kopeček Tomáš, Ing. (DIFS)
Křivka Zbyněk, Ing., Ph.D. (DIFS)
Lorenc Luboš, Ing., Ph.D. (DIFS)
Lukáš Roman, Ing., Ph.D. (DIFS)
Meduna Alexander, prof. RNDr., CSc. (DIFS)
Škrkal Oto, Ing. (DIFS)
Vítek Martin, Ing., Ph.D. (DIFS)
Faculty:Faculty of Information Technology BUT
Department:Department of Information Systems FIT BUT
Prerequisites: 
C and C++ Programming Languages (CPP), DITS
Theoretical Computer Science 1 (TI1), DITS
Follow-ups:
Compiler Construction (VPR), FIT
 
Learning objectives:
  Grasp of compiler construction.
Description:
  This course discusses formal languages and their models. Based on these models, it explains the construction of compilers. The lectures are organized as follows: (I) Basic notions: formal languages and their models, grammars, automata; compilers. (II) Regular languages and lexical analysis: regular languages and expressions, finite automata and transducers, lexical analyzer; Lex; symbol table. (III) Context-free languages and syntax analysis: context-free grammars, pushdown automata and transducers, deterministic top-down syntax analysis (recursive descent), the essence of deterministic bottom-up syntax analysis; Yacc. (IV) Semantic analysis and code generation: intermediate code generation, optimization, code generation.
Learning outcomes and competences:
  Ability of a compiler construction.
Syllabus of lectures:
 
  • Introduction.
  • Lexical analysis: theory; regular expressions and finite automata.
  • Lexical analysis: lexical analyzer; Lex; symbol table.
  • Syntax analysis: theory; context-free grammars and pushdown automata.
  • Syntax analysis: principles.
  • Syntax analysis: deterministic syntax analysis, FIRST and FOLLOW, LL and LR grammars.
  • Deterministic top-down syntax analysis: recursive descent.
  • Deterministic bottom-up syntax analysis: simple precedence analysis, LR analysis; Yacc.
  • Semantic analysis and intermediate form generation.
  • Intermediate form generation.
  • Optimazation.
  • Code generation.
  • Conclusion.
Syllabus of laboratory exercises:
 
  • 1 project of an imperative language compiler
Fundamental literature:
 
  • Parsons, T. W.: Introduction to Compiler Construction. Freeman, New York, 1992.
Study literature:
 
  • copy of lectures
  • Meduna, A.: Automata and Languages. London, Springer, 2000.
 

Your IPv4 address: 54.162.159.33
Switch to IPv6 connection

DNSSEC [dnssec]