Which parsing algorithm did acorn use when try to parse binary expression?

[IWANABETHATGUY]

The doc point out that Acorn use perator precedence parser to parse binary expression, I am curious which specific algorithm did acorn use, shunting yard or pratt parser or others?

[marijnh]

It's just a recursive function passing down a precedence value, no idea what that's called.

[IWANABETHATGUY]

Thanks for replying , one more question please. Is it LL or LR?

[marijnh]

The code is right here in the repository. It's a recursive-descent parser, so neither LL nor LR, but more similar to LL.

[IWANABETHATGUY]

Thanks a lot.