June 20th, 2022 | notes | kipras melnikovas

(hidden) o6Kke90zt #[[(hidden) S-ygYfi0j]]
- (hidden) vm_uW9bGo [[(hidden) Ib9bzxQxj]]
  - {{[[DONE]]}} (hidden) lkMLrlJqH [[(hidden) UbrBiwJcK]]
    - (hidden) hKZugYglx
  - (hidden) SPZSGpwTW
  - (hidden) lw5UMYilp [[(hidden) 06-21-2022]]
    - {{[[TODO]]}} (hidden) XlzSvEIXI [[(hidden) XgciIgy7G]] [[(hidden) F4OtlHr6v]]
      - (hidden) LpsBpwkkF
    - (hidden) _bIoAKFhz
    - {{[[TODO]]}} (hidden) 9MYSzV03K [[(hidden) UbrBiwJcK]] [[(hidden) SvYgU6pKM]]
      - (hidden) MkQanGLYO
    - (hidden) QsyVtO-Ii
  - (hidden) _2Dl0eyy5
- (hidden) n_9tkuNfI
(hidden) puFSNrGuJ
(hidden) 4ZaRBZUAi
(hidden) jlrA_c5Jn
[[roam-traverse-graph]]
- [[(hidden) nicjeov_l]]
  - {{[[TODO]]}} #read up on [[(hidden) 90idhVaps]]
    - https://en.wikipedia.org/wiki/Parsing
      - https://en.wikipedia.org/wiki/LR_parser
        
        https://en.wikipedia.org/wiki/Deterministic_context-free_language
        
        https://en.wikipedia.org/wiki/Context-free_language
        
        {{[[TODO]]}} #read if we need a context-free or context-aware / context-sensitive parser
        
        ideally context-free ofc, because it's hella simpler & faster
        
        but for that we might have to sacrifice e.g. linked references in linked references
        
        but these are #[[(hidden) 4mVW5p7mL]] anyway, so i don't see a problem
        
        https://en.wikipedia.org/wiki/Context-free_grammar
        
        https://en.wikipedia.org/wiki/Context-sensitive_grammar
        
        https://en.wikipedia.org/wiki/Chomsky_hierarchy
        
        https://en.wikipedia.org/wiki/CYK_algorithm#[[(hidden) G97ohL3l8]]Extensions
  - {{[[TODO]]}} #read "how to write a fast parser"
    - {{[[TODO]]}} #watch [[(hidden) uOCaiRo7p]] [[(hidden) Z4pOhQJME]] "Fast Parser Combinator Library from Scratch in OCaml (no dependencies)"
      - https://www.youtube.com/watch?v=Y5IIXUBXvLs
        
        https://github.com/tsoding/parcoom
        
        https://www.cs.nott.ac.uk/~pszgmh/monparsing.pdf
- #[[(hidden) QMXjpzIJN]]
  - {{[[TODO]]}} `#[[(hidden) agseT3J7Q]][[bar #baz]]#[[(hidden) agseT3J7Q]]#[[(hidden) agseT3J7Q]]`
  - foo:: #[[foo]] [[foo]] #foo {{[[foo]]}} `yeet` ```javascript yeet``` __kek__ **kek** ~~kek~~ ^^kek^^
    - {{[[TODO]]}} ```javascript [[foo `bar` baz]] (lol) #[[foo `bar` baz]] (same ofc) #foo`bar` foo:: ```
    - foo + x
      - #[[(hidden) agseT3J7Q]]`foo`
      - #foo```javascript foo```
      - #[[(hidden) agseT3J7Q]]{{[[TODO]]}}
      - #[[(hidden) agseT3J7Q]][[(hidden) agseT3J7Q]]
      - #[[(hidden) Mmt1KO3x5]]
      - #[[(hidden) agseT3J7Q]]^^foo^^
      - #[[(hidden) agseT3J7Q]]$$x$$
      - #[[(hidden) 7Rnh7VRZe]]#[[(hidden) sGVG3K-Ug]]#a#
      - #[[(hidden) 6YXuVSSeE]]#foo
- {{[[TODO]]}} maybe just explore the [[typescript]] compiler & see what stuff they do to achieve best perf
  - otherwise, instead of all the string mutations & copying, slow loops & array methods etc., go hardcore w/ indices, for loops, minimal functions __w/o__ recursion - use stack instead
  - in general, writing now should be way more obvious on how to do correctly
- {{[[DONE]]}} nah, was able to learn from previous attempt; typed most things out from the very beginning; experimented w/ testing early; & now i think we have a good version coming soon™️
(hidden) pBWto3mmv
(hidden) H8aA-v_LW
(hidden) D9rb0rBDc
(hidden) bf84doSRK
(hidden) 47kwU2UKP
(hidden) 1AML_FCm_
(hidden) yZuWhpfwy
(hidden) 4Mj8fBNlK
(hidden) 3PcTtVdC6
(hidden) xv3F6OH5b
(hidden) WKVtSqVyg
(hidden) 69ijpYxsc
(hidden) 6rFgfF4YD
(hidden) ii1i1DM20
(hidden) C-89hYGxS
(hidden) uTtlcEaqt
(hidden) bm_Cd9E3F
(hidden) 821VkeOr6

words:	287 + 0 = 287
last update: