✦ LIBER ✦

An algorithm for generating abstract syntax trees

✍ Scribed by Robert E. Noonan

Book ID: 113230279
Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 624 KB
Volume: 10
Category: Article
ISSN: 0096-0551
DOI: 10.1016/0096-0551(85)90018-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Efficient Algorithm for Generating Pr

An Efficient Algorithm for Generating Prüfer Codes from Labelled Trees

✍ H. -C. Chen; Y. -L. Wang 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 87 KB

An efficient distributed algorithm for g

An efficient distributed algorithm for generating and updating multicast trees

✍ Luca Gatani; Giuseppe Lo Re; Salvatore Gaglio 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 377 KB

An efficient embedding tree matching alg

An efficient embedding tree matching algorithm based on metaphoric dependency syntax tree

✍ Feng, Shao-rong ;Xiao, Wen-jun 📂 Article 📅 2009 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 290 KB

A simple algorithm for generating neuron

A simple algorithm for generating neuronal dendritic trees

✍ Jean M. Pallo 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 237 KB

Generator of efficient strongly typed ab

Generator of efficient strongly typed abstract syntax trees in Java

✍ van den Brand, M.; Moreau, P.-E.; Vinju, J. 📂 Article 📅 2005 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 570 KB

An algorithm for generating dataflow dia

An algorithm for generating dataflow diagrams

✍ Shuichiro Yamamoto; Kenji Ohta 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 877 KB

## Abstract Various methods of generating dataflow diagrams use an algebraic transformation system for a given input‐output relationship. These methods require mutual transformations between the input‐output relationship and algebraic expressions, and also a consistency check between the generated