COMPILER DESIGN

Detailed explanation-1: -A head that can read and write symbols on the tape and move the tape left and right one (and only one) cell at a time. In some models the head moves and the tape is stationary.

Detailed explanation-2: -The machine has a head that reads and writes symbols as it moves along the tape. When the tape reads any particular symbol, it decides what to do (what to write to the tape at that point and then which direction to move in next) depending on the set of transition functions associated with the machine.

Detailed explanation-3: -A Turing machine consists of an infinitely long tape, which has been divided up into cells. Each cell can contain either a 1, a 0, or an empty space. Above one cell of the tape is a head, which can either move left or right, and can read the symbols written in the cells.

Detailed explanation-4: -With this head, the machine can perform three very basic operations: Read the symbol on the square under the head. Edit the symbol by writing a new symbol or erasing it. Move the tape left of right by one square so that the machine can read and edit the symbol on a neighbouring square.

Detailed explanation-5: -Read the input symbol from the active cell. Look up the transition rule associated with the current state and input symbol. Overwrite the input symbol with the new symbol. Change the current state according to the transition rule. More items •30-Jun-2017