The paper argues that grammar correction in L2 writing classes should be abandoned, for the following reasons: (a) Substantial research shows it to be ineffective and none shows it to be helpful in any interesting sense; (b) for both theoretical and practical reasons, one can expect it to be ineffective; and (c) it has harmful effects. I also consider and reject a number of arguments previously...

Although existing LR(1) or U ( 1 ) parser generators suffice for many language recognition problems, writing a straightforward grammar to translate a complicated language, such as C++ or even C, remains a non-trivial task. We have often found that adding translation actions to the grammar is harder than writing the grammar itself. Part of the problem is that many languages are context-sensitive...

The structure of a choice-driven interactive story can be modeled as a syntax tree, generated by a player from a grammar, which in turn was generated by a game author. Using this grammar metaphor, “Boswell”, a web-based Integrated Development Environment, was developed for writing, testing, playing and sharing choice-based interactive fiction scripts. The system includes a domain-specific langu...

In this paper we present the Semantic Tree Unification Grammar (STUG) which is a new formalism for parsing spoken language. The main motivation of this formalism is the combination of the robustness and simplicity of the classical semantic grammar to the deepness of the traditional syntactic formalisms. The key properties of STUG are: the direct linearization of the semantic structure, an econo...

GF is a grammar formalism that has a powerful type system and module system, permitting a high level of abstraction and division of labour in grammar writing. GF is suited both for expert linguists, who appreciate its capacity of generalizations and conciseness, and for beginners, who benefit from its static type checker and, in particular, the GF Resource Grammar Library, which currently cover...