AbstractGeneralized parsing technology provides the power and flexibility to attack real-world parsing applications. However, many programming languages have syntactical ambiguities that can only be solved using semantical analysis. In this paper we propose to apply the paradigm of term rewriting to filter ambiguities based on semantical information. We start with the definition of a representation of ambiguous derivations. Then we extend term rewriting with means to handle such derivations. Finally, we apply these tools to some real world examples, namely C and COBOL. The resulting architecture is simple and efficient as compared to semantic directed parsing
International audienceWe present a formalism called Addressed Term Rewriting Systems, which can be u...
The use of unconstrained context-free grammars for generalized parsing techniques has several advant...
AbstractAutomatically generated lexers and parsers for programming languages have a long history. Al...
AbstractGeneralized parsing technology provides the power and flexibility to attack real-world parsi...
Contrarily to most conventional programming languages where certain symbols are used so as to create...
AbstractContext-sensitive languages such as or can be parsed using a context-free but ambiguous gram...
First Online: 29 September 2020To infer an abstract model from source code is one of the main tasks ...
textabstractContext-free grammars are the most suitable and most widely used method for describing t...
International audienceWe examine various issues faced during the elaboration of lexical disambiguato...
International audienceWe present a formalism called Addressed Term Rewriting Systems, which can be u...
AbstractAlthough programs convey an unambiguous meaning, the grammars used in practice to describe t...
This thesis explores shared data in list structures and ambiguity in language processing. Tolerance ...
AbstractThis paper describes our approach in parsing a K definition. The difficulty of the problem i...
AbstractWe present a formalism called Addressed Term Rewriting Systems, which can be used to define ...
Static ambiguity detection would be an important aspect of language \nworkbenches for textual softwa...
International audienceWe present a formalism called Addressed Term Rewriting Systems, which can be u...
The use of unconstrained context-free grammars for generalized parsing techniques has several advant...
AbstractAutomatically generated lexers and parsers for programming languages have a long history. Al...
AbstractGeneralized parsing technology provides the power and flexibility to attack real-world parsi...
Contrarily to most conventional programming languages where certain symbols are used so as to create...
AbstractContext-sensitive languages such as or can be parsed using a context-free but ambiguous gram...
First Online: 29 September 2020To infer an abstract model from source code is one of the main tasks ...
textabstractContext-free grammars are the most suitable and most widely used method for describing t...
International audienceWe examine various issues faced during the elaboration of lexical disambiguato...
International audienceWe present a formalism called Addressed Term Rewriting Systems, which can be u...
AbstractAlthough programs convey an unambiguous meaning, the grammars used in practice to describe t...
This thesis explores shared data in list structures and ambiguity in language processing. Tolerance ...
AbstractThis paper describes our approach in parsing a K definition. The difficulty of the problem i...
AbstractWe present a formalism called Addressed Term Rewriting Systems, which can be used to define ...
Static ambiguity detection would be an important aspect of language \nworkbenches for textual softwa...
International audienceWe present a formalism called Addressed Term Rewriting Systems, which can be u...
The use of unconstrained context-free grammars for generalized parsing techniques has several advant...
AbstractAutomatically generated lexers and parsers for programming languages have a long history. Al...