Programming Languages and Compilers

Vztahy:

Podmínkou zápisu na předmět BIE-PJP.21 je, že student získal v některém z předchozích semestrů zápočet z předmětu BIE-AAG.21

Předmět je ekvivalentní s BIE-PJP,BI-PJP,BI-PJP.21 .

Garant předmětu:

Jan Janoušek

Přednášející:

Jan Janoušek

Cvičící:

Jan Janoušek, Tomáš Pecka, Štěpán Plachý

Předmět zajišťuje:

katedra teoretické informatiky

Anotace:

Students learn basic compiling methods of programming languages. They are introduced to intermediate representations used in current compilers GNU and LLVM. They learn to create a specification of a translation of a text that conforms a given syntax, to a target code and also to create a compiler based on the specification. The compiler can translate not only a programming language but any text in a language generated by a given LL input grammar.

Požadavky:

Theory of automata and grammars in the scope of BIE-AAG.21, basic knowledge of programming (C and C++).

It is a prerequisite for enrolling in the course BIE-PJP.21 that the student has successfully completed BIE-AAG.21 in a previous semester.

Osnova přednášek:

1. Structure of a compiler, lexical analysis.

2. Deterministic top-down parsing: LL parsing.

3. [2] Implementing LL parsing, properties of LL grammars.

5. Transformations to LL(1) grammars, error recovery during LL parsing.

6. Formalisms for syntax-directed translation and semantics: translation and attributed grammar.

7. One-pass attributed translation directed by LL parsing, L-attributed grammars, examples of simple translations.

8. Data structures of a compiler, intermediate representations.

9. Abstract syntax tree, three address code - intermediate representations of GNU compiler.

10. Intermediate representations of the LLVM compiler.

11. An example of a simple compiler.

12. Local code optimization.

13. Other variants of LL parsing.

Osnova cvičení:

1. Lexer design and implementation.

2. Parser implementation using recursive descent.

3. Attribute translation grammars.

4. Compiling to a language of a stack machine.

5. Compiling to a syntax tree.

6. [2] Project consultations.

Cíle studia:

After completing the course, students will be able to formally specify a translation of a text that has a certain syntax into the target form and write a compiler based on such specification. The notion of compiler in this context is not limited to compilers of programming languages but extends to all other programs for parsing and processing text in a language defined by a LL(1) grammar.

Studijní materiály:

1. Aho A.V., Lam M.S., Sethi R., Ullman J.D. : Compilers: Principles, Techniques, and Tools (2nd Edition). Addison Wesley, 2006. ISBN 978-0321486813.

2. Crespi Reghizzi S., Breveglieri L., Morzenti A. : Formal Languages and Compilation (3rd Edition). Springer, 2019. ISBN 978-3-030-04878-5.

3. Scott M. L. : Programming Language Pragmatics (3rd Edition). Morgan Kaufmann, 2009. ISBN 978-8131222560.

4. Wilhelm R., Seidl H., Hack S. : Compiler Design - Syntactic and Semantic Analysis. Springer, 2013. ISBN 978-3642175398.

5. Fischer C. N., Cytron R. C., LeBlanc R. J. : Crafting A Compiler. Addison-Wesley, 2009. ISBN 978-0136067054.

Poznámka:

https://courses.fit.cvut.cz/BI-PJP/

Další informace:

https://courses.fit.cvut.cz/BI-PJP/

Rozvrh na zimní semestr 2024/2025:

Rozvrh není připraven

Rozvrh na letní semestr 2024/2025:

Rozvrh není připraven

Předmět je součástí následujících studijních plánů:

• Bachelor Specialization, Computer Science, 2021 (PS)
• Bachelor Specialization, Computer Networks and Internet, 2021 (VO)
• Bachelor Specialization, Computer Engineering, Version 2024 (povinně volitelný předmět)