Category:ALGOL W: Difference between revisions
m →See also: Added Wikipedia like |
m Algol W is imperative but not concurrant |
||
Line 32: | Line 32: | ||
*[[ALGOL 60]] |
*[[ALGOL 60]] |
||
*[[ALGOL 68]] |
*[[ALGOL 68]] |
||
{{language programming paradigm| |
{{language programming paradigm|Imperative}} |
||
{{stub}} |
{{stub}} |
Revision as of 17:55, 29 August 2021
![Language](http://static.miraheze.org/rosettacodewiki/thumb/2/27/Rcode-button-language-crushed.png/64px-Rcode-button-language-crushed.png)
This programming language may be used to instruct a computer to perform a task.
Parameter passing methods: | By reference, By value |
---|---|
Type safety: | Safe |
Type strength: | Strong |
Type compatibility: | Nominative |
Type expression: | Explicit |
Type checking: | Dynamic, Static |
See Also: |
Algol W is a successor to Algol 60 closely based on A Contribution to the Development of ALGOL by Niklaus Wirth and C. A. R. Hoare. It includes dynamically allocated records, string handling, complex numbers and a standard I/O system. A copy of the Algol W Language Description can be found on Karl Kleine's Historic Documents in Computer Science page. Dabcanboulet's Algol W @ Everything2 page contains an excellent history and tutorial.
Awe is a new compiler for the Algol W language. It is a complete implementation of the language described in the Algol W Language Description, June 1972. Awe should be able to compile code intended for the OS/360 Algol W compilers with little or no modification. See the Awe manual for more details.
Awe correctly compiles Tony Marsland's computer chess player Awit and Hendrik Boom's A68H Algol 68 compiler.
See also
Subcategories
This category has the following 3 subcategories, out of 3 total.
@
- ALGOL W examples needing attention (empty)
- ALGOL W Implementations (empty)
- ALGOL W User (empty)
Pages in category "ALGOL W"
The following 200 pages are in this category, out of 335 total.
(previous page) (next page)A
- A+B
- ABC problem
- Abundant odd numbers
- Abundant, deficient and perfect number classifications
- Ackermann function
- Additive primes
- Almost prime
- Amicable pairs
- Angles (geometric), normalization and conversion
- Anti-primes
- Apply a callback to an array
- Archimedean spiral
- Arithmetic derivative
- Arithmetic/Complex
- Arithmetic/Integer
- Array concatenation
- Arrays
- Ascending primes
- Assertions
- Assertions in design by contract
- Attractive numbers
- Averages/Arithmetic mean
- Averages/Pythagorean means
- Averages/Root mean square
B
C
- Calendar
- Call a function
- Calmo numbers
- Cantor set
- Case-sensitivity of identifiers
- Catalan numbers
- Catalan numbers/Pascal's triangle
- Centroid of a set of N-dimensional points
- Character codes
- Chebyshev coefficients
- Chemical calculator
- Circular primes
- Comma quibbling
- Comments
- Compare a list of strings
- Compiler/AST interpreter
- Compiler/code generator
- Compiler/lexical analyzer
- Compiler/syntax analyzer
- Compiler/Verifying syntax
- Compiler/virtual machine interpreter
- Compound data type
- Concatenate two primes is also prime
- Conditional structures
- Convert seconds to compound duration
- Coprime triplets
- Coprimes
- Copy a string
- Count in factors
- Count in octal
- Cousin primes
- Create a two-dimensional array at runtime
- Cubic special primes
- Cumulative standard deviation
- CUSIP
D
- Day of the week
- Day of the week of Christmas and New Year
- Days between dates
- De Polignac numbers
- Deceptive numbers
- Department numbers
- Descending primes
- Detect division by zero
- Determine if a string is numeric
- Determine if two triangles overlap
- Digital root
- Digital root/Multiplicative digital root
- Disarium numbers
- Discordian date
- Doomsday rule
- Dot product
- Doubly-linked list/Element definition
- Doubly-linked list/Element insertion
- Doubly-linked list/Element removal
- Doubly-linked list/Traversal
- Draw a sphere
E
F
- Factorial
- Factorial primes
- Factors of an integer
- FASTA format
- Fibonacci sequence
- Filter
- Find prime n such that reversed n is also prime
- Find prime numbers of the form n*n*n+2
- Find square difference
- Find squares n where n+1 is prime
- Find the intersection of two lines
- Find the last Sunday of each month
- Find words which contain the most consonants
- First 9 prime Fibonacci number
- FizzBuzz
- Flow-control structures
- Floyd's triangle
- Forward difference
- Four sides of square
- Function definition
G
H
I
L
- Lah numbers
- Largest proper divisor of n
- Last Friday of each month
- Leap year
- Least common multiple
- Length of an arc between two angles
- Literals/Floating point
- Literals/Integer
- Literals/String
- Logical operations
- Long multiplication
- Long year
- Loop over multiple arrays simultaneously
- Loops/Continue
- Loops/Do-while
- Loops/Downward for
- Loops/For
- Loops/For with a specified step
- Loops/Infinite
- Loops/N plus one half
- Loops/While
- Loops/With multiple ranges
- Loops/Wrong ranges
- Luhn test of credit card numbers
M
- Magic squares of odd order
- Magnanimous numbers
- Man or boy test
- Mandelbrot set
- Matrix with two diagonals
- Maximum difference between adjacent elements of list
- Meissel–Mertens constant
- Memory allocation
- Mersenne primes
- Mertens function
- Mian-Chowla sequence
- Middle three digits
- Minimum number of cells after, before, above and below NxN squares
- Minimum numbers of three lists
- Mosaic matrix
- Multi-dimensional array
- Multifactorial
- Multiple distinct objects
- Multiplication tables
- Munchausen numbers
- Mutual recursion