Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Looks interesting. I understand that you can just provide the grammar as a string. Which seems to imply that it is an interpretting parser. There are not many interpretting parsers. (I did implement one myself [1].)

I wonder if it can also deal with ambigious grammars and/or if it is a back-tracking parser.

It also has a single grammar for lexical and syntax description. (My interpretting parser is based on a hard-coded lexer.)

[1] https://fransfaase.github.io/ParserWorkshop/Online_inter_par...



Ohm is based on parsing expression grammars: https://bford.info/pub/lang/peg/

The current implementation does use a tree-walk interpreter, but I'm considering creating a version that compiles to WebAssembly.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: