2
For personal enlightenment, I'm trying to write a recursive descent parser for lambda calculus without abstraction, i.e., just identifiers and function application.
The BNF grammar that describes the language could be this, where <var> is a terminal standing for identifiers:
<exp> ::= <exp> <var>...