This paper addresses the issue of design and implementation of syntactic analysis based on the context sensitive languages, respectively, grammars that contains constructs, which isn't possible to analyze with the help of the standard parsers based on the context free grammars. More specifically, this paper deals with the possibility of adding context sensitive support to the classic LL-analysis by replacing the standard pushdown automata (PDA) with deep pushdown automata (DP), which were introduced and published by prof. Alexander Meduna
This thesis deals with reducing automata, their normalization, and their application for a (robust) ...
This thesis deals with reducing automata, their normalization, and their application for a (robust) ...
This paper introduces a generalization of classical pushdown automata-deep pushdown automata. Deep p...
This thesis is concerning with syntax analysis based on deep pushdown automata. In theoretical part ...
The thesis introduces new models for formal languages, the m-limited state grammar and the deep pu...
This work deals with advanced models of context-free grammars and explores the possibilities of adap...
This thesis provides a summary of knowledge of grammar systems. It focuses primarily on sequentially...
This thesis provides a summary of knowledge of grammar systems. The thesis proposes modifications of...
This thesis is concerning with parsing using parallel communicating pushdown automata systems. Focus...
This work deals with the design, applicability and the implementation of parsing methods based on pu...
Straightforward algorithm for converting context free grammars into pushdown-store automat
In this paper we approach the following problem: Given an arbitrary language describing device (e.g....
In this thesis, I focus on the application of deep pushdown automatons in compilers, their compositi...
Parsing efficiency is crucial when building practical natural language systems. This paper introduce...
Two measures of nondeterminism are introduced and used for classification of context-free languages ...
This thesis deals with reducing automata, their normalization, and their application for a (robust) ...
This thesis deals with reducing automata, their normalization, and their application for a (robust) ...
This paper introduces a generalization of classical pushdown automata-deep pushdown automata. Deep p...
This thesis is concerning with syntax analysis based on deep pushdown automata. In theoretical part ...
The thesis introduces new models for formal languages, the m-limited state grammar and the deep pu...
This work deals with advanced models of context-free grammars and explores the possibilities of adap...
This thesis provides a summary of knowledge of grammar systems. It focuses primarily on sequentially...
This thesis provides a summary of knowledge of grammar systems. The thesis proposes modifications of...
This thesis is concerning with parsing using parallel communicating pushdown automata systems. Focus...
This work deals with the design, applicability and the implementation of parsing methods based on pu...
Straightforward algorithm for converting context free grammars into pushdown-store automat
In this paper we approach the following problem: Given an arbitrary language describing device (e.g....
In this thesis, I focus on the application of deep pushdown automatons in compilers, their compositi...
Parsing efficiency is crucial when building practical natural language systems. This paper introduce...
Two measures of nondeterminism are introduced and used for classification of context-free languages ...
This thesis deals with reducing automata, their normalization, and their application for a (robust) ...
This thesis deals with reducing automata, their normalization, and their application for a (robust) ...
This paper introduces a generalization of classical pushdown automata-deep pushdown automata. Deep p...