Publication Details

Pushdown Automata: Another Extensions and Transformations

KOLÁŘ Dušan. Pushdown Automata: Another Extensions and Transformations. Brno: Faculty of Information Technology BUT, 2005.
Czech title
Zásobníkové automaty: Další rozšíření a transformace
Type
habilitation
Language
english
Authors
Keywords

pushdown automata, regulated pushdown automata, scattered context grammars, syntax analysis

Abstract

Pushdown automata play a key role in the efficient syntax analysis of context-free languages. The great advantage is also
that the construction of the pushdown automata for the particular language
described by a proper grammar is straightforward. On the other hand, the
efficiency of automata constructed for, for instance, LL(2) languages is not as good as for LL(1) languages. Moreover, we cannot use pushdown automata for analysis of context-sensitive languages and thus their power is far below the one of Turing machine.
This thesis demonstrates a transformation of pushdown automata to achieve efficient behaviour even for LL(k), k>1, languages. After these introductory pages, an extension of pushdown automata, which increases
their power to the one of Turing machine is presented. We
propose an extended pushdown automaton together with an algorithm of its construction, which can be used for the efficient analysis of languages, a power of which is higher than that for context-free languages.

Published
2005
Pages
76
Publisher
Faculty of Information Technology BUT
Place
Brno, CZ
Files
Back to top