Cardelli, L., Matthes, F., Abadi, M.: Extensible grammars for language specialization. In: Proc. Fourth International Workshop on Database Programming Languages - Object Models and Languages. (1993) 11--31  Home/Search   Document Not in Database   Summary   Related Articles   Check

....On the other hand, some systems are notably more mature and robust, and have been used in commercial applications. Many features deserve credit, such as ASF SDF s list matching. A short survey of programming language tools and semantic specification can be found in [15] Extensible grammars [11] form an essential component of the above systems. Phobos uses the model developed by Cardelli, Matthes, and Abadi, although at the moment our system only allows grammar addition and extension, but not update. Furthermore, we allow the generation of illegal abstract syntax, which can be caught ....

L. Cardelli, F. Matthes, and M. Abadi. Extensible Grammars for Language Specialization. In Proceedings of the Fourth International Workshop on Database Programming Languages, August 1993.

....On the other hand, some systems are notably more mature and robust, and have been used in commercial applications. Many features deserve credit, such as ASF SDF s list matching. A short survey of programming language tools and semantic specification can be found in [13] Extensible grammars [10] form an essential component of the above systems. Phobos uses the model developed by Cardelli, Matthes, and Abadi, although at the moment our system only allows grammar addition and extension, but not update. Furthermore, we allow the generation of illegal abstract syntax, which can be caught ....

L. Cardelli, F. Matthes, and M. Abadi. Extensible Grammars for Language Specialization. In Proceedings of the Fourth International Workshop on Database Programming Languages, August 1993.

....of macros, for example) and giving us a clear interpretation of such patterns into plain lambda calculus expressions. In our present work we opted for conceptual clarity rather than generality, and used only one binding pattern ( x:y) in our formal development. Cardelli, Matthes, and Abadi [5] give one of the most expressive systems for syntactically extensible programming languages. Their system allows the modi cation, extension, and restriction of an existing grammar, all within a framework that respects binding structure. Not only that, but their system also pays careful attention ....

Cardelli, L., Matthes, F., and Abadi, M. Extensible grammars for language specialization. In Database Programming Languages (DBPL-4) (Feb. 1994), C. Beeri, A. Ohori, and D. E. Shasha, Eds., Workshops in Computing, Springer-Verlag.

....(1966) proposed the use of syntax macros which could map a given syntax on to either a statement or an expression. These macros always had a macro name as the first item in the syntactic pattern, thus severely restricting the expressive power. More recently, a mechanism has been suggested (Cardelli et al. 1993) whereby layers of syntactic extensions and restrictions can be built above a basis l calculus language to define LL(1) database languages. All of the these attempts to define an extensible language face two main problems. One problem is in defining a mechanism which is easy to use and manage. ....

Cardelli, L., Matthes, F. and Abadi, M. (1993) "Extensible Grammars for Language Specialization. in Database Programming Languages", Database Programming Languages Workshop, New York City: Springer-Verlag.

....and Oresjo 1991) but without the specific inclusion of yet another language within the data sheet specification language, this is also unreasonable. The same argument can be made for an assembly language. 4. A proposal Cardelli, et al. Cardelli, Matthes, and Abadi 1994) earlier version is in (Cardelli, Matthes, and Abadi 1993)) acknowledge the difficulty of interfacing different languages to a common data base format. Their proposal is illustrated below: ################# ################# ################# ################# # # # # # # # ################# ################# Syntax for L1 Extensible parser Parser ....

L. Cardelli, F. Matthes, and M. Abadi, Extensible Grammars for Language Specialization, in Database Programming Languages (DBPL-4), C. Beeri, A. Ohori, and D. E. Shasha (ed.), Sep. 1993, 11-31.

No context found.

L. Cardelli, F. Matthes, and M. Abadi. Extensible grammars for language specialization. In C. Beeri, A. Ohori, and D.E. Shasha, editors, Proceedings of the Fourth International Workshop on Database Programming Languages, Manhatten, New York, Workshops in Computing, pages 11--31. SpringerVerlag, February 1994.

....present at individual network nodes. Following Tycoon s add on approach [MS91] these idioms are not cast into built in syntactic forms, but are expressed by characteristic programming patterns exploiting communication primitives encapsulated by library functions. Using Tycoon s extensible syntax [CMA94] it is possible for library designers to add syntax at a later stage to abstract from stereotypical programming patterns. 2 The Tycoon Language Model The Tycoon language (TL) is an algorithmically complete, strongly typed, higher order polymorphic programming language [MS92] with add on bulk ....

....block and to return the result of the computation as a value from the nested block. let profAddr = begin let csDeptDB = agent.migrate(computingScience) select p. address from csDeptDB.persons where p professor end let adminDB = agent.migrate(administration) Using Tycoon s extensible syntax [CMA94] it is straightforward to provide syntactic sugar for this particular programming idiom to make workflow scripts more readable: Fifth International Workshop on Database Programming Languages, 1995 7 Scaling Database Languages to Higher Order Distributed Programming self 3.14 world Hello foo ....

L. Cardelli, F. Matthes, and M. Abadi. Extensible grammars for language specialization. In C. Beeri, A. Ohori, and D.E. Shasha, editors, Proceedings of the Fourth International Workshop on Database Programming Languages, Manhatten, New York, Workshops in Computing, pages 11--31. SpringerVerlag, February 1994.

....Operations and Typing Following Tycoon s add on approach to data modeling [MS91, MS92] the migrate to construct utilized in figure 3 is not built into the core Tycoon system. Instead of this, migrating threads are provided by a hierarchy of library abstractions and Tycoon s extensible grammar [CMA94] is exploited to provide the necessary syntactic sugar to hide the underlying infrastructure from high level workflow script programmers. Tycoon s core thread functionality is provided by a library module that exports the following exceptions, types and functions: interface Thread export ....

....a thread t running at site Employee, the migration of t is performed as follows. First, t is suspended at site Employee. Then, t is shipped to site Secretary. Finally, t is resumed at site Secretary. The notation migrate to : do is a mere syntactic sugar realized by Tycoon s extensible syntax [CMA94] for Tycoon library calls which perform these elementary thread manipulation and data communication steps. As explained in section 3, the thread t contains a continuation binding to the code still to be executed. This code fragment (let expenseReport = compileReport(data) in turn is represented ....

L. Cardelli, F. Matthes, and M. Abadi. Extensible grammars for language specialization. In C. Beeri, A. Ohori, and D.E. Shasha, editors, Proceedings of the Fourth International Workshop on Database Programming Languages, Manhatten, New York, Workshops in Computing, pages 11--31. Springer-Verlag, February 1994.

....present at individual network nodes. Following Tycoon s add on approach [MS91] these idioms are not cast into built in syntactic forms, but are expressed by characteristic programming patterns exploiting communication primitives encapsulated by library functions. Using Tycoon s extensible syntax [CMA94], it is possible for library designers to add syntax at a later stage to abstract from stereotypical programming patterns. 2 The Tycoon Language Model The Tycoon language (TL) is an algorithmically complete, strongly typed, higher order polymorphic programming language [MS92] with add on bulk ....

....end block and to return the result of the computation as a value from the nested block. let profAddr = begin let csDeptDB = agent.migrate(computingScience) select p. address from csDeptDB.persons where p professor end let adminDB = agent.migrate(administration) Using Tycoon s extensible syntax [CMA94] it is straightforward to provide syntactic sugar for this particular programming idiom to make workflow scripts more readable: self 3.14 world Hello foo literals code string more objects self foo string 3.14 world literals Hello code more objects self foo string 3.14 world literals ....

L. Cardelli, F. Matthes, and M. Abadi. Extensible grammars for language specialization. In C. Beeri, A. Ohori, and D.E. Shasha, editors, Proceedings of the Fourth International Workshop on Database Programming Languages, Manhatten, New York, Workshops in Computing, pages 11--31. Springer-Verlag, February 1994.

No context found.

Cardelli, L., Matthes, F., Abadi, M.: Extensible grammars for language specialization. In: Proc. Fourth International Workshop on Database Programming Languages - Object Models and Languages. (1993) 11--31

No context found.

Luca Cardelli, Florian Matthes, and Martn Abadi. Extensible grammars for language specialization. In Proceedings of the Fourth International Workshop on Database Programming Languages, August 1993.

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