A Uniform Resource Identifier (URI) is a compact sequence of characters that identifies an abstract or physical resource. This specification defines the generic URI syntax and a process for resolving URI references that might be in relative form, along with guidelines and security considerations for the use of URIs on the Internet. The URI syntax defines a grammar that is a superset of all vali...

We consider the algebraic specification of abstract syntax in the framework of unified algebras. We illustrate the expressiveness of unified algebraic specifications, and provide a grammar-like notation for specifying abstract syntax, particularly attractive for use in semantic descriptions of full-scale programming languages.

ANTON NIJHOLT Abstract. Attention is paid to structure preserving properties of transformations from a non-leftrecursive context-free grammar to a Greibach normal form grammar. It is demonstrated that such a transformation cannot only be ambiguity preserving, but also both cover and functor relations between grammars or their associated syntax-categories can be obtained from such a transformation.

Modular grammatical formalisms provide an essential step towards improved grammar engineering practices. However, as we depart from traditional deterministic models, some intrinsic static checks are lost. The paper shows why grammar verification is necessary for reliable uses of context-free grammars (CFGs) and parsing expression grammars (PEGs) as modular syntax definitions. Simple conservativ...

This paper describes the open-source Syntax Augmented Machine Translation (SAMT) on Hadoop toolkit—an end-to-end grammar based machine statistical machine translation framework running on the Hadoop implementation of the MapReduce programming model. We present the underlying methodology of the SAMT approach with detailed instructions that describe how to use the toolkit to build grammar based s...

The study examined students’ attitudes toward using the English language as a medium and an official in Nigerian Universities. employed descriptive analysis. Fifty questionnaires were served, 31 was returned, indicating their attitude towards learning Grammar communication medium. findings suggest that most of investigated students have been trained some syntax constructions since childhood wit...

1 Mildly Context-Sensitive Syntax 5 1.1 Tree Adjoining Grammars . . . . . . . . . . . . . . . . . . . . . . . 6 1.1.1 Linguistic Analyses Using TAGs . . . . . . . . . . . . . . . . 8 Lexicalized Grammar . . . . . . . . . . . . . . . . . . . . . . 8 Long-Distance Dependencies . . . . . . . . . . . . . . . . . 9 1.1.2 Background: Context-Free Tree Grammars . . . . . . . . . . 10 IO and OI Derivat...

In the era of IR4.0, Natural Language Processing (NLP) is one major focuses because text stored digitally to code information. language understanding requires a computational grammar for syntax and semantics in question this information be manipulated digitally. Many languages around world have their own grammars processing semantics. However, when it comes Malay language, researchers yet come ...

Deviating from the definition originally presented in [12], Stabler [13] introduced— inspired by some recent proposals in terms of a minimalist approach to transformational syntax—a (revised) type of a minimalist grammar (MG) as well as a certain type of a strict minimalist grammar (SMG). These two types can be shown to determine the same class of derivable string languages.

ECONOMY, THE COPY THEORY, AND ANTECEDENT-CONTAINED DELETION Jason Merchant Northwestern University Chomsky, Noam. 1995. The Minimalist Program. Cambridge, Mass.: MIT Press. Cinque, Guglielmo. 1995. Italian syntax and Universal Grammar. Cambridge: Cambridge University Press. Culicover, Peter. 1976. Syntax. New York: Academic Press. Emonds, Joseph. 1978. The verbal complex Vʹ′-V in French. Lingui...