|
|
Systems of Parallel Grammars
Skácel, Jiří ; Horáček, Petr (referee) ; Meduna, Alexandr (advisor)
This article defines cooperating distributed grammar systems with E0L components instead of context-free grammars and discusses its generative power mainly in respect to ET0L systems. It recapitulates results about CD GS, then defines modified systems and shows that this combination has in most derivative modes equal strength to ET0L, except for terminating mode, which is shown to be more powerful. There are also explained examples of this new kind of systems.
|
|
|
Parsing for ET0L Systems
Kožár, Tomáš ; Klobučníková, Dominika (referee) ; Meduna, Alexandr (advisor)
This thesis focuses on deciding the membership of strings in languages generated by ET0L systems. It is achieved by designing two algorithms. The first one is a modification of the existing algorithm Cocke-Younger-Kasami for syntax analysis of context-free grammars in Chomsky normal form. This modification takes into account different properties of ET0L systems compared to context-free grammars. Specifically, the parallel application of production rules and multiple tables of these production rules. Also, used normal form is different from Chomsky normal form since CNF is unfit for ET0L systems. The second designed algorithm works in a top-down manner and gradually generates all valid strings. The resulting algorithms are tested, demonstrated, and fully functional. The contributions of this thesis are two new algorithms for syntax analysis of ET0L systems.
|
|
|
Parsing for ET0L Systems
Kožár, Tomáš ; Klobučníková, Dominika (referee) ; Meduna, Alexandr (advisor)
This thesis focuses on deciding the membership of strings in languages generated by ET0L systems. It is achieved by designing two algorithms. The first one is a modification of the existing algorithm Cocke-Younger-Kasami for syntax analysis of context-free grammars in Chomsky normal form. This modification takes into account different properties of ET0L systems compared to context-free grammars. Specifically, the parallel application of production rules and multiple tables of these production rules. Also, used normal form is different from Chomsky normal form since CNF is unfit for ET0L systems. The second designed algorithm works in a top-down manner and gradually generates all valid strings. The resulting algorithms are tested, demonstrated, and fully functional. The contributions of this thesis are two new algorithms for syntax analysis of ET0L systems.
|
|
|
Systems of Parallel Grammars
Skácel, Jiří ; Horáček, Petr (referee) ; Meduna, Alexandr (advisor)
This article defines cooperating distributed grammar systems with E0L components instead of context-free grammars and discusses its generative power mainly in respect to ET0L systems. It recapitulates results about CD GS, then defines modified systems and shows that this combination has in most derivative modes equal strength to ET0L, except for terminating mode, which is shown to be more powerful. There are also explained examples of this new kind of systems.
|
guest ::
