Detail publikace
Parsing Based on n-Path Tree-Controlled Grammars
ČERMÁK, M. KOUTNÝ, J. MEDUNA, A.
Originální název
Parsing Based on n-Path Tree-Controlled Grammars
Anglický název
Parsing Based on n-Path Tree-Controlled Grammars
Jazyk
en
Originální abstrakt
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.
Anglický abstrakt
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.
Dokumenty
BibTex
@article{BUT91443,
author="Martin {Čermák} and Jiří {Koutný} and Alexandr {Meduna}",
title="Parsing Based on n-Path Tree-Controlled Grammars",
annote="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.",
address="NEUVEDEN",
chapter="91443",
doi="10.2478/v10179-011-0015-7",
edition="NEUVEDEN",
howpublished="print",
institution="NEUVEDEN",
number="23",
volume="2011",
year="2012",
month="january",
pages="213--228",
publisher="NEUVEDEN",
type="journal article - other"
}