- Tytuł:
- Parsing based on n-path tree - controlled grammars
- Autorzy:
-
Čermák, M.
Koutný, J.
Meduna, A. - Powiązania:
- https://bibliotekanauki.pl/articles/375747.pdf
- Data publikacji:
- 2011
- Wydawca:
- Polska Akademia Nauk. Czytelnia Czasopism PAN
- Tematy:
-
regulated rewriting
derivation tree
tree-controlled grammars
path-controlled grammars
parsing
n-path tree-controlled grammars - Opis:
- 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 greater-than or equal to 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.
- Źródło:
-
Theoretical and Applied Informatics; 2011, 23, 3-4; 213-228
1896-5334 - Pojawia się w:
- Theoretical and Applied Informatics
- Dostawca treści:
- Biblioteka Nauki
Artykuł