Zobrazeno 1 - 10
of 568
pro vyhledávání: '"Operator-precedence grammar"'
Publikováno v:
Algorithms, Vol 17, Iss 8, p 345 (2024)
Operator precedence grammars (OPG) are context-free grammars (CFG) that are characterized by the absence of two adjacent non-terminal symbols in the body of each production (right-hand side). Operator precedence languages (OPL) are deterministic and
Externí odkaz:
https://doaj.org/article/c7095fa5c33a400ca29ed15dbe6243ce
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
William B. McGregor
Publikováno v:
McGregor, W B 2017, ' There’s grammar and there’s grammar just as there’s usage and there’s usage ', English Text Construction, vol. 10, no. 2, pp. 199-232 . https://doi.org/10.1075/etc.10.2.02mcg
Usage-based grammars have become increasingly prominent in recent years. In these theories usage is construed quantitatively and serves as a circumstance for the emergence and development of grammar. This paper argues that usage can go deeper than th
Publikováno v:
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS), ACM, 2017, 39 (4), pp.1-36. ⟨10.1145/3064848⟩
ACM Transactions on Programming Languages and Systems (TOPLAS), 2017, 39 (4), pp.1-36. ⟨10.1145/3064848⟩
ACM Transactions on Programming Languages and Systems (TOPLAS), ACM, 2017, 39 (4), pp.1-36. ⟨10.1145/3064848⟩
ACM Transactions on Programming Languages and Systems (TOPLAS), 2017, 39 (4), pp.1-36. ⟨10.1145/3064848⟩
International audience; The syntax of the C programming language is described in the C11 standard by an ambiguous context-free grammar, accompanied with English prose that describes the concept of " scope " and indicates how certain ambiguous code fr
Publikováno v:
International Journal on Natural Language Computing. 6:1-13
Autor:
Diego Vaggione, Mariana V. Badano
Publikováno v:
Theoretical Computer Science. 676:92-96
In this note we present a simple condition upon which a formal grammar produces a context-free language. Fil: Badano, Mariana. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Córdoba. Facultad de Mate
Publikováno v:
Language Resources and Evaluation. 51:159-189
The Grammatical Framework (GF) not only offers state of the art grammar-based machine translation support between an increasing number of languages through its so-called Resource Grammar Library, but is also fast becoming a de facto framework for dev
Publikováno v:
Empirical Software Engineering. 22:928-961
Automated generation of system level tests for grammar based systems requires the generation of complex and highly structured inputs, which must typically satisfy some formal grammar. In our previous work, we showed that genetic programming combined
Autor:
Alessandro Benati
Publikováno v:
The TESOL Encyclopedia of English Language Teaching
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b734ed29f6b0889bdbf9c0a6ff189a5
https://doi.org/10.1002/9781118784235.eelt0153
https://doi.org/10.1002/9781118784235.eelt0153