×

Constructing format-preserving printing from syntax-directed definitions. (English) Zbl 1497.94012

MSC:

94A08 Image processing (compression, reconstruction, etc.) in information and communication theory
Full Text: DOI

References:

[1] Wanter, M. L., Preserving the documentary structure of source code in language-based transformation tools, 131-141 (2001)
[2] Erdweg S, Rendel T, Kästner C, et al. Layout-sensitive generalized parsing. Lect Notes Comput Sci, 2013, 7745: 244-263 · doi:10.1007/978-3-642-36089-3_14
[3] Teltelman, W.; Goodwin, J. W.; Bobrow, D. G., Interlisp reference manual (1978)
[4] Sandewall E. Programming in an interactive environment: the “Lisp” experience. ACM Comput Surv, 1978, 10: 35-71 · Zbl 0374.68011 · doi:10.1145/356715.356719
[5] Fritzson, P., Towards a distributed programming environment based on incremental compilation (1984)
[6] Fritzson P. Symbolic debugging through incremental compilation in an integrated environment. J Syst Softw, 1983, 3: 285-294 · doi:10.1016/0164-1212(83)90014-6
[7] Jonge M D, Visser E. An algorithm for layout preservation in refactoring transformations. Lect Notes Comput Sci, 2012, 6940: 40-59 · doi:10.1007/978-3-642-28830-2_3
[8] Brown, C., Tool Support for Refactoring Haskell programs (2008), Canterbury
[9] Kumar, R.; Talton, J. O.; Ahmad, S.; etal., Flexible tree matching, 2674-2679 (2011), Reston
[10] Fischer, S.; Hu, Z. J.; Pacheco, H., “Putback” is the essence of bidirectional programming (2012)
[11] Vaucher J G. Pretty-printing of trees. Softw Pract Exp, 1980, 10: 553-561 · Zbl 0431.68040 · doi:10.1002/spe.4380100706
[12] Merijn, D. J., Pretty-printing for software reengineering, 550-559 (2002)
[13] Neamtiu I, Foster J S, Hicks M. Understanding source code evolution using abstract syntax tree matching. ACM SIGSOFT Softw Eng Notes, 2005, 30: 1-5 · doi:10.1145/1082983.1083143
[14] Foster J N, Greenwald M B, Moore J T, et al. Combinators for bidirectional tree transformations: a linguistic approach to the view-update problem. ACM Trans Program Lang Syst, 2007, 29: 17 · doi:10.1145/1232420.1232424
[15] Aho A V, Lam M S, Sethi R, et al. Compilers: Principles, Techniques, and Tools. 2nd ed. New York: Addison-Wesley, 2006
[16] Donnelly C, Stallman R M. Bison Manual: Using the YACC-compatible Parser Generator. 7th ed. Free Software Foundation, 2002
[17] Visser E. Syntax definition for language prototyping. Dissertation for the Doctoral Degree. Amsterdam: University of Amsterdam, 1997 · Zbl 0900.68290
[18] Vaucher J G, Klint P, Tip F. Origin tracking. J Symb Comput, 1993, 15: 523-545 · Zbl 0804.68088 · doi:10.1016/S0747-7171(06)80004-0
[19] Wang, L. C., Constructing format-preserving printing from syntax-directed definition (2015), Shanghai
[20] Danvy O. Functional unparsing. J Funct Program, 1998, 8: 621-625 · Zbl 0928.68018 · doi:10.1017/S0956796898003104
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.