Add to ORKGIn 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 depths and thus makes it possible to use other records of expressions
AbstractK-depth grammars extend context-free grammars allowingk⩾1 rewriting points for a single non-...
The original publication is available at http://www.springerlink.com/content/y46h6501746506p0/fullte...
This work deals with the design, applicability and the implementation of parsing methods based on pu...
This thesis is concerning with syntax analysis based on deep pushdown automata. In theoretical part ...
This paper introduces a generalization of classical pushdown automata-deep pushdown automata. Deep p...
The thesis introduces new models for formal languages, the m-limited state grammar and the deep pu...
Pro přirozené číslo n, n-expandovatelné hluboké zasobníkové automaty vždy obsahují maximálně n výsky...
This thesis investigates multi pushdown automata and introduces their new modifications based on d...
This thesis introduce two new modifications of deep pushdown automata - stateless deep pushdown auto...
This paper addresses the issue of design and implementation of syntactic analysis based on the conte...
This thesis introduces several modifications of deep pushdown automata considering the reduced numbe...
V této práci se zaměřím na implementaci hlubokých zásobníkových automatů, které jsou generalizací kl...
Tato práce se zabývá hlubokými zásobníkovými automaty a zavádí jejich modifikaci nazvanou řízený hlu...
This thesis is concerning with parsing using parallel communicating pushdown automata systems. Focus...
This work deals with advanced models of context-free grammars and explores the possibilities of adap...
AbstractK-depth grammars extend context-free grammars allowingk⩾1 rewriting points for a single non-...
The original publication is available at http://www.springerlink.com/content/y46h6501746506p0/fullte...
This work deals with the design, applicability and the implementation of parsing methods based on pu...
This thesis is concerning with syntax analysis based on deep pushdown automata. In theoretical part ...
This paper introduces a generalization of classical pushdown automata-deep pushdown automata. Deep p...
The thesis introduces new models for formal languages, the m-limited state grammar and the deep pu...
Pro přirozené číslo n, n-expandovatelné hluboké zasobníkové automaty vždy obsahují maximálně n výsky...
This thesis investigates multi pushdown automata and introduces their new modifications based on d...
This thesis introduce two new modifications of deep pushdown automata - stateless deep pushdown auto...
This paper addresses the issue of design and implementation of syntactic analysis based on the conte...
This thesis introduces several modifications of deep pushdown automata considering the reduced numbe...
V této práci se zaměřím na implementaci hlubokých zásobníkových automatů, které jsou generalizací kl...
Tato práce se zabývá hlubokými zásobníkovými automaty a zavádí jejich modifikaci nazvanou řízený hlu...
This thesis is concerning with parsing using parallel communicating pushdown automata systems. Focus...
This work deals with advanced models of context-free grammars and explores the possibilities of adap...
AbstractK-depth grammars extend context-free grammars allowingk⩾1 rewriting points for a single non-...
The original publication is available at http://www.springerlink.com/content/y46h6501746506p0/fullte...
This work deals with the design, applicability and the implementation of parsing methods based on pu...