Well-formed syntax

A well formed formula is closely related to the CFG (Context Free Grammar) used in the former chapter. To check whether a formula is well formed, we recursively apply these rules

Nothing else is a well-formed formula.

To put this into context: if our parser does not return an error, we can brag about how well-formed our input formula is :-).

)