In logic, mathematics, computer science, and linguistics, a formal language consists of words whose letters are taken from an alphabet and are well-formed according to a specific set of rules called a formal grammar.
The alphabet of a formal language consists of symbols, letters, or tokens that concatenate into strings called words. Words that belong to a particular formal language are sometimes called well-formed words or well-formed formulas. A formal language is often defined by means of a formal grammar such as a regular grammar or context-free grammar, which consists of its formation rules.
A formal language is an organized set of symbols the essential feature being that it can be precisely defined in terms of just the shapes and locations of those symbols. Such a language can be defined, then, without any reference to any meanings of any of its expressions; it can exist before any interpretation is assigned to it—that is, before it has any meaning. A formal grammar determines which symbols and sets of symbols are formulas in a formal language.
| LOGIC LANGUAGE | NATURAL LANGUAGE |
|---|---|
| operators ( constants) | verbs |
| operator helpers | adverbs |
| variables | Nouns |
| Variable helpers | adjectives |
| Substitutive Variables | Pronouns , Interjection |
| Connexive Constants | Conjunctions , prepositions |
| declaratives |