Viewing profile — DmitrySoshnikov
DmitrySoshnikov
HN member- Joined
- Sun, May 29, 2011, 8:09 PM UTC
- HN karma
- 318
- Public activity
- 80 items
- HN profile
- View on Hacker News ↗
About DmitrySoshnikov
Recent public activity
- story
- story
- story
- story
- story
- story
- story
-
comment
Comment #25410266
sbrk is emulated via mmap today on MacOS and others, this is an abstraction (for bump allocation), not just a function you may implement custom sbrk via mmap easily
-
comment
Comment #24912761
Thanks for the feedback, and glad to see more engineers interested in deeper topics!
-
comment
Comment #24910734
That's a great point and I have the https://github.com/DmitrySoshnikov/syntax/issues/99 to add support for IELR in Syntax.
-
comment
Comment #24910091
Yes, in fact for building a language the parsing stage should be skipped altogether (start with interpreter or bytecode). We do this in the interpreters class. And once you have a …
-
comment
Comment #24909033
Yes, backtracking still might be an option although has its known limitations in terms of parallel paths. We describe backtracking in this class too. The LL in the the view of manu…
-
comment
Comment #24904743
Yeah, this makes sense, thanks.
-
comment
Comment #24904695
Professor Aiken is a great teacher and I love his compilers course. However as for the parsering stage, that course goes as maximum as to SLR(1) which is pretty "toy" parsing mode.…
-
comment
Comment #24904686
Thank you for the feedback, glad you liked it, and glad to see more people interested in deeper CS topics!
-
comment
Comment #24904678
Yes, I recommend "Parsing Techniques" book.
-
comment
Comment #24904672
See this small summary doc on different techniques for error recovery: https://gist.github.com/DmitrySoshnikov/feee52cbfb03b7b69110...
-
comment
Comment #24904670
Great details, thanks! > A benefit of a syntax with indentation-defined block structure is that you don't need to rely on balanced grouping tokens like { ... } In fact from the lex…
-
comment
Comment #24902154
Yes, this is called "parse error recovery" and there are multiple techniques for this. In fact, most of the production parsers support this mode. E.g. when you try executing a C++ …
-
comment
Comment #24901565
Absolutely! S-expression (used in Scheme, Lisp, etc) is a great AST-based syntax to start building an interpreter right away. But for fully ergonomic language you would need a pars…
-
comment
Comment #24900995
Yes, in the "Essentials of Interpretation" class (aka "Building an Interpreter from scratch" we focus exactly on runtime semantics, and evaluating the language. The S-expression al…
-
comment
Comment #24900952
Should be up by now; seems auto-DDOS'ed, lol
-
comment
Comment #24900926
Yes, if you need to parse that input string to generates an appropriate SQL query, you would need to have a small DSL (domain-specific language) for that "string", whatever it cont…
-
comment
Comment #24900904
Yes, to some degree -- Syntax tool normally support lexer states, and the same "while" token may mean a keyword or the property/field name of a struct. You can find more details of…
-
comment
Comment #24900882
Yes, we use LALR(1) parsing mode to build the actual parser, and it exactly supports Left recursive grammars (which are much more elegant than LL). We also don't focus much on scan…