# 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

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

## Subcategories

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

### @

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

### P

## Pages in category "Pascal"

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

(previous page) (next page)### N

- 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 which are the cube roots of the product of their proper divisors
- 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/Adaptive Simpson's method
- Numerical integration/Gauss-Legendre Quadrature

### O

### P

- Pairs with common factors
- Palindrome detection
- Palindromic gapful numbers
- Pan base non-primes
- Pandigital prime
- Pangram checker
- Paraffins
- Parameterized SQL statement
- Pascal matrix generation
- Pascal's triangle
- Password generator
- Pell's equation
- Penholodigital squares
- Penney's game
- Perceptron
- Percolation/Mean run density
- Perfect numbers
- Perfect totient numbers
- Perlin noise
- Permutations
- Permutations with repetitions
- Permutations with some identical elements
- Permutations/Derangements
- Permuted multiples
- Pernicious numbers
- Pi
- Pick random element
- Pig the dice game
- Playing cards
- Pointers and references
- Polymorphism
- Population count
- Positive decimal integers with the digit 1 occurring exactly twice
- Practical numbers
- Price fraction
- Primality by trial division
- Primality by Wilson's theorem
- Prime conspiracy
- Prime decomposition
- Prime numbers whose neighboring pairs are tetraprimes
- Prime reciprocal sum
- Prime triangle
- Primes whose sum of digits is 25
- Primorial numbers
- Priority queue
- Program name
- Program termination
- Proper divisors
- Pythagorean quadruples
- Pythagorean triples

### R

- Radical of an integer
- Random Latin squares
- Random number generator (device)
- Random number generator (included)
- Random numbers
- Range extraction
- Read a configuration file
- Read a file character by character/UTF8
- Read a file line by line
- Read a specific line from a file
- Read entire file
- Real constants and functions
- Regular expressions
- Remove duplicate elements
- Remove lines from a file
- Remove vowels from a string
- Rename a file
- Repeat
- Repeat a string
- Return multiple values
- Reverse a string
- Reverse the order of lines in a text file while preserving the contents of each line
- Reverse words in a string
- Roman numerals/Decode
- Roman numerals/Encode
- Roots of a function
- Roots of a quadratic function
- Roots of unity
- Rot-13
- Round-robin tournament schedule
- RPG attributes generator
- Run-length encoding
- Runge-Kutta method
- Ruth-Aaron numbers

### S

- Safe primes and unsafe primes
- Sattolo cycle
- Scope modifiers
- Search a list
- Search a list of records
- Secure temporary file
- SEDOLs
- Self numbers
- Self-describing numbers
- Semiprime
- SEND + MORE = MONEY
- Send an unknown method call
- Sequence of non-squares
- Sequence of primes by trial division
- Sequence: smallest number greater than previous term with exactly n divisors
- Set
- Seven-sided dice from five-sided dice
- Sexy primes
- SHA-1
- SHA-256 Merkle tree
- Shell one-liner
- Short-circuit evaluation
- Show the (decimal) value of a number of 1s appended with a 3, then squared
- Show the epoch
- Sierpinski carpet
- Sierpinski triangle
- Sieve of Eratosthenes
- Sieve of Pritchard
- Simple windowed application
- Singleton
- Singly-linked list/Element definition
- Singly-linked list/Element insertion
- Singly-linked list/Reversal
- Singly-linked list/Traversal
- Sisyphus sequence
- Sleep
- Sleeping Beauty problem
- Smallest multiple
- Smallest numbers
- Smallest power of 6 whose decimal expansion contains n
- Smallest square that begins with n
- Smarandache prime-digital sequence
- Smith numbers
- Sockets
- Solve hanging lantern problem
- Sort an array of composite structures
- Sort disjoint sublist
- Sort stability
- Sort the letters of string in alphabetical order
- Sort three variables
- Sort using a custom comparator
- Sorting algorithms/Bead sort
- Sorting algorithms/Bogosort
- Sorting algorithms/Bubble sort
- Sorting Algorithms/Circle Sort
- Sorting algorithms/Cocktail sort
- Sorting algorithms/Comb sort
- Sorting algorithms/Counting sort
- Sorting algorithms/Gnome sort
- Sorting algorithms/Heapsort
- Sorting algorithms/Insertion sort
- Sorting algorithms/Merge sort
- Sorting algorithms/Pancake sort
- Sorting algorithms/Patience sort
- Sorting algorithms/Quicksort
- Sorting algorithms/Selection sort
- Sorting algorithms/Shell sort
- Sorting algorithms/Sleep sort
- Sorting algorithms/Stooge sort
- Sorting algorithms/Strand sort
- Soundex
- Special characters
- Special divisors
- Special variables
- Sphenic numbers
- Spiral matrix
- Split a character string based on change of character
- Square but not cube
- Square form factorization
- Square-free integers
- Stack
- Stair-climbing puzzle
- Start from a main routine
- Statistics/Normal distribution
- Stern-Brocot sequence
- Strange numbers
- Strange unique prime triplets
- String append
- String case
- String concatenation
- String length
- String prepend
- Strip a set of characters from a string
- Strip comments from a string
- Strip control codes and extended characters from a string