I'm trying to write a lambda calculus expressions parser, but I'm having a hard time dealing applications being left associative and having higher precedence than abstractions. I can either parse "a b c" or "fn x . x a" correctly, but not both with the same parser 😞

@doddenino: I'm not familiar with the syntax you're trying to parse, but have you looked at the ordered choice / operator?