As input to the machine is processed, the machine moves from state to state as specified by the logic of the machine. In the case of the parser, the input is the language being parsed, and the states correspond to various stages in the grammar rules. See section The Bison Parser Algorithm . Infix operator An arithmetic operator that is placed between the operands on which it performs some operation. A continuous flow of data between devices or programs.
Language construct One of the typical usage schemas of the language.
For example, one of the constructs of the C language is the if statement. See section Languages and Context-Free Grammars . See section Operator Precedence . See section Recursive Rules . See section The Bison Parser Algorithm .