2020-06-07 15:22:51 +01:00
* Parser
2020-06-11 23:46:34 +01:00
First of all you need to read [[https://tomassetti.me/guide-parsing-algorithms-terminology/ ][All you need to know about Parser algorithms ]].
Then here is the list or parsers that we have considered
2020-06-07 15:22:51 +01:00
- Rust parser combinator framework :: https://github.com/Geal/nom/
- LR(1) parser generator for Rust :: https://github.com/lalrpop/lalrpop
- A parser combinator library for Rust :: https://github.com/Marwes/combine
- Parsing Expression Grammar (PEG) parser generator for Rust :: https://github.com/kevinmehall/rust-peg
- General purpose parser :: https://pest.rs/
2020-06-07 16:58:50 +01:00
* Considerations
** Hashmaps
*** DOS attack
- https://www.anchor.com.au/blog/2012/12/how-to-explain-hash-dos-to-your-parents-by-using-cats/
- https://en.wikipedia.org/wiki/Collision_attack
2020-06-07 15:22:51 +01:00
2020-06-07 11:11:17 +01:00
* Resources
2020-10-29 19:34:12 +00:00
For a generic list of resources on compiler design take a look at https://tomassetti.me/resources-create-programming-languages/
2020-11-19 19:14:06 +00:00
https://www.reddit.com/r/ProgrammingLanguages/comments/8ggx2n/is_llvm_a_good_backend_for_functional_languages/
2020-10-29 19:34:12 +00:00
** Lisp
- Make a Lisp :: https://github.com/kanaka/mal/blob/master/process/guide.md
2020-06-07 11:11:17 +01:00
** Rust
2020-06-07 13:40:07 +01:00
- The Rust book :: https://doc.rust-lang.org/book/ https://www.reddit.com/r/rust/comments/2s1zj2/the_rust_programming_language_book_as_epub/
2020-06-07 11:11:17 +01:00
** LLVM
- Brief overview of LLVM :: https://www.infoworld.com/article/3247799/what-is-llvm-the-power-behind-swift-rust-clang-and-more.html
- A bit in depth details on LLVM :: https://aosabook.org/en/llvm.html
- Rust binding :: https://crates.io/crates/llvm-sys
- Official LLVM tutorial C++ :: https://llvm.org/docs/tutorial/
- Rust LLVM tutorial :: https://github.com/jauhien/iron-kaleidoscope
** Data structures
- Pure functional datastructures papaer :: https://www.cs.cmu.edu/ ~rwh/theses/okasaki.pdf
2020-06-27 22:12:09 +01:00
- Dynamic typing: syntax and proof theory :: https://reader.elsevier.com/reader/sd/pii/0167642394000042?token=CEFF5C5D1B03FD680762FC4889A14C0CA2BB28FE390EC51099984536E12AC358F3D28A5C25C274296ACBBC32E5AE23CD
- Representing Type Information in Dynamically Typed Languages :: https://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.4394
- An empirical study on the impact of static typing on software maintainability :: https://www.researchgate.net/publication/259634489_An_empirical_study_on_the_impact_of_static_typing_on_software_maintainability
2020-06-27 22:22:37 +01:00
** Other languages
- Julia: A Fresh Approach toNumerical Computing :: https://julialang.org/research/julia-fresh-approach-BEKS.pdf
2020-06-07 11:11:17 +01:00
** Cranelift
- Source tree :: https://github.com/bytecodealliance/wasmtime/tree/master/cranelift
2020-09-12 17:26:27 +01:00
* Possible solutions
** Garbage collection
2020-10-29 18:37:42 +00:00
- https://v8.dev/blog/high-performance-cpp-gc
2020-09-12 17:26:27 +01:00
** JIT
- https://asmjit.com/
2020-10-29 18:37:42 +00:00
* Features to implement
** Compiler
*** Branch instructions
It would be cool to have macro to instruct the compiler about the likelyhood
of a branch in a conditional. Something similar to kernel's *likely* and *unlikely*
macros
*** Execution Instrumentation
The compiler should be able to embed some code in the program to collect data about
the different execution paths or function instrumentation and other useful data the
can help the compiler to optimize the program even further. For example Imagine a
scenario which we compile a program with out any optimization ( in debug mode ) and
using some test cases or real usage of the program in several iteration we collect
data about the compiled application in a file (let's call it the ADF short for Analytic
Data File), and the we can pass that ADF file to the compiler to let it compile and optimize
the program by using the usual passes alonge side with some extra passes that operate
on ADF
** Lang
2020-11-25 21:27:25 +00:00
*** Scheme
- Chicken Scheme - Easy-to-use compiler and interpreter, with lots of libraries :: https://call-cc.org
- Stalin - Brutally optimizing Scheme compiler, with lots of optimization flags :: https://github.com/barak/stalin
2020-12-05 14:21:15 +00:00
* TODOs
** Bootstrap
*** TODO Language Spec
*** TODO A proper List implementation
It should be a proper linked list
*** TODO Vector implementation
*** TODO Hashmap implementation
*** TODO Call stack
- [ ] Thread local call stack
- [ ] Handle TCO in the call stack
- [ ] Integration with the Error handling
*** TODO Meta data support
- [ ] Attachable meta data to any expression
- [ ] Spec for special meta data that mean something to the interpreter. E.g: docstrings
- [ ] Meta data API
*** TODO Docstring support
- [ ] For functions and macros
- [ ] For namespaces and projects
- [ ] API to interact with docstrings and helps
*** TODO FFI interface
- [ ] Convertion of Serene types to C types
- [ ] Shared libraries dynamic loading
- [ ] Integration with namespaces and requirement set
- [ ] Necessary API and checks for library and ABI Availability
*** TODO Load path and namespace loading
*** TODO nREPL
*** TODO Emacs mode
*** TODO Number implementation
- [ ] Basic operations
- [ ] Standard functions in Serene itself
- [ ] Type infer and conversion
*** TODO String implementation
- [ ] Basic operations
- [ ] Numer <- > String
- [ ] Interpolation
*** TODO Enum implementation
- [ ] Embedded data in a variant
- [ ] Generate functions based on variants
*** TODO Protocol
- [ ] Polymorphic functions
*** TODO Struct implementation
*** TODO Error handling
- [ ] Integration with callstacks
2020-12-12 20:33:53 +00:00
- [ ] Stackable errors
2020-12-05 14:21:15 +00:00
*** TODO Multi arity functions
*** TODO QuasiQuotation
*** TODO Linter
*** TODO Document generator
*** TODO Spec like functionality
*** TODO Laziness implementation
*** Standard libraries
**** TODO IO library
**** TODO Test library
