Martin Odersky. Defining context-dependent syntax without using contexts. ACM Transactions on Programming Languages and Systems, 15(3):535--562, July 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of semantic information can be specified, in particular the transformation into the intermediate representation. A notion of consistency and completeness can be defined. A language for the specification of context sensitive syntax which is based solely on the predicate calculus is defined in [7]. Even though this method is completely declarative, it is not intuitive due to the complexity of first order formulas. Realistic programming languages can be specified in this framework as it is demonstrated at the example specification of Oberon. A notion of consistency and completeness is not ....

Martin Odersky. Defining context-dependent syntax without using contexts. ACM Transactions on Programming Languages and Systems, 15(3):535--562, July 1993.

....carried out in the Keldysh Institute for Applied Mathematics from 1983 to 1993. A predicate calculus on nodes of a derivation tree was also used in [11, 12] for specifying static semantics of programming languages. Some of the ideas articulated in the cited works have independently appeared in [14, 15], in the context of static semantics formulation as opposed to entire translations. In the next section the translation formalism is formulated. Section 3 contains some of the enrichments in terms of notation, conventions etc. added to the translation formalism. Section 4 starts out with a brief ....

M. Odersky, Defining Context-Dependent Syntax Without Using Contexts. ASM Trans. on PL and Systems, v.15, no.3, 1993, 535-562.

....intuitive. Moreover, the generation of semantic analysis from such a specification is not always possible, as stated by the author. Therefore this approach is not widely used. A language for the specification of context sensitive syntax which is based solely on the predicate calculus is defined in [8]. Due to the complexity of firstorder formulas, the specifications in this model may not be easy. The semantic analysis can be generated but is much too inefficient for the use in practical compilers. Another framework also based on the predicate calculus is given in [10] incorporating basically ....

Martin Odersky. Defining context-dependent syntax without using contexts. ACM Transactions on Programming Languages and Systems, 15(3):535--562, July 1993.

....else as well. All contextsensitive properties of an AST can be described with a first order formula . To check the context sensitive properties of a program, it is necessary to prove that the program is a model of this formula . Since the program is finite, this question is decidable but [Ode93]. The actual algorithms for the semantic analysis are simple but will fail on certain input programs if the underlying attribute grammar is not well defined. Testing if a grammar is well defined, however, requires exponential time [Jaz81] A sufficient condition for being well defined can be ....

....designer might want it to be. However, because there are no alternative specification and generation methodologies, most practical tools are based on attribute grammars. A language for the specification of context sensitive syntax which is based solely on the predicate calculus is defined in [Ode93]. The semantic analysis can be generated but is much too inefficient for the use in practical compilers. Another framework also based on the predicate calculus is given in [PH91] incorporating basically the same disadvantages. In [PS94] a specification method for context sensitive syntax in ....

Martin Odersky. Defining context-dependent syntax without using contexts. ACM Transactions on Programming Languages and Systems, 15(3):535--562, July 1993.

....We discuss a knowledge retrieval system based on a query algebra that is language parameterized and interprets queries directly. It supports multidirectional traversal of the syntax trees representing the code of legacy systems. Some related work on the topic of knowledge retrieval systems is [Ode93, PP94a, PP94b, REQ94, DRW96]. In [Ode93] a query mechanism is used for a completely different purpose than ours, namely, to define type checkers, the tree traversal 3 UNIX is a registered trademark of UNIX System Laboratories mechanism is, however, similar to ours. In [PP94a, PP94b] it is claimed that the described ....

....based on a query algebra that is language parameterized and interprets queries directly. It supports multidirectional traversal of the syntax trees representing the code of legacy systems. Some related work on the topic of knowledge retrieval systems is [Ode93, PP94a, PP94b, REQ94, DRW96] In [Ode93] a query mechanism is used for a completely different purpose than ours, namely, to define type checkers, the tree traversal 3 UNIX is a registered trademark of UNIX System Laboratories mechanism is, however, similar to ours. In [PP94a, PP94b] it is claimed that the described Source Code ....

M. Odersky. Defining context-dependent syntax without using contexts. ACM Transactions on Programming Languages and Systems, 15(3):535-- 562, 1993.

....everything else as well. All contextsensitive properties of an DT can be described with a first order formula . To check the context sensitive properties of a program, it is necessary to prove that the program is a model of this formula . Since the program is finite, this question is decidable [Ode93]. The actual algorithms for the semantic analysis are simple but will fail on certain input programs if the underlying attribute grammar is not well defined. Testing if a grammar is well defined, however, requires exponential time [Jaz81] A sufficient condition for being well defined can be ....

....designer might want it to be. However, because there are no alternative specification and generation methodologies, most practical tools are based on attribute grammars. A language for the specification of context sensitive syntax which is based solely on the predicate calculus is defined in [Ode93]. The semantic analysis can be generated but is much too inefficient for the use in practical compilers. Another framework also based on the predicate calculus is given in [PH91] incorporating basically the same disadvantages. In [PS94] a specification method for context sensitive syntax in ....

Martin Odersky. Defining context-dependent syntax without using contexts. ACM Transactions on Programming Languages and Systems, 15(3):535--562, July 1993.

....Moreover, the generation of semantic analysis from such a specification is not always possible, as stated by the author. Therefore this approach is not widely used. A language for the specification of context sensitive syntax which is based solely on the predicate calculus is defined in [Ode93]. Due to the complexity of first order formulas, the specifications in this model may not be easy. The semantic analysis can be generated but is much too inefficient for the use in practical compilers. Another framework also based on the predicate calculus is given in [PH91] incorporating ....

....Each negated predicate :P is replaced by P . This preserves the correctness of the decision procedure (formulas recognized as valid are indeed valid) but its completeness does not exist any more. Valid formulas may not be recognized. Furthermore, for some inputs, the computation might not stop [Rob79, Ode93]. For any practical use, such a behavior does not suffice at all. Our approach combines the advantages of both operational and descriptive methods. In a name table, we keep and update all context sensitive information arising from the declarations and use of identifiers when traversing the AST in ....

Martin Odersky. Defining context-dependent syntax without using contexts. ACM Transactions on Programming Languages and Systems, 15(3):535--562, July 1993.

....out in the Keldysh Institute for Applied Mathematics from 1983 to 1993. A predicate calculus on nodes of a derivation tree was also used in [17, 6, 18] for specifying static semantics of programming languages. Some of the ideas articulated in the cited works have later appeared independently in [20, 21], though applied to static semantics only, not to the entire translation. The novelty of the method described in the paper lies in its capability to handle local to global contextual dependencies between the source and the target trees throughout the growth of the target tree. In other words the ....

M. Odersky, Defining Context-Dependent Syntax Without Using Contexts. ASM Trans. on PL and Systems, v.15, no.3, 1993, 535-562.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC