|
|
Parallel Versions of General Parsing
Mikita, Tibor ; Kučera, Jiří (referee) ; Meduna, Alexandr (advisor)
This thesis deals with general parsing methods. The author studies the Cocke-Younger-Kasami algorithm and comes up with a design of a parallel version. The motivation of~the author is the acceleration of parsing based on this algorithm. The result is a console application that can determine whether an input string belongs to a language generated by the input grammar or not on the basis of the designed parallel algorithm. For the programming language, C++ was chosen. To achieve parallelism the work of the algorithm was divided among several threads.
|
|
|
Parallel Multigenerative Cocke-Younger-Kasami-Based Parsing
Sopuch, Zbyněk ; Burgetová, Ivana (referee) ; Meduna, Alexandr (advisor)
We deal with text processing, pattern matching and syntax analysis every day, and new areas emerging. We can consider programming languages, communication protocols or a simple text as well-know examples. Therefore, we need new effective methods which fit into these areas. In this work, we explore the topics of parallel grammars, E0L-systems and multigenerative grammar systems. The goal is to improve the Cocke-Younger-Kasami algorithm and present a stronger algorithm of analysis.
|
|
|
Parallel Versions of General Parsing
Mikita, Tibor ; Kučera, Jiří (referee) ; Meduna, Alexandr (advisor)
This thesis deals with general parsing methods. The author studies the Cocke-Younger-Kasami algorithm and comes up with a design of a parallel version. The motivation of~the author is the acceleration of parsing based on this algorithm. The result is a console application that can determine whether an input string belongs to a language generated by the input grammar or not on the basis of the designed parallel algorithm. For the programming language, C++ was chosen. To achieve parallelism the work of the algorithm was divided among several threads.
|
|
|
Parallel Multigenerative Cocke-Younger-Kasami-Based Parsing
Sopuch, Zbyněk ; Burgetová, Ivana (referee) ; Meduna, Alexandr (advisor)
We deal with text processing, pattern matching and syntax analysis every day, and new areas emerging. We can consider programming languages, communication protocols or a simple text as well-know examples. Therefore, we need new effective methods which fit into these areas. In this work, we explore the topics of parallel grammars, E0L-systems and multigenerative grammar systems. The goal is to improve the Cocke-Younger-Kasami algorithm and present a stronger algorithm of analysis.
|
guest ::
