# Category:Pascal

**Pascal**

This

**programming language**may be used to instruct a computer to perform a task.

Garbage collected: | No |
---|---|

Parameter passing methods: | By reference, By value |

Type safety: | Safe |

Type strength: | Strong |

Type expression: | Explicit |

Type checking: | Static |

See Also: |

**Pascal** is an imperative computer programming language, developed in 1970 by Niklaus Wirth as a language particularly suitable for structured programming. A derivative known as Object Pascal was designed for object-oriented programming. Pascal can be used very easily in conjunction with fundamental discrete mathematics as sets are built into the language.

There are actually several varieties of Pascal. The most important ones are:

- Standard Pascal (ISO 7185) is the original Pascal standard. However, there are many features missing from that language version, which has led to a wide variety of nonstandard extensions. On the other hand, there are features of Standard Pascal which are seldom implemented by Pascal compilers. A compiler which implements all features of Standard Pascal is GNU Pascal.
- Extended Pascal (ISO 10206) is a later Pascal standard which adds a lot to the original Pascal standard. However, compilers implementing Extended Pascal are even more rare than those implementing Standard Pascal. GNU Pascal implements most of Extended Pascal as well.
- Turbo Pascal was a very successful Pascal implementation for DOS and 16 bit Windows (the latest version was sold under the name "Borland Pascal 7.0") and became the de-facto standard for Pascal on DOS. Even today many Pascal compilers provide compatibility to Turbo Pascal.
- Object Pascal is the Pascal dialect used in Delphi, Borland's successor product to Turbo/Borland Pascal. It extends Pascal with a new object model (in addition to the object model introduced in Turbo Pascal 5.5). This language is also implemented by Free Pascal and Lazarus.
- PascalABC.NET PascalABC.NET is the new generation Pascal programming language that combines simplicity of classic Pascal, a great number of modern extensions and broad capabilities of Microsoft .NET Framework.

## Grammar[edit]

The ISO 7185 standard for Pascal uses Extended Backus–Naur Form. Also Van Wijngaarden's grammar can be used to define Pascal's grammar[1].

## See also[edit]

## Subcategories

This category has the following 4 subcategories, out of 4 total.

### @

- Pascal examples needing attention (empty)
- Pascal User (134 P)

### P

## Pages in category "Pascal"

The following 200 pages are in this category, out of 645 total.

(previous page) (next page)### F

- File input/output
- File modification time
- File size
- Filter
- Find limit of recursion
- Find the missing permutation
- Find words which contains more than 3 e vowels
- Finite state machine
- First perfect square in base n with n unique digits
- First power of 2 that has leading decimal digits of 12
- First-class functions/Use numbers analogously
- Five weekends
- Fixed length records
- FizzBuzz
- Flow-control structures
- Floyd's triangle
- Formatted numeric output
- Forward difference
- Fraction reduction
- Function composition
- Function definition
- Fusc sequence

### G

- Gamma function
- Gapful numbers
- Generate lower case ASCII alphabet
- Generic swap
- Giuga numbers
- Globally replace text in several files
- Gray code
- Greatest common divisor
- Greatest element of a list
- Greatest subsequential sum
- Guess the number
- Guess the number/With feedback
- Guess the number/With feedback (player)

### H

- Hailstone sequence
- Halt and catch fire
- Hamming numbers
- Happy numbers
- Harshad or Niven series
- Hash from two arrays
- Haversine formula
- Hello world/Graphical
- Hello world/Line printer
- Hello world/Newline omission
- Hello world/Standard error
- Hello world/Text
- Heronian triangles
- Hexapawn
- Higher-order functions
- Hofstadter Q sequence
- Hofstadter-Conway $10,000 sequence
- Horizontal sundial calculations
- Horner's rule for polynomial evaluation
- Host introspection
- Hostname
- HTTP
- HTTPS
- Humble numbers

### I

- Identity matrix
- Idoneal numbers
- Image noise
- Implicit type conversion
- Include a file
- Inconsummate numbers in base 10
- Increasing gaps between consecutive Niven numbers
- Increment a numerical string
- Infinity
- Inheritance/Multiple
- Inheritance/Single
- Input loop
- Input/Output for pairs of numbers
- Integer comparison
- Integer sequence
- ISBN13 check digit
- Isqrt (integer square root) of X
- Iterated digits squaring

### K

### L

- Langton's ant
- Largest difference between adjacent primes
- Largest five adjacent number
- Largest int from concatenated ints
- Largest proper divisor of n
- Last Friday of each month
- Launch rocket with countdown and acceleration in stdout
- Leap year
- Least common multiple
- Letter frequency
- Levenshtein distance
- Linear congruential generator
- Literals/Floating point
- Literals/Integer
- Literals/String
- Logical operations
- Long literals, with continuations
- Long multiplication
- Long primes
- Long stairs
- Long year
- Longest common subsequence
- Longest common substring
- Longest increasing subsequence
- Longest string challenge
- Look-and-say sequence
- Loop over multiple arrays simultaneously
- Loops/Break
- Loops/Continue
- Loops/Do-while
- Loops/Downward for
- Loops/For
- Loops/For with a specified step
- Loops/Foreach
- Loops/Infinite
- Loops/N plus one half
- Loops/Nested
- Loops/While
- Lucas-Lehmer test
- Ludic numbers
- Luhn test of credit card numbers
- Lychrel numbers

### M

- Machine code
- Mad Libs
- Magic squares of odd order
- Magnanimous numbers
- Man or boy test
- Mandelbrot set
- Map range
- Matrix transposition
- Matrix with two diagonals
- Maximum difference between adjacent elements of list
- Maximum triangle path sum
- Memory allocation
- Memory layout of a data structure
- Menu
- Mertens function
- Mian-Chowla sequence
- Middle three digits
- Minimum multiple of m where digital sum equals m
- Minimum number of cells after, before, above and below NxN squares
- Minimum positive multiple in base 10 using only 0 and 1
- Modular exponentiation
- Modular inverse
- Modulinos
- Monte Carlo methods
- Monty Hall problem
- Morse code
- Mosaic matrix
- Multi-base primes
- Multiple distinct objects
- Multiplication tables
- Munchausen numbers
- Mutual recursion
- Möbius function

### N

- N'th
- N-body problem
- N-queens minimum and knights and bishops
- N-queens problem
- N-smooth numbers
- Naming conventions
- Narcissistic decimal number
- Natural sorting
- Nested function
- Next special primes
- Nim game
- Non-decimal radices/Convert
- Non-decimal radices/Input
- Nonoblock
- Nth root
- Null object
- Number names
- Number reversal game
- Numbers divisible by their individual digits, but not by the product of their digits.
- Numbers which are not the sum of distinct squares
- Numbers whose count of divisors is prime
- Numbers with prime digits whose sum is 13
- Numbers with same digit set in base 10 and base 16
- Numeric separator syntax
- Numerical integration
- Numerical integration/Gauss-Legendre Quadrature