218 lines
No EOL
9.3 KiB
BibTeX
Executable file
218 lines
No EOL
9.3 KiB
BibTeX
Executable file
|
||
|
||
@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{ECMA262Statement,
|
||
title = {{ECMAScript{\ifmmode\circledR\else\textregistered\fi} 2025 Language Specification}},
|
||
year = {2024},
|
||
month = apr,
|
||
urldate = {2024-05-13},
|
||
note = {[Online; accessed 13. May 2024]},
|
||
url = {https://tc39.es/ecma262/#sec-ecmascript-language-statements-and-declarations}
|
||
}
|
||
|
||
@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}
|
||
} |