well-formed formula

For the New Zealand government policy, see Working for Families.In logic, WFF (pronounced "wiff") is an abbreviation for well-formed formula. Given a formal grammar, a WFF is any string that is generated by that grammar. To say that a string is a WFF with respect to a given formal grammar is equivalent to saying that belongs to the language generated by , i.e. .
See more at Wikipedia.org...