Hello whoever watched this video and could please care to help me answer: 0) What is "Parenthesis" in title referring to? 1) What is "Parse Leaf"? I presume they're influences, competitors, or components of Jonathan Blow's Jai language beta program or something, since I've followed @JBlow888's videos for a pretty long time and am also quite familiar with ReversePolishNot8ion from extensive work on my old beloved HP48GX graphing calcul8or. I expect they're considering AbstractSyntaxTrees and other programming-language specific structures that are pertinent to parsing Jai source-code for compil8ion. I'm quite interested in the idea that a single rel8ively simple serial expression string of values && oper8ions to be conducted on the stack is meaningfully distinct from a tree in ways I can't quite identify yet. Maybe the assumption of a stack where the RPN string sequence sprouts and shuffles its oper8ions through is where the expected tree branch structure of ASTs get pieced together. Can an expression sequence not be directly traversed and transl8d losslessly between a tree (that could then be handled customarily with the mentioned recursive models)? I'd love to learn more of their and other's thinking (and what those title terms meant) regarding these aspects of such cutting-edge language design && development. It's often fascin8ing material. I guess I should also probably look into applying to join the Jai beta program at some point, if that's reasonably available? Thanks very much everyone and have a gr8 day! =) -Pip
Who is he talking too? Can you include him in the credits in the description? The audio quality is great, but very low volume relative to other videos on youtube, it'd be nice if it were normalized. Thanks for the upload.
![Eminem - Houdini [Official Music Video]](http://i.ytimg.com/vi/22tVWwmTie8/mqdefault.jpg)
Hello whoever watched this video and could please care to help me answer:
0) What is "Parenthesis" in title referring to?
1) What is "Parse Leaf"?
I presume they're influences, competitors, or components of Jonathan Blow's Jai language beta program or something, since I've followed @JBlow888's videos for a pretty long time and am also quite familiar with ReversePolishNot8ion from extensive work on my old beloved HP48GX graphing calcul8or. I expect they're considering AbstractSyntaxTrees and other programming-language specific structures that are pertinent to parsing Jai source-code for compil8ion. I'm quite interested in the idea that a single rel8ively simple serial expression string of values && oper8ions to be conducted on the stack is meaningfully distinct from a tree in ways I can't quite identify yet.
Maybe the assumption of a stack where the RPN string sequence sprouts and shuffles its oper8ions through is where the expected tree branch structure of ASTs get pieced together. Can an expression sequence not be directly traversed and transl8d losslessly between a tree (that could then be handled customarily with the mentioned recursive models)?
I'd love to learn more of their and other's thinking (and what those title terms meant) regarding these aspects of such cutting-edge language design && development. It's often fascin8ing material. I guess I should also probably look into applying to join the Jai beta program at some point, if that's reasonably available?
Thanks very much everyone and have a gr8 day! =) -Pip
Here's the thing, trees are really bad
So build arrays that act like trees or what other data structure were you thinking would be better for ASTs that aren't trees?
how so
Who is he talking too? Can you include him in the credits in the description?
The audio quality is great, but very low volume relative to other videos on youtube, it'd be nice if it were normalized.
Thanks for the upload.
Casey Muratori
thanks for the feedback, the guy he is talking to is Casey Muratori
the tree allocation speed and cache continuity problem can easily be solved by using a slab allocator
call me sacrilegious, but it can also be solved with garbage collection ;)
@@CaptTerrificthat is, given that the GC allocates the memory linearly, if not, the problem is still the same