Thesis Details
Paralelní syntaktická analýza
The goal of this bachelor thesis is to create and implement a parallel version of a Cocke-Younger-Kasami algorithm, which is used for syntactic analysis. This algorithm works with context-free grammars, so a big part of this work is dedicated to context-free grammars and their transformation to the Chomsky normal form. Output of this thesis is console application in C++ which use threads for parallel processing. There is also an extension for finding all rule successions for given input string designed and implemented. In the end there is a discussion about program's advantages and disadvantages.
syntax analysis, compiler, Cocke-Younger-Kasami, parallel CYK algorithm, Chomsky normal form, CNF, context-free grammar, rule succession, C++
Bařina David, Ing., Ph.D. (DCGM FIT BUT), člen
Hrubý Martin, Ing., Ph.D. (DITS FIT BUT), člen
Kořenek Jan, doc. Ing., Ph.D. (DCSY FIT BUT), člen
Zendulka Jaroslav, doc. Ing., CSc. (DIFS FIT BUT), člen
@bachelorsthesis{FITBT21000, author = "Maro\v{s} Holko", type = "Bachelor's thesis", title = "Paraleln\'{i} syntaktick\'{a} anal\'{y}za", school = "Brno University of Technology, Faculty of Information Technology", year = 2019, location = "Brno, CZ", language = "czech", url = "https://www.fit.vut.cz/study/thesis/21000/" }