All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Parsing Based on n-Path Tree-Controlled Grammars

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F12%3APU98151" target="_blank" >RIV/00216305:26230/12:PU98151 - isvavai.cz</a>

  • Result on the web

    <a href="http://versita.metapress.com/content/a837730k72772816/?p=e1e7bf2a6427460494f43ea9e12232c9&pi=4&referencesMode=Show" target="_blank" >http://versita.metapress.com/content/a837730k72772816/?p=e1e7bf2a6427460494f43ea9e12232c9&pi=4&referencesMode=Show</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.2478/v10179-011-0015-7" target="_blank" >10.2478/v10179-011-0015-7</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Parsing Based on n-Path Tree-Controlled Grammars

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2012

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Theoretical and Applied Informatics

  • ISSN

    1896-5334

  • e-ISSN

  • Volume of the periodical

    2011

  • Issue of the periodical within the volume

    23

  • Country of publishing house

    PL - POLAND

  • Number of pages

    16

  • Pages from-to

    213-228

  • UT code for WoS article

  • EID of the result in the Scopus database