The context-free grammars of artificial languages
| Autor: | Valeriya Gribova, A. S. Kleschev, D. A. Krylov |
|---|---|
| Rok vydání: | 2013 |
| Předmět: |
business.industry
Computer science Programming language Context-sensitive grammar ComputerApplications_COMPUTERSINOTHERSYSTEMS Context-free grammar computer.software_genre Tree-adjoining grammar TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Extended Affix Grammar Ambiguous grammar Affix grammar Formal language Artificial intelligence L-attributed grammar business General Economics Econometrics and Finance computer Natural language processing |
| Zdroj: | Automatic Documentation and Mathematical Linguistics. 47:59-67 |
| ISSN: | 1934-8371 0005-1055 |
| DOI: | 10.3103/s0005105513020052 |
| Popis: | A mathematical apparatus for describing the context-free grammars of artificial languages is presented: the syntax of the language to describe them is defined, as well as logical and generative semantics, and examples are provided to show how the suggested apparatus can be used. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink