Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
daemin
on April 9, 2018
|
parent
|
context
|
favorite
| on:
Writing a recursive ascent parser by hand
For the most part you can apply some simple rules to transform the BNF notation from being left recursive to being right recursive. It's most useful when you have a right recursive language but are using yacc or bison for the parser.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: