International audienceIn this paper we present an approach to specifying opera- tor precedence based on declarative disambiguation constructs and an implementation mechanism based on grammar rewriting. We identify a problem with existing generalized context-free parsing and disambigua- tion technology: generating a correct parser for a language such as OCaml using declarative precedence specification is not possible without resorting to some manual grammar transformation. Our approach provides a fully declarative solution to operator precedence specification for context-free grammars, is independent of any parsing technology, and is safe in that it guarantees that the language of the resulting grammar will be the same as the language of the...
Prolog is a language with a dynamic grammar which is the result of embedded operator declarations. T...
A new class of grammars (precedence-regular grammars) is obtained as a proper extension of the class...
A classic result in formal language theory is the equivalence amongnon-counting, or aperiodic, regul...
International audienceIn this paper we present an approach to specifying opera- tor precedence based...
htmlabstractIn this paper we present an approach to specifying opera- tor precedence based on declar...
In this paper we present an approach to specifying operator precedence based on declarative disambig...
AbstractAlthough precedences are often used to resolve ambiguities in programming language descripti...
Constructing parsers based on declarative specification of operator precedence is a very old researc...
AbstractA wide range of parser generators are used to generate parsers for programming languages. Th...
Context Context-free grammars are widely used for language prototyping and implementation. They allo...
We consider again a user defined syntax feature, the conctype, which is a new datatype construction....
Operator Precedence Languages (OPL) are deterministic context-free and have desirable properties. OP...
This paper presents new results on the algebraic ordering properties of operator precedence grammars...
AbstractFloydʼs operator precedence grammars and languages (FG, FL) are a classical subclass of dete...
Floyd’s operator precedence grammars and languages (FG, FL) are a classical subclass of deterministi...
Prolog is a language with a dynamic grammar which is the result of embedded operator declarations. T...
A new class of grammars (precedence-regular grammars) is obtained as a proper extension of the class...
A classic result in formal language theory is the equivalence amongnon-counting, or aperiodic, regul...
International audienceIn this paper we present an approach to specifying opera- tor precedence based...
htmlabstractIn this paper we present an approach to specifying opera- tor precedence based on declar...
In this paper we present an approach to specifying operator precedence based on declarative disambig...
AbstractAlthough precedences are often used to resolve ambiguities in programming language descripti...
Constructing parsers based on declarative specification of operator precedence is a very old researc...
AbstractA wide range of parser generators are used to generate parsers for programming languages. Th...
Context Context-free grammars are widely used for language prototyping and implementation. They allo...
We consider again a user defined syntax feature, the conctype, which is a new datatype construction....
Operator Precedence Languages (OPL) are deterministic context-free and have desirable properties. OP...
This paper presents new results on the algebraic ordering properties of operator precedence grammars...
AbstractFloydʼs operator precedence grammars and languages (FG, FL) are a classical subclass of dete...
Floyd’s operator precedence grammars and languages (FG, FL) are a classical subclass of deterministi...
Prolog is a language with a dynamic grammar which is the result of embedded operator declarations. T...
A new class of grammars (precedence-regular grammars) is obtained as a proper extension of the class...
A classic result in formal language theory is the equivalence amongnon-counting, or aperiodic, regul...