Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
asrp
on March 20, 2017
|
parent
|
context
|
favorite
| on:
Show HN: How to write a recursive descent parser
By going to the other extreme, you can use
only
precedence climbing (with just a grammar) by using Floyd's algorithm, which will treat all tokens as operators. It uses two precedences functions instead of one, a left and right precedence.
https://en.wikipedia.org/wiki/Operator-precedence_grammar
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
https://en.wikipedia.org/wiki/Operator-precedence_grammar