# The Syntax of the Wolfram Language

The Wolfram Language uses various syntactic rules to interpret input that you give, and to convert strings and boxes into expressions. The version of these rules that is used for StandardForm and InputForm in effect defines the basic Wolfram Language. The rules used for other forms, such as TraditionalForm, follow the same overall principles, but differ in many details.

a, xyz, αβγ | symbols |

"some text", "α+β" | strings |

123.456, 3*^45 | numbers |

+, ->, ≠ | operators |

(*comment*) | input to be ignored |

Types of tokens in the Wolfram Language.

When you give text as input to the Wolfram Language, the first thing that the Wolfram System does is to break the text into a sequence of *tokens*, with each token representing a separate syntactic unit.

Thus, for example, if you give the input xx+yy-zzzz, the Wolfram System will break this into the sequence of tokens xx, +, yy, - and zzzz. Here xx, yy, and zzzz are tokens that correspond to symbols, while + and - are operators.

Operators are ultimately what determine the structure of the expression formed from a particular piece of input. The Wolfram Language involves several general classes of operators, distinguished by the different positions in which they appear with respect to their operands.

prefix | !x | Not[x] |

postfix | x! | Factorial[x] |

infix | x+y+z | Plus[x,y,z] |

matchfix | {x,y,z} | List[x,y,z] |

compound | x/:y=z | TagSet[x,y,z] |

overfix | OverHat[x] |

Examples of classes of operators in the Wolfram Language.

Operators typically work by picking up operands from definite positions around them. But when a string contains more than one operator, the result can in general depend on which operator picks up its operands first.

Thus, for example, a*b+c could potentially be interpreted either as (a*b)+c or as a*(b+c) depending on whether * or + picks up its operands first.

To avoid such ambiguities, the Wolfram Language assigns a *precedence* to each operator that can appear. Operators with higher precedence are then taken to pick up their operands first.

Thus, for example, the multiplication operator * is assigned higher precedence than +, so that it picks up its operands first, and a*b+c is interpreted as (a*b)+c rather than a*(b+c).

Whatever the precedence of the operators you are using, you can always specify the structure of the expressions you want to form by explicitly inserting appropriate parentheses.

Extensions of symbol names | x_,#2,e::s, etc. |

Function application variants | e[e],e@@e, etc. |

Power‐related operators | √e,e^e, etc. |

Multiplication‐related operators
| ∇e,e/e,e⊗e,ee, etc. |

Addition‐related operators | e⊕e,e+e,e⋃e, etc. |

Relational operators | e==e,e∼e,e⪡e,e⧏e,e∈e, etc. |

Arrow and vector operators | e⟶e,e↗e,e⇌e,e⥓e, etc. |

Logic operators | ∀_{e}e,e&&e,e∨e,e⊢e, etc. |

Pattern and rule operators | e..,ee,e->e,e/.e, etc. |

Pure function operator | e& |

Assignment operators | e=e,e:=e, etc. |

Compound expression | e;e |

Outline of operators in order of decreasing precedence.

The table in "Operator Input Forms" gives the complete ordering by precedence of all operators in the Wolfram Language. Much of this ordering, as in the case of * and +, is determined directly by standard mathematical usage. But in general the ordering is simply set up to make it less likely for explicit parentheses to have to be inserted in typical pieces of input.

Types of grouping for infix operators.

The syntax of the Wolfram Language is defined not only for characters that you can type on a typical keyboard, but also for all the various special characters that the Wolfram Language supports.

Letters such as , , and from any alphabet are treated just like ordinary English letters, and can for example appear in the names of symbols. The same is true of letter‐like forms such as , , and .

But many other special characters are treated as operators. Thus, for example, and are infix operators, while is a prefix operator, and and are matchfix operators.

Some special characters form elements of fairly complicated compound operators. Thus, for example, Null contains the compound operator with elements Null and Null.

Input to the Wolfram Language can be given not only in the form of one‐dimensional strings, but also in the form of two‐dimensional boxes. The syntax of the Wolfram Language covers not only one‐dimensional constructs but also two‐dimensional ones.