In the paper some possibilities of the employment of Prolog for a syntax analysis of context-free languages are shown with respect to syntactic pattern recognition applications. The new syntax-analyzer based on "top-down" strategy is proposed. All terminal symbols contained on a right side of a production of a context-free grammar are used for the decision whether or not the production shall be...

In [1,6,7] elementary proofs are given of Greibach Normal Form of context-free grammars [4]. Here we do the same for Double Greibach Normal Form, where it is required that each right-hand side of a production both starts and ends with a terminal symbol [5]. In [5], first a grammar in Greibach Normal Form is constructed, which is then transformed into Double Greibach Normal Form; both transforma...

A regular right part grammar (RRPG) is a context-free grammar, in which right parts of productions are finite automata to extend the descriptive power of context-free grammar by including notations for describing repetitions and alternations [6,8]. On LR parsing of RRPGs, extra work is required to identify the left end of a handle at reduction time because a nonterminal can derive potentially i...

The paper focuses on the area of context modeling with respect to the specification of context-aware systems supporting ubiquitous applications. The proposed approach, followed within the SIMPLICITY IST project, uses a high-level system ontology to derive context models for system components which consequently are mapped to the system’s physical entities. For the definition of user and device-r...

This paper addresses the data-ow analysis of access to arrays in recursive imperative programs. When no assumption is made on recursion predicates, only approximate (\fuzzy") ow information can be hoped for in the general case. However, we introduce a new data-ow framework, based on push-down automata and, equivalently, on context-free grammars, and show that this framework allows to describe t...

Parallel Multiple Context-Free Grammar (PMCFG) is an extension of context-free grammar for which the recognition problem is still solvable in polynomial time. We describe a new parsing algorithm that has the advantage to be incremental and to support PMCFG directly rather than the weaker MCFG formalism. The algorithm is also top-down which allows it to be used for grammar based word prediction.

Parsing schemata are deened as an intermediate level of abstraction between context-free grammars and parsers. Clear, concise speciications of radically diierent parsing algorithms can be expressed as parsing schemata. Moreover, because of the uniformity of these speci-cations, relations between diierent parsing algorithms can be formally established. The framework is introced in an informal ma...

Context-Free Grammars (CFGs) and Parsing Expression Grammars (PEGs) have several similarities and a few differences in both their syntax and semantics, but they are usually presented through formalisms that hinder a proper comparison. In this paper we present a new formalism for CFGs that highlights the similarities and differences between them. The new formalism borrows from PEGs the use of pa...

The change within the linguistic framework of transformational grammar from GB–theory to minimalism brought up a particular type of formal grammar, as well. We show that this type of a minimalist grammar (MG) constitutes a subclass of mildly context–sensitive grammars in the sense that for each MG there is a weakly equivalent linear context–free rewriting system (LCFRS). Moreover, an infinite h...