# Category:PL/I

**PL/I**

This

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

Execution method: | Compiled (machine code) |
---|---|

Garbage collected: | No |

Parameter passing methods: | By reference, By value |

Type safety: | Safe |

Type strength: | Strong |

Type compatibility: | Nominative |

Type expression: | Explicit |

Type checking: | Static |

Lang tag(s): | pli |

See Also: |

PL/I is a general purpose programming language suitable for commercial, scientific, non-scientific, and system programming.

It provides the following data types:

- Floating-point,
- Decimal integer,
- Binary integer,
- Fixed-point decimal (with a fractional part),
- Fixed-point binary (that is, with a fractional part),
- Pointers,
- Character strings of two kinds:

- fixed-length, and
- varying-length.

- Bit strings of two kinds:

- fixed-length, and
- varying length.

The float, integer, and fixed-point types can be real or complex.

Multiple precisions are available for binary fixed-point:

- 8 bits,
- 16 bits,
- 32 bits, and
- 64 bits.

Multiple precisions are available for floating point:

- 32 bits,
- 64 bits, and
- 80 bits.

The language provides for static and dynamic arrays. Of the latter, there are automatic, controlled, and based.

Controlled can be applied to any data type, including scalar, structure, as well as arrays. With controlled, a push-down and pop-up stack is automatically used.

PL/I has four kinds of I/O:

- For simple I/O commands, list-directed input and output requires only the names of the variables. Default format is used, based on the variable's declaration.
- For simple I/O commands, data-directed input and output requires only the names of the variables. For this form, both the names of the variables and their values are transmitted.
- When precise layouts of input and output data is required, edit-directed I/O is used. A format is specified by the user. The format is flexible, and permits the number of digits, and the number of places after the decimal point to be specified dynamically. The format may also be specified in picture form.
- For files held on storage media, record-oriented transmission is often used, either for sequential or random access.

PL/I has built-in checking for such programmer conditions including

- subscript-range checking,
- floating-point overflow,
- fixed-point overflow,
- division by zero,
- sub-string range checking, and
- string-size checking.

Any of those may be enabled or disabled by the user.

When any of those conditions occurs, the user/programmer may trap them and recover from them and continue execution.

PL/I has a unique and powerful pre-processor which is a subset of the full PL/I language so it can be used to perform (among other things):

- source file inclusion,
- conditional compilation, and
- macro expansion.

The pre-processor keywords are prefixed with a % (percent symbol).

## See Also[edit]

## Pages in category "PL/I"

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

(previous page) (next page)### L

- Largest prime factor
- Largest proper divisor of n
- Last Friday of each month
- Leap year
- Least common multiple
- Left factorials
- Letter frequency
- Levenshtein distance
- Linear congruential generator
- Literals/Floating point
- Literals/Integer
- Literals/String
- Logical operations
- Long multiplication
- Longest common prefix
- Longest string challenge
- 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
- Loops/Wrong ranges
- LU decomposition
- Ludic numbers
- Luhn test of credit card numbers
- LZW compression

### M

- Mad Libs
- Magic squares of odd order
- Man or boy test
- Map range
- Matrix multiplication
- Matrix transposition
- Maximum triangle path sum
- Maze generation
- McNuggets problem
- Memory allocation
- Memory layout of a data structure
- Menu
- Mertens function
- Middle three digits
- Modular inverse
- Monty Hall problem
- Morse code
- Move-to-front algorithm
- Multifactorial
- Multiplication tables
- Munchausen numbers
- Munching squares
- Mutual recursion

### N

- N'th
- N-queens problem
- Narcissistic decimal number
- Nautical bell
- Non-decimal radices/Convert
- Non-decimal radices/Input
- Non-decimal radices/Output
- Nth root
- Null object
- Number names
- Number reversal game
- Numbers whose binary and ternary digit sums are prime
- Numerical integration
- Numerical integration/Gauss-Legendre Quadrature

### O

### P

- Palindrome detection
- Pangram checker
- Parsing/RPN calculator algorithm
- Parsing/RPN to infix conversion
- Parsing/Shunting-yard algorithm
- Pascal matrix generation
- Pascal's triangle
- Perfect numbers
- Perfect totient numbers
- Pernicious numbers
- Phrase reversals
- Pi
- Pick random element
- Pointers and references
- Power set
- Pragmatic directives
- Price fraction
- Primality by trial division
- Primality by Wilson's theorem
- Prime decomposition
- Probabilistic choice
- Problem of Apollonius
- Program termination
- Proper divisors
- Pythagorean triples

### R

- Random number generator (included)
- Random numbers
- Range expansion
- Range extraction
- Read a configuration file
- Read a file line by line
- Read a specific line from a file
- Read entire file
- Real constants and functions
- Recaman's sequence
- Reflection/List properties
- Remove duplicate elements
- Rep-string
- Repeat a string
- Return multiple values
- Reverse a string
- Reverse words in a string
- Riordan numbers
- Rock-paper-scissors
- Roman numerals/Decode
- Roman numerals/Encode
- Roots of a function
- Roots of a quadratic function
- Roots of unity
- Rot-13
- Run-length encoding
- Runge-Kutta method

### S

- Scope/Function names and labels
- Search a list
- SEDOLs
- Selective file copy
- Semiprime
- Semordnilap
- Sequence of non-squares
- Sequence: smallest number greater than previous term with exactly n divisors
- Set consolidation
- Short-circuit evaluation
- Show the epoch
- Sierpinski carpet
- Sierpinski triangle
- Sieve of Eratosthenes
- Singly-linked list/Element definition
- Singly-linked list/Element insertion
- Singly-linked list/Traversal
- Sleep
- Smallest square that begins with n
- Smith numbers
- Sort an integer array
- Sort using a custom comparator
- Sorting algorithms/Bead sort
- Sorting algorithms/Bogosort
- Sorting algorithms/Bubble 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/Quicksort
- Sorting algorithms/Selection sort
- Sorting algorithms/Shell sort
- Sorting algorithms/Stooge sort
- Sorting algorithms/Strand sort
- Soundex
- Special characters
- Special divisors
- Special variables
- Spiral matrix
- Square but not cube
- Stack
- Stack traces
- Statistics/Basic
- Stern-Brocot sequence
- Strange numbers
- Strange plus numbers
- String append
- String case
- String concatenation
- String interpolation (included)
- String length
- String matching
- String prepend
- Strip a set of characters from a string
- Strip block comments
- Strip comments from a string
- Strip control codes and extended characters from a string
- Strip whitespace from a string/Top and tail
- Substring
- Substring/Top and tail
- Subtractive generator
- Sudoku
- Sum and product of an array
- Sum digits of an integer

- Pages using duplicate arguments in template calls
- WikiStubs
- Execution method/Compiled/Machine code
- Garbage collection/No
- Parameter passing/By reference
- Parameter passing/By value
- Typing/Safe
- Typing/Strong
- Typing/Compatibility/Nominative
- Typing/Expression/Explicit
- Typing/Checking/Static
- Programming Languages
- Programming paradigm/Imperative