Title:

Formal Languages and Compilers

Code:IFJ
Ac.Year:2004/2005
Sem:Winter
Curriculums:
ProgrammeField/
Specialization
YearDuty
IT-BC-3BIT2ndCompulsory
Language of Instruction:Czech, English
Public info:http://www.fit.vutbr.cz/study/courses/IFJ/public/
Credits:5
Completion:credit+exam (written)
Type of
instruction:
Hour/semLecturesSeminar
Exercises
Laboratory
Exercises
Computer
Exercises
Other
Hours:3900013
 ExamsTestsExercisesLaboratoriesOther
Points:55200025
Guarantor:Meduna Alexander, prof. RNDr., CSc. (DIFS)
Lecturer: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)
Švec Martin, Ing. (DIFS)
Vítek Martin, Ing., Ph.D. (DIFS)
Faculty:Faculty of Information Technology BUT
Department:Department of Information Systems FIT BUT
Prerequisites: 
Discrete Mathematics (IDA), DMAT
Follow-ups:
Principles of Programming Languages (IPP), DIFS
 
Learning objectives:
  Familiarity with formal languages and their models. 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 competencies:
  Fundamental familiarity with the theory of formal languages. Ability of a compiler construction.
Syllabus of lectures:
 
  • Formal languages: introduction. 
  • Translation of languages and the structure of a compiler.
  • Regular languages and their models: regular expressions and finite automata.
  • Lexical analysis: lexical analyzer; Lex; symbol table.
  • Context-free languages and their models: context-free grammars and pushdown automata.
  • Syntax analysis: deterministic syntax analysis, FIRST and FOLLOW, LL and LR grammars.
  • Deterministic top-down syntax analysis: recursive descent, predictive analysis.
  • Deterministic bottom-up syntax analysis: simple precedence analysis, LR analysis; Yacc.
  • Semantic analysis and intermediate form generation.
  • Optimazation.
  • Code generation.
  • Turing machine. Computability and decidability: basic ideas.
  • Chomsky hierarchy and the corresponding models
  • Remarks and summary. Preliminary discussion of the VYP contents.
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.
Exam prerequisites:
  Obtaining five or more points for the programming part of the project.
 

Your IPv4 address: 34.201.121.213
Switch to https