Turing Programming Language Help For Students

Introduction to Turing Programming Language

Turing is a Pascal like programming language developed in 1982. In computability theory, a system of data manipulation rules is said to be Turing complete or computationally universal if it can be used to simulate any single-Taped Turing machine. Turing is particularly appropriate as a first language for learning and teaching. It incorporates many of the advantages while avoiding most of the disadvantages of earlier languages. The following features make Turing particularly suitable as a first language.

  • we can write one-line program in Turing.
  • Turing is defined by simple rules with few exceptions.
  • Turing is a standardized language. Most Turing program will run on a Macintosh or a UNIX workstation and give the same result.
  • Turing has a formal definitions and semantics.

Example: Calculate A Factorial

 function factorial (n: int) : real
      if n = 0 then
           result 1
           result n * factorial (n - 1)
      end if
 end factorial
 var n: int
      put "Please input an integer: " ..
      get n
      exit when n >= 0
      put "Input must be a non-negative integer."
 end loop
 put "The factorial of ", n, " is ", factorial (n)
Turing Programming Language

Turing Compiler

Turing 4.1.1 IDE and compiler are available for download click here