A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Filters
Formal Grammar for Java
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
The purpose of this grammar is to formally specify not only the syntactic structure of Java programs, but also their static semantics. ...
Speci cally, in this chapter we try to formally capture all aspects of the language that would result in compile-time errors. ...
doi:10.1007/3-540-48737-9_1
fatcat:zmjio2esufbwjh4xarcvae5ski
Formal Grammars and Languages
[chapter]
2009
Algorithms and Theory of Computation Handbook, Second Edition, Volume 1
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
of decidability and undecidability, which has a close relation to formal grammars. ...
Formal grammars were introduced as such by [Post, 1943] , and had antecedents in work by Thue and others. ...
ACTION (q, c) can be one of the following: 1. shift, 2. reduce by A → α, where A → α is a production in the grammar, 3. accept, and 4. blank . ...
doi:10.1201/9781584888239-c20
fatcat:k4e5ivi7ujgpbkb47nectsjwxi
Formal and Functional Grammar
1919
English Journal
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
FORMAL AND FUNCTIONAL GRAMMAR
MARGARET McLAUGHLIN Harris Teachers' College, St. ...
We may say that formal grammar and functional grammar differ in a way indicated by these two definitions. ...
doi:10.2307/801037
fatcat:yrql73tpvnc2blcw3355dwitb4
Formal Grammars and Languages
[chapter]
1998
Algorithms and Theory of Computation Handbook
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
of decidability and undecidability, which has a close relation to formal grammars. ...
Formal grammars were introduced as such by [Post, 1943] , and had antecedents in work by Thue and others. ...
ACTION (q, c) can be one of the following: 1. shift, 2. reduce by A → α, where A → α is a production in the grammar, 3. accept, and 4. blank . ...
doi:10.1201/9781420049503-c26
fatcat:x3mj3ftb5rhf3nih23b7dr4l54
Two ways of formalizing grammars
1994
Linguistics and Philosophy
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
TWO WAYS OF FORMALIZING GRAMMARS 223 off' the important properties of the models (see sections 2.8 and 2.10 of Johnson (1988) for further discussion). ...
The well-formed or grammatical structures are those that satisfy the constraints imposed by the grammar. ...
The recognition problem for sample grammar is formalized in this ap proach as follows. ...
doi:10.1007/bf00985036
fatcat:yplkvemksrerzprlsoe2l6fsuq
Formal Game Grammar and Equivalence
2020
2020 IEEE Conference on Games (CoG)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2020 pre-print arXiv:2101.00992v1 fatcat:dyh4zu22lzek3cdwhgdy3tise4
We define a grammar-like formalism to describe finite discrete games without hidden information, allowing for randomness, and mixed sequential and simultaneous play. ...
We develop methods to formally describe and compare games, in order to probe questions of game structure and design, and as a stepping stone to predicting player behavior from design patterns. ...
We want a way to formally, and tractably, describe game rules even for complex games; a grammar-like formalism is better suited to this task. ...
doi:10.1109/cog47356.2020.9231594
dblp:conf/cig/RigginsM20
fatcat:z6immudqmzbqxofx7kronpbuty
Formal Grammars of Early Language
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
We propose to model the development of language by a series of formal grammars, accounting for the linguistic capacity of children at the very early stages of mastering language. ...
We describe a set of grammars which account for this child's utterances between the ages 1;8.02 and 2;0.30. ...
Formal grammars Formal grammars are mathematical systems for describing the structure of languages, both formal and natural. ...
doi:10.1007/978-3-642-01748-3_14
fatcat:27p3wytrhrewlgtmvnyt7qa4wi
wMSO theories as grammar formalisms
2003
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
of building and maintaining such grammars. ...
We explore the use of weak monadic second-order languages over structures of varying dimension as speciÿcation languages for grammars and automata, focusing, in particular, on the extension of the longstanding ...
For the most part, use of model-theoretic tools has focused on providing semantics for grammar formalisms. ...
doi:10.1016/s0304-3975(01)00349-8
fatcat:jvajd6yzlfeqlayb7dgxsgumqq
Should Formal Grammar Be Discarded?
1931
English Journal
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
practical value of formal grammar. ...
FORMAL GRAMMAR I
ROSCOE PULLIAM
SHOULD
For some years formal grammar, along with Latin and some
other less obviously and directly beneficial subjects, has been
i
of scientific data now available upon the ...
doi:10.2307/803553
fatcat:ps72zy2nhzatfmobxsijorhby4
Formalizing paradigms in Construction Grammar
[article]
2022
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Construction Grammar sees the language system as consisting solely of conventionalized pairings of form and meaning, i.e. constructions. ...
Relations between constructions within the grammar can be – and have previously been – described in terms of inheritance (e.g. ...
e.g. with the formalism proposed in Booij (2010) . ...
doi:10.5281/zenodo.5675843
fatcat:ot4jltu7o5bnpponeesbrkvp2u
Harmonic Grammars for Formal Languages
1992
Neural Information Processing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Here it is shown that formal languages too can be specified by Harmonic Grammars, rather than by conventional serial re-write rule systems. ...
Such Harmonic Grammars have been successfully applied to a number of problems in the theory of natural languages. ...
HGs FOR FORMAL LANGUAGES One means for assessing the expressive power of Harmonic Grammar is to apply it to the specification of formal languages. ...
dblp:conf/nips/Smolensky92
fatcat:ml75yniprnf7rbsqkrlzlckehy
Representing Unish Grammars Based on Tree Adjoining Grammar Formalisms
2003
Journal of Universal Language
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Thus the purpose of this paper is to formalize Unish grammar by developing prototype Unish Tree Adjoining Grammars in the hope that developing and formalizing Unish grammars at this stage will help to ...
With that in mind, I tried to develop prototype Unish Grammars based on a formalism called Tree Adjoining Grammars. ...
The Feature-Based Lexicalized Tree Adjoining Grammar formalism (FB-LTAG) is based on the Tree Adjoining Grammar, which has been extended to include lexicalization and unification-based feature structures ...
doi:10.22425/jul.2003.4.1.1
fatcat:x6eyws3bcnhp3p7cdxmawxiczq
Grammar Teaching Revisited: EFL Teachers between Grammar Abstinence and Formal Grammar Teaching
2012
Australian Journal of Teacher Education
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
the way they teach grammar. ...
However, rarely have the studies delved into teachers' knowledge about grammar (reviewed by Borg, 2001) or investigated the relationships between teachers' knowledge about grammar and teachers' actions ...
Formal grammar instruction requires teachers to have had professional training in language teaching. ...
doi:10.14221/ajte.2012v37n2.6
fatcat:zfiry27j4ncv3bg4zylb52wibm
Syntactic language modeling with formal grammars
2012
Speech Communication
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we investigate the use of a formal grammar as a source of syntactic information. ...
We describe a novel approach to integrating formal grammars into speech recognition and evaluate it in a series of experiments. ...
Formal grammars It might be appropriate to first explain which particular kinds of formal grammar we are concerned with. ...
doi:10.1016/j.specom.2012.01.001
fatcat:is4hicwi6nexveiyxhawu2z52y
Using Formal Grammars as Musical Genome
2021
Applied Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Instead, it uses formal grammars as a representation method than can retain just the basic features, common to any form of music (e.g., the appearance of rhythmic patterns, the evolution of tone or dynamics ...
From a bio-inspired perspective this can be thought of as an evolutionary process that operates over a developmental procedure, held by the formal grammar. ...
In Section 2 we present an approach of encoding music by means of L-systems and context-free grammars and then compose music by evolution of these formal models. ...
doi:10.3390/app11094151
doaj:27747a6032b54b56a71743ae26c4b9be
fatcat:nvyemqivsbguhpzgxzqcc46ypu
« Previous
Showing results 1 — 15 out of 216,629 results