

@misc{Proposal:DiscardBindings,
  title   = {{proposal-discard-binding}},
  journal = {GitHub},
  year    = {2024},
  month   = apr,
  note    = {[Online; accessed 25. Apr. 2024]},
  url     = {https://github.com/tc39/proposal-discard-binding}
}

@misc{Proposal:DoProposal,
  title   = {{proposal-do-expressions}},
  journal = {GitHub},
  year    = {2024},
  month   = may,
  note    = {[Online; accessed 2. May 2024]},
  url     = {https://github.com/tc39/proposal-do-expressions}
}

@misc{Langium,
  title   = {{Langium}},
  journal = {Langium},
  year    = {2024},
  month   = apr,
  note    = {[Online; accessed 10. May 2024]},
  url     = {https://langium.org}
}

@misc{Babel,
  title = {{Babel {$\cdot$} Babel}},
  year  = {2024},
  month = may,
  note  = {[Online; accessed 10. May 2024]},
  url   = {https://babeljs.io}
}

@misc{BabelTraverse,
  title = {{@babel/traverse {$\cdot$} Babel}},
  year  = {2024},
  month = may,
  note  = {[Online; accessed 12. May 2024]},
  url   = {https://babeljs.io/docs/babel-traverse}
}

@inproceedings{VisitorPattern,
  author    = {Palsberg, J. and Jay, C.B.},
  booktitle = {Proceedings. The Twenty-Second Annual International Computer Software and Applications Conference (Compsac '98) (Cat. No.98CB 36241)},
  title     = {The essence of the Visitor pattern},
  year      = {1998},
  volume    = {},
  number    = {},
  pages     = {9-15},
  keywords  = {Electrical capacitance tomography;Java;Reflection;Computer science;Australia;Ice;Read only memory;Functional programming;Writing},
  doi       = {10.1109/CMPSAC.1998.716629}
}

@misc{BabelGenerate,
  title   = {{@babel/generator {$\cdot$} Babel}},
  year    = {2024},
  month   = may,
  urldate = {2024-05-12},
  note    = {[Online; accessed 12. May 2024]},
  url     = {https://babeljs.io/docs/babel-generator}
}
@incollection{SlidingWindow,
  author    = {Hirzel, Martin and Schneider, Scott and Tangwongsan, Kanat},
  title     = {{Sliding-Window Aggregation Algorithms: Tutorial}},
  booktitle = {{DEBS '17: Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems}},
  pages     = {11--14},
  year      = {2017},
  month     = jun,
  urldate   = {2024-05-13},
  isbn      = {978-1-45035065-5},
  publisher = {Association for Computing Machinery},
  address   = {New York, NY, USA},
  url       = {https://dl.acm.org/doi/abs/10.1145/3093742.3095107},
  doi       = {10.1145/3093742.3095107}
}


@misc{BabelParser,
  title   = {{@babel/parser {$\cdot$} Babel}},
  year    = {2024},
  month   = may,
  urldate = {2024-05-14},
  note    = {[Online; accessed 14. May 2024]},
  url     = {https://babeljs.io/docs/babel-Parser}
}



@inproceedings{AST1,
  author    = {Neamtiu, Iulian and Foster, Jeffrey S. and Hicks, Michael},
  title     = {Understanding source code evolution using abstract syntax tree matching},
  year      = {2005},
  isbn      = {1595931236},
  publisher = {Association for Computing Machinery},
  address   = {New York, NY, USA},
  url       = {https://doi.org/10.1145/1083142.1083143},
  doi       = {10.1145/1083142.1083143},
  abstract  = {Mining software repositories at the source code level can provide a greater understanding of how software evolves. We present a tool for quickly comparing the source code of different versions of a C program. The approach is based on partial abstract syntax tree matching, and can track simple changes to global variables, types and functions. These changes can characterize aspects of software evolution useful for answering higher level questions. In particular, we consider how they could be used to inform the design of a dynamic software updating system. We report results based on measurements of various versions of popular open source programs. including BIND, OpenSSH, Apache, Vsftpd and the Linux kernel.},
  booktitle = {Proceedings of the 2005 International Workshop on Mining Software Repositories},
  pages     = {1–5},
  numpages  = {5},
  keywords  = {abstract syntax trees, software evolution, source code analysis},
  location  = {St. Louis, Missouri},
  series    = {MSR '05}
}

  

@article{AST2,
  author     = {Neamtiu, Iulian and Foster, Jeffrey S. and Hicks, Michael},
  title      = {Understanding source code evolution using abstract syntax tree matching},
  year       = {2005},
  issue_date = {July 2005},
  publisher  = {Association for Computing Machinery},
  address    = {New York, NY, USA},
  volume     = {30},
  number     = {4},
  issn       = {0163-5948},
  url        = {https://doi.org/10.1145/1082983.1083143},
  doi        = {10.1145/1082983.1083143},
  abstract   = {Mining software repositories at the source code level can provide a greater understanding of how software evolves. We present a tool for quickly comparing the source code of different versions of a C program. The approach is based on partial abstract syntax tree matching, and can track simple changes to global variables, types and functions. These changes can characterize aspects of software evolution useful for answering higher level questions. In particular, we consider how they could be used to inform the design of a dynamic software updating system. We report results based on measurements of various versions of popular open source programs. including BIND, OpenSSH, Apache, Vsftpd and the Linux kernel.},
  journal    = {SIGSOFT Softw. Eng. Notes},
  month      = {may},
  pages      = {1–5},
  numpages   = {5},
  keywords   = {abstract syntax trees, software evolution, source code analysis}
}

  

@article{RecursiveDescent,
  author     = {Davis, Matthew S.},
  title      = {An object oriented approach to constructing recursive descent parsers},
  year       = {2000},
  issue_date = {Feb.2000},
  publisher  = {Association for Computing Machinery},
  address    = {New York, NY, USA},
  volume     = {35},
  number     = {2},
  issn       = {0362-1340},
  url        = {https://doi.org/10.1145/345105.345113},
  doi        = {10.1145/345105.345113},
  abstract   = {We discuss a technique to construct a recursive descent parser for a context free language using concepts found in object oriented design and implementation. A motivation for the technique is given. The technique is then introduced with snippets of a Smalltalk implementation. Some advantages and disadvantages of the technique are examined. Finally some areas of possible future work are discussed.},
  journal    = {SIGPLAN Not.},
  month      = {feb},
  pages      = {29–35},
  numpages   = {7},
  keywords   = {Greibach normal form, context free grammar, design patterns, object oriented, recursive descent parser, smalltalk}
}

@misc{SpeedyWebCompiler,
  title   = {{Rust-based platform for the Web {\textendash} SWC}},
  year    = {2024},
  month   = may,
  urldate = {2024-05-21},
  note    = {[Online; accessed 21. May 2024]},
  url     = {https://swc.rs}
}

@misc{Pipeline,
  title   = {{proposal-pipeline-operator}},
  journal = {GitHub},
  year    = {2024},
  month   = may,
  urldate = {2024-05-21},
  note    = {[Online; accessed 21. May 2024]},
  url     = {https://github.com/tc39/proposal-pipeline-operator}
}

@misc{AcornJS,
  title   = {{acorn}},
  journal = {GitHub},
  year    = {2024},
  month   = may,
  urldate = {2024-05-21},
  note    = {[Online; accessed 21. May 2024]},
  url     = {https://github.com/acornjs/acorn}
}

@misc{JQuery,
  author  = {{OpenJS Foundation - openjsf.org}},
  title   = {{jQuery}},
  year    = {2024},
  month   = may,
  urldate = {2024-05-21},
  note    = {[Online; accessed 21. May 2024]},
  url     = {https://jquery.com}
}

@inproceedings{ProgrammingLanguageEcolutionViaSourceCodeQueryLanguages,
  author    = {Urma, Raoul-Gabriel and Mycroft, Alan},
  title     = {Programming language evolution via source code query languages},
  year      = {2012},
  isbn      = {9781450316316},
  publisher = {Association for Computing Machinery},
  address   = {New York, NY, USA},
  url       = {https://doi.org/10.1145/2414721.2414728},
  doi       = {10.1145/2414721.2414728},
  abstract  = {Programming languages evolve just like programs. Language features are added and removed, for example when programs using them are shown to be error-prone. When language features are modified, deprecated, removed or even deemed unsuitable for the project at hand, it is necessary to analyse programs to identify occurrences to refactor.Source code query languages in principle provide a good way to perform this analysis by exploring codebases. Such languages are often used to identify code to refactor, bugs to fix or simply to understand a system better.This paper evaluates seven Java source code query languages: Java Tools Language, Browse-By-Query, SOUL, JQuery, .QL, Jackpot and PMD as to their power at expressing queries required by several use cases (such as code idioms to be refactored).},
  booktitle = {Proceedings of the ACM 4th Annual Workshop on Evaluation and Usability of Programming Languages and Tools},
  pages     = {35–38},
  numpages  = {4},
  keywords  = {program analysis, query languages, source code},
  location  = {Tucson, Arizona, USA},
  series    = {PLATEAU '12}
}
@misc{Jackpot,
  author  = {NetBeans, Apache},
  title   = {{Java Declarative Hints Language}},
  year    = {2024},
  month   = mar,
  urldate = {2024-05-21},
  note    = {[Online; accessed 21. May 2024]},
  url     = {https://netbeans.apache.org/front/main/jackpot/HintsFileFormat/#variables}
}

@misc{ApacheNetBeans,
  author  = {NetBeans, Apache},
  title   = {{Welcome to Apache NetBeans}},
  year    = {2024},
  month   = feb,
  urldate = {2024-05-21},
  note    = {[Online; accessed 21. May 2024]},
  url     = {https://netbeans.apache.org/front/main/index.html}
}

@misc{PMDXPath,
  title   = {{Writing XPath rules {$\vert$} PMD Source Code Analyzer}},
  year    = {2024},
  month   = apr,
  urldate = {2024-05-30},
  note    = {[Online; accessed 30. May 2024]},
  url     = {https://docs.pmd-code.org/latest/pmd_userdocs_extending_writing_xpath_rules.html}
}
@misc{StructuralSearchAndReplaceJetbrains,
  title   = {{Structural search and replace {$\vert$} IntelliJ IDEA}},
  journal = {IntelliJ IDEA Help},
  year    = {2024},
  month   = apr,
  urldate = {2024-05-22},
  note    = {[Online; accessed 22. May 2024]},
  url     = {https://www.jetbrains.com/help/idea/structural-search-and-replace.html}
}

@misc{Atom,
  title   = {{atom}},
  year    = {2024},
  month   = may,
  urldate = {2024-05-23},
  note    = {[Online; accessed 23. May 2024]},
  url     = {https://github.com/atom/atom}
}

@misc{Bootstrap,
  title   = {{bootstrap}},
  journal = {GitHub},
  year    = {2024},
  month   = may,
  urldate = {2024-05-23},
  note    = {[Online; accessed 23. May 2024]},
  url     = {https://github.com/twbs/bootstrap}
}

@misc{React,
  title   = {{react}},
  journal = {GitHub},
  year    = {2024},
  month   = may,
  urldate = {2024-05-23},
  note    = {[Online; accessed 23. May 2024]},
  url     = {https://github.com/facebook/react}
}
@misc{NEXT.JS,
  title   = {{next.js}},
  journal = {GitHub},
  year    = {2024},
  month   = may,
  urldate = {2024-05-23},
  note    = {[Online; accessed 23. May 2024]},
  url     = {https://github.com/vercel/next.js}
}

@misc{ThreeJS,
  title   = {{three.js}},
  journal = {GitHub},
  year    = {2024},
  month   = may,
  urldate = {2024-05-23},
  note    = {[Online; accessed 23. May 2024]},
  url     = {https://github.com/mrdoob/three.js}
}
@misc{PipelineBikeshedding,
  title   = {{Bikeshedding the Hack topic token {$\cdot$} Issue {\#}91 {$\cdot$} tc39/proposal-pipeline-operator}},
  journal = {GitHub},
  year    = {2024},
  month   = may,
  urldate = {2024-05-24},
  note    = {[Online; accessed 24. May 2024]},
  url     = {https://github.com/tc39/proposal-pipeline-operator/issues/91}
}

@misc{FPipeOperator,
  author  = {KathleenDollard},
  title   = {{Symbol and Operator Reference - F{\#}}},
  year    = {2024},
  month   = may,
  urldate = {2024-05-24},
  note    = {[Online; accessed 24. May 2024]},
  url     = {https://learn.microsoft.com/en-us/dotnet/fsharp/language-reference/symbol-and-operator-reference/#type-symbols-and-operators}
}

@misc{JuliaPipe,
  title   = {{Functions {$\cdot$} The Julia Language}},
  year    = {2024},
  month   = may,
  urldate = {2024-05-24},
  note    = {[Online; accessed 24. May 2024]},
  url     = {https://docs.julialang.org/en/v1/manual/functions/#Function-composition-and-piping}
}

@misc{ecma262,
  title   = {{ECMAScript{\ifmmode\circledR\else\textregistered\fi} 2025 Language Specification}},
  year    = {2024},
  month   = may,
  urldate = {2024-05-28},
  note    = {[Online; accessed 28. May 2024]},
  url     = {https://tc39.es/ecma262}
}

@misc{TC39Process,
  title   = {{The TC39 Process}},
  year    = {2024},
  month   = apr,
  urldate = {2024-05-24},
  note    = {[Online; accessed 24. May 2024]},
  url     = {https://tc39.es/process-document}
}


@misc{TC39,
  title   = {{TC39 - Specifying JavaScript.}},
  year    = {2024},
  month   = may,
  urldate = {2024-05-26},
  note    = {[Online; accessed 26. May 2024]},
  url     = {https://tc39.es}
}

@misc{TOML,
  title   = {{TOML: Tom's Obvious Minimal Language}},
  year    = {2024},
  month   = may,
  urldate = {2024-05-27},
  note    = {[Online; accessed 27. May 2024]},
  url     = {https://toml.io/en}
}

@misc{BabelProposalSupport,
  title   = {{proposals}},
  journal = {GitHub},
  year    = {2024},
  month   = may,
  urldate = {2024-05-27},
  note    = {[Online; accessed 27. May 2024]},
  url     = {https://github.com/babel/proposals}
}
@misc{BabelAST,
  title   = {{babel/packages/babel-parser/ast/spec.md at main {$\cdot$} babel/babel}},
  journal = {GitHub},
  year    = {2024},
  month   = may,
  urldate = {2024-05-28},
  note    = {[Online; accessed 28. May 2024]},
  url     = {https://github.com/babel/babel/blob/main/packages/babel-parser/ast/spec.md}
}
@misc{AST3,
  title         = {Abstract Syntax Tree for Programming Language Understanding and Representation: How Far Are We?},
  author        = {Weisong Sun and Chunrong Fang and Yun Miao and Yudu You and Mengzhe Yuan and Yuchen Chen and Quanjun Zhang and An Guo and Xiang Chen and Yang Liu and Zhenyu Chen},
  year          = {2023},
  eprint        = {2312.00413},
  archiveprefix = {arXiv},
  primaryclass  = {cs.SE}
}

@misc{BabelSpecCompliant,
  title   = {{What is Babel? {$\cdot$} Babel}},
  year    = {2024},
  month   = may,
  urldate = {2024-05-29},
  note    = {[Online; accessed 29. May 2024]},
  url     = {https://babeljs.io/docs/#spec-compliant}
}

@misc{TC39RecommendBabel,
  title   = {{how-we-work/implement.md at main {$\cdot$} tc39/how-we-work}},
  year    = {2024},
  month   = may,
  urldate = {2024-05-29},
  note    = {[Online; accessed 29. May 2024]},
  url     = {https://github.com/tc39/how-we-work/blob/main/implement.md#transpiler-implementations}
}


@article{ExpressionOriented,
  author    = {Bantchev, Boyko B.},
  title     = {{Putting more meaning in expressions}},
  journal   = {SIGPLAN Not.},
  volume    = {33},
  number    = {9},
  pages     = {77--83},
  year      = {1998},
  month     = sep,
  urldate   = {2024-05-24},
  issn      = {0362-1340},
  publisher = {Association for Computing Machinery},
  url       = {https://dl.acm.org/doi/10.1145/290229.290237},
  doi       = {10.1145/290229.290237}
}

@misc{Xtext,
  author  = {Efftinge, Sven and Spoenemann, Miro},
  title   = {{Xtext - Language Engineering Made Easy!}},
  year    = {2024},
  month   = feb,
  urldate = {2024-05-29},
  note    = {[Online; accessed 29. May 2024]},
  url     = {https://eclipse.dev/Xtext}
}
@article{LanguageWorkbench,
  title     = {Evaluating and comparing language workbenches: Existing results and benchmarks for the future},
  author    = {Erdweg, Sebastian and Van Der Storm, Tijs and V{\"o}lter, Markus and Tratt, Laurence and Bosman, Remi and Cook, William R and Gerritsen, Albert and Hulshout, Angelo and Kelly, Steven and Loh, Alex and others},
  journal   = {Computer Languages, Systems \& Structures},
  volume    = {44},
  pages     = {24--47},
  year      = {2015},
  publisher = {Elsevier}
}
@article{DSLSANDHOW,
  author     = {Mernik, Marjan and Heering, Jan and Sloane, Anthony M.},
  title      = {When and how to develop domain-specific languages},
  year       = {2005},
  issue_date = {December 2005},
  publisher  = {Association for Computing Machinery},
  address    = {New York, NY, USA},
  volume     = {37},
  number     = {4},
  issn       = {0360-0300},
  url        = {https://doi.org/10.1145/1118890.1118892},
  doi        = {10.1145/1118890.1118892},
  abstract   = {Domain-specific languages (DSLs) are languages tailored to a specific application domain. They offer substantial gains in expressiveness and ease of use compared with general-purpose programming languages in their domain of application. DSL development is hard, requiring both domain knowledge and language development expertise. Few people have both. Not surprisingly, the decision to develop a DSL is often postponed indefinitely, if considered at all, and most DSLs never get beyond the application library stage.Although many articles have been written on the development of particular DSLs, there is very limited literature on DSL development methodologies and many questions remain regarding when and how to develop a DSL. To aid the DSL developer, we identify patterns in the decision, analysis, design, and implementation phases of DSL development. Our patterns improve and extend earlier work on DSL design patterns. We also discuss domain analysis tools and language development systems that may help to speed up DSL development. Finally, we present a number of open problems.},
  journal    = {ACM Comput. Surv.},
  month      = {dec},
  pages      = {316–344},
  numpages   = {29},
  keywords   = {Domain-specific language, application language, domain analysis, language development system}
}

@misc{CodeQL,
  title   = {{CodeQL}},
  year    = {2024},
  month   = may,
  urldate = {2024-05-29},
  note    = {[Online; accessed 29. May 2024]},
  url     = {https://codeql.github.com}
}

@misc{Coccinelle,
  title   = {{Coccinelle The Linux Kernel documentation}},
  year    = {2024},
  month   = may,
  urldate = {2024-05-29},
  note    = {[Online; accessed 29. May 2024]},
  url     = {https://docs.kernel.org/dev-tools/coccinelle.html}
}
@inproceedings{CodeQLStuff,
  author    = {Moor, Oege de and Verbaere, Mathieu and Hajiyev, Elnar and Avgustinov, Pavel and Ekman, Torbjorn and Ongkingco, Neil and Sereni, Damien and Tibble, Julian},
  booktitle = {Seventh IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM 2007)},
  title     = {Keynote Address: .QL for Source Code Analysis},
  year      = {2007},
  volume    = {},
  number    = {},
  pages     = {3-16},
  keywords  = {},
  doi       = {10.1109/SCAM.2007.31}
}
@misc{BabelAcornBased,
  title   = {{@babel/parser {$\cdot$} Babel}},
  year    = {2024},
  month   = may,
  urldate = {2024-05-30},
  note    = {[Online; accessed 30. May 2024]},
  url     = {https://babeljs.io/docs/babel-parser#credits}
}


@inbook{ModelToModelTransformations,
  author    = {Wąsowski , Andrzej and Berger, Thorsten},
  title     = {Model and Program Transformation},
  btitle    = {Domain-Specific Languages: Effective Modeling, Automation, and Reuse},
  year      = {2023},
  publisher = {Springer International Publishing},
  address   = {Cham},
  pages     = {233--292},
  abstract  = {So far, we focused on defining the syntax of DSLs in efficient ways. We worked with abstract and concrete syntax. We have seen tools that can transform syntax definitions (meta-models and grammars in our case) not only into model editors, but into a whole infrastructure for processing models that adhere to the syntax definition.},
  isbn      = {978-3-031-23669-3},
  doi       = {10.1007/978-3-031-23669-3_7},
  url       = {https://doi.org/10.1007/978-3-031-23669-3_7}
}

@misc{XSLT,
  title   = {{XSL Transformations (XSLT) Version 2.0 (Second Edition)}},
  year    = {2021},
  month   = mar,
  urldate = {2024-05-30},
  note    = {[Online; accessed 30. May 2024]},
  url     = {https://www.w3.org/TR/xslt20}
}