LANGUAGE THEORY with APPLICATIONS 2022 (LTA 2022)

LTA 2022 is 12th student conference at the Faculty of Information Technology, Brno University of Technology.

Information

Language Theory with Applications 2022 (Logo)

Organizers:
1. the TID, RGD and VYPa teaching teams;
2. Formal Model Research Group, FIT BUT;
3. Department of Information Systems, FIT BUT.

Coverage:
- LTA 2022 offers a variety of scientific talks on formal language theory and its computer-related applications at MSc and PhD levels. A special attention is paid to modern applications related to the language translation. Most of the talks results from the students' work in the TID, RGD and VYPa classes taught at FIT BUT.

Style:
- Talks are presented so they clearly and quickly explain their significance to today's computer science. As a result, in some instances, results and their proofs may be merely outlined in an informal way. LTA does not tolerate presentations that hide their shallow contents behind exotic pictures.

Purpose: The purpose of this event is three-fold:
1. demonstrating the TID, RGD, and VYPa student work in public;
2. giving students the opportunity of presenting scientific talks in English;
3. improving communication between students and teachers interested in the subject of the conference.

Audience: Everybody is welcome to attend this event without any prior notice. There is no payment.

Speaker: dr. Radim Kocman, FIT VUT, Brno
Abstract: LL parsing is usually one of the first techniques of syntactic analysis introduced during the basic study of compilers and formal languages. However, advanced courses often switch their attention solely to LR parsing and its variants, such as LALR and SLR parsing. The focus of this presentation is on advanced LL parsing techniques that push further the initial LL idea. These advanced techniques introduce some new beneficial properties for syntactic analysis and increase the power of the resulting parser to handle more complex constructions of programming languages. We will talk about full LL(1) parsing, general LL(k) parsing, and modified LL(k) parsing for an automaton with a one-symbol reading head.
Date: Monday, December 5, 2022, 12:30 - 13:20
Chair: Zbyněk Křivka
Room: A112
Slides: PDF version.

The list of talks from VYPa course follows.

Early talks, December 5, 12:00-12:20
- David Chocholatý, František Nečas: Static Analysis in Compilers (Abstract)

Regular talks, December 12, 11:00-12:15:
- Martin Havel, Filip Macák: Tree-Restricted General Grammars and Their Context-freenesss (Abstract)
- Michal Rezáč, Michael Roth: Fuzzy Automata (Abstract)
- David Holas, Tomáš Kocourek: Commutative and Permutation Grammars (Abstract)
- Pavel Bednář, Samuel Gajdoš: Applications of Jumping Models (Abstract)
- José Miguel Panadero Pérez, Alejandro Panizo Jerez: Yona Programming Language (Abstract)
Regular talks, December 12, 12:15-13:50:
- Jakub Kocalka: Selective increase in LL lookahead as an alternative to factorization (Abstract)
- Alexander Polok, Michal Rozsíval: Practical Optimizations in Compilers (Abstract)
- Vojtěch Hranička, Ján Kačur: Static libraries (Abstract)
- Ondřej Krejčí, Oliver Kuník: Copy-and-Patch Compilation (Abstract)
- Adam Sedmík, Lukáš Wagner: Decompilation: Structure, Methods, Tools (Abstract)
- Adam Múdry, Daniel Paul: Garbage Collection (Abstract)

The list of talks from TID course follows.

Classroom: E105
Chair: Alexander Meduna
Talk duration: 40 minutes for the presentation, 5 minutes for the discussion
Level: PhD

Regular talks, 11:00-13:15:
- Enock Anderson: A formal description of a leader election algorithm using communicating finite-state machines (Abstract)
- Tomáš Kožár: Final sentential forms (Abstract)
- Ivana Stančíková: Zero-knowledge proofs in self-tallying voting protocols (Abstract)