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

Typ

článek v časopise - ostatní, Jost

Jazyk

angličtina

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.

Klíčová slova

regulated rewriting, derivation tree, tree-controlled grammars, path-controlled grammars, parsing, n-path tree-controlled grammars

Autoři

ČERMÁK, M.; KOUTNÝ, J.; MEDUNA, A.

Rok RIV

2012

Vydáno

31. 12. 2011

ISSN

1896-5334

Periodikum

Theoretical and Applied Informatics

Ročník

23

Číslo

3

Stát

Polská republika

Strany od

213

Strany do

228

Strany počet

16

URL

https://journals.pan.pl/tai/133102

BibTex

@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"
}

Dokumenty

meduna_cermak_koutny_Parsing_Based_on_n-Path_TCG_TAI_2011.pdf