Result Details
Parsing Based on n-Path Tree-Controlled Grammars
Koutný Jiří, Ing., Ph.D., DIFS (FIT)
Meduna Alexandr, prof. RNDr., CSc., DIFS (FIT)
This paper discusses recently introduced kind of linguistically motivated restriction placed on tree-controlled grammars-context-free grammars with some root-to-leaf paths in their derivation trees restricted by a control language. We deal with restrictions placed on n >= 1 paths controlled by a deterministic context-free language, and we recall several basic properties of such a rewriting system. Then, we study the possibilities of corresponding parsing methods working in polynomial time and demonstrate that some non-context-free languages can be generated by this regulated rewriting model. Furthermore, we illustrate the syntax analysis of LL grammars with controlled paths. Finally, we briefly discuss how to base parsing methods on bottom-up syntax-analysis.
regulated rewriting, derivation tree, tree-controlled grammars, path-controlled grammars, parsing, n-path tree-controlled grammars
@article{BUT91443,
author="Martin {Čermák} and Jiří {Koutný} and Alexandr {Meduna}",
title="Parsing Based on n-Path Tree-Controlled Grammars",
journal="Theoretical and Applied Informatics",
year="2011",
volume="23",
number="3",
pages="213--228",
doi="10.2478/v10179-011-0015-7",
issn="1896-5334",
url="https://journals.pan.pl/tai/133102"
}
Context-free languages and pushdown automata, MŠMT, KONTAKT, MEB041003, start: 2010-01-01, end: 2011-12-31, completed
Mathematical and Engineering Approaches to Developing Reliable and Secure Concurrent and Distributed Computer Systems, GACR, Doktorské granty, GD102/09/H042, start: 2009-01-30, end: 2012-12-31, completed
Security-Oriented Research in Information Technology, MŠMT, Institucionální prostředky SR ČR (např. VZ, VC), MSM0021630528, start: 2007-01-01, end: 2013-12-31, running