Zobrazeno 1 - 9
of 9
pro vyhledávání: '"zásobníkový automat"'
Autor:
Genčúrová, Ľubica
This thesis investigates multi pushdown automata and introduces their new modifications based on deep pushdown. The first modification is Input driven multi deep pushdown automata, which has several deep pushdown lists and the current input symbol de
Externí odkaz:
http://www.nusl.cz/ntk/nusl-403109
Autor:
Senko, Jozef
This thesis is a continuation of my bachelor thesis, which is dedicated to syntax analysis based on deep pushdown automata. In theorical part of this thesis is defined everything fundamental for this work, for example deep syntax-directed translation
Externí odkaz:
http://www.nusl.cz/ntk/nusl-234933
Autor:
Viktorin, Jiří
In this thesis, I focus on the application of deep pushdown automatons in compilers, their composition in the parser, and the possibility of further recovery. Thanks to these automatons can carry out the expansion of the nonterminals in various depth
Externí odkaz:
http://www.nusl.cz/ntk/nusl-236718
Autor:
Wolf, Dominik
This work deals with advanced models of context-free grammars and explores the possibilities of adaptation and usefulness for deterministic parsing of non-context-free sructures by deep parsing method. It introduces adapted model of context-free gram
Externí odkaz:
http://www.nusl.cz/ntk/nusl-237068
Autor:
Čermák, Martin
This paper introduces and discusses automata systems as a new way for formal languages processing. In the text there are four models described. The first model works on sequential mode. At one computation step only one of components works. The second
Externí odkaz:
http://www.nusl.cz/ntk/nusl-235872
Autor:
Kyjovská, Linda
This work deals with syntax analysis problems based on multi-generation. The basic idea is to create computer program, which transforms one input string to n -1 output strings. An Input of this program is some plain text file created by user, which c
Externí odkaz:
http://www.nusl.cz/ntk/nusl-235439
Autor:
Pluháček, David
The thesis introduces new models for formal languages, the m-limited state grammar and the deep pushdown automaton. Their basic definitions are presented, so is their mutual equivalence and the characteristics of the language family they describe. Fo
Externí odkaz:
http://www.nusl.cz/ntk/nusl-236851
Autor:
Solár, Peter
This thesis introduces syntax-directed translation based on deep pushdown automata. Necessary theoretical models are introduced in the theoretical part. The most important model, introduced in this thesis, is a deep pushdown transducer. The transduce
Externí odkaz:
http://www.nusl.cz/ntk/nusl-236779
Autor:
Makovský, Benjamin
This work suggests and solves the implementation of the transformation of context-free grammars and the conversions between context-free grammars and pushdown automata. It makes acquainted with the models used in modern theory of formal languages. In
Externí odkaz:
http://www.nusl.cz/ntk/nusl-236774