Category:REXX
This programming language may be used to instruct a computer to perform a task.
Execution method: | Interpreted |
---|---|
Garbage collected: | Allowed (and in most versions of REXX, it is automatic, but garbage collection isn't mandated). |
Parameter passing methods: | By value |
Type safety: | Safe |
Type strength: | Strong |
Type compatibility: | Nominative |
Type expression: | Inferred |
Type checking: | Dynamic |
Typing: | Untyped |
See Also: |
This page uses content from Wikipedia. The original article was at REXX. The list of authors can be seen in the page history. As with Rosetta Code, the text of Wikipedia is available under the GNU FDL. (See links for details on variance) |
REXX (REstructured eXtended eXecutor) is an interpreted programming language which was developed at IBM. It is a structured high-level programming language which was designed to be both easy to learn and easy to read. Both proprietary and open source interpreters for REXX are available on a wide range of computing platforms, and compilers are available for IBM mainframes.
REXX is also spelled:
- Rexx
- REXX
- but the primary official spelling is REXX and is the spelling used here on Rosetta Code.
The REXX language was influenced by the computer programming languages: ALGOL, PL/I, EXEC, and EXEC 2.
Using Classic REXX closely resembles pseudo code and many languages like Basic or Julia. Experienced programmers should have no problem reading REXX code and translating it to other languages.
Some items that might differ from what you are familiar with.
- No data types, no declarations, everything is string.
- Exponentiation is designated by '**' thus x^2 = x**2.
- Integer division is designated by '%' thus 13%3 = 4.
- Modulo division (remainder) is designated by '//' thus 13//3 = 1 ('13 mod 3').
- Arrays (here called 'stems') are designated by something like 'stem.a.b. etc' (stem = name array; a, b etc any value; 'associative arrays').
- Precision is unlimited (default 9 digits), but you have to specify it yourself ('numeric digits nn').
Versions of REXX:
- ARexx is a classic REXX implementation (with extensions) for the AmigaOS, given in bundle since AmigaOS 2. (Regina REXX has specific support for the extended functions that were introduced in ARexx.) ARexx was written in 1987 by William S. Hawes.
- Brexx a classic REXX written by Vassilis N. Vlachoudis, it is free and it's open source and available under the GNU General Public License.
- CRX REXX (Compact REXX) is a classic REXX first written by Dr. Brian Marks.
- CTC REXX is a classic REXX that is bundled with PC/SPF and written by Command Technology Corporation, a license is required to use this product. This version of REXX can only be used under PC/SPF and it's panels. PC/SPF resembles the IBM program product SPF (which has other names and versions). The last version was published in 1996. CTC doesn't exist anymore.
- KEXX is a subset of REXX that is bundled with KEDIT and written by Keven J. Kearney of Mansfield Software Group, Inc., a license is required to use this product. KEXX only executes under the KEDIT licensed product. KEDIT is an XEDIT clone (an editor from IBM for VM/CMS program products).
- MVS/TSO REXX is IBM's implementation of classic REXX, a license is required to use the product as well as the operating system it runs under; MVS and TSO are used here as generic references.
- MVS/TSO REXX compiler is an IBM implementation of classic REXX, a license is required to use this product as well as the operating system it runs under.
- NetRexx is IBM's variant of the REXX programming language to run on the Java virtual machine. It supports a classic REXX syntax, with no reserved keywords, along with considerable additions to support Object-oriented programming in a manner compatible with Java's object model, yet can be used as both a compiled and an interpreted language, with an option of using only data types native to the JVM or the NetRexx run-time package. The syntax and object model of NetRexx differ from Object REXX and Open Object Rexx.
- Object REXX is/was an object-oriented scripting language initially produced by IBM for OS/2. It is a follow-on to and a significant extension of the "Classic Rexx" language originally created for the CMS component of VM/SP and later ported to MVS, OS/2 and PC DOS. OS/2 version of IBM Object REXX is deeply integrated with SOM. On October 12, 2004, IBM released Object REXX as open source software, giving rise to Open Object Rexx (ooRexx).
- ooRexx (Open Object Rexx) is an implementation of Object REXX, which is REXX with OO features (some REXX programs are compatible).
- OS/2 REXX is a classic REXX that is an IBM implementation of classic REXX, a license is required to use this product as well as the operating system it runs under.
- OS/400 REXX is an IBM implementation of classic REXX, a license is required to use this product as well as the operating system it runs under.
- PC/REXX is the first classic REXX implemented outside of IBM mainframes, intended for IBM DOS and MS DOS. Written by Mansfield Software Group, Inc., REXX was bundled with KEDIT, a license is required to use this product.
- Personal REXX is a classic REXX that is intended for IBM DOS and MS DOS, written by Charles Daney of Quercus Systems, a license is required to use this product. It is also known as REXX/Personal.
- Portable REXX (see the R4 REXX entry, below).
- Regina REXX is an implementation first created by Anders Christensen (in 1992) and is now maintained by others, notably Mark Hessling. Regina REXX runs on more different platforms than any other REXX, too many to name here. It can be downloaded freely.
- Reginald REXX is a REXX developed by Jeff Glatt. It can be downloaded freely. According to Rexxinfo.org, Reginald is out of maintenance.
- REXX/imc a classic REXX developed by Ian M. Collier (imc) for Linux/Unix.
- REXX/Personal is another name for Personal REXX (see above).
- ROO oo-REXX an object-oriented REXX developed by Keith Watts of Kilowatt Software, Inc. It can be downloaded freely. ROO is also known as ROO!. According to Rexxinfo.org, Roo! is out of maintenance.
- R4 REXX a classic REXX developed by Keith Watts of Kilowatt Software, Inc. It was also known as Portable REXX. It can be downloaded freely. According to Rexxinfo.org, R4 is out of maintenance.
- T/REXX, a REXX compiler for CMS is an implementation of classic REXX written by Leigh Lundin and Mark Woodruff (according to Wikipedia).
- VM/CMS REXX is an IBM implementation of classic REXX that was first implemented (for general use) in the early 1980s. A license is required to use this product as well as the operating system that it runs under. This was the original implementation of REXX written (circa 1979) by Mike Cowlishaw of IBM.
- VM/CMS REXX compiler is an IBM implementation of classic REXX, a license is required to use this product as well as the operating system it runs under.
[Most of the entries were entered mostly from memory and apologies are offered for not knowing more about what wording should be used; the IBM operating systems or Program Products that run REXX are numerous and varied. Their complete (official) names would fill a pageful or two. Some of the REXXes are no longer sold nor available for downloading or purchase, others are no longer maintained. Naming of names is being avoided (especially those licensed products for sale), and it is hoped that this is seen that no products nor vendors are being endorsed, appraised, or critiqued.] -- Gerard Schildberger 09:28, 1 July 2012 (UTC)
External Links
- English Wikipedia REXX
- Brexx interpreter
- Open Object Rexx - www.oorexx.org
- The NetRexx Programming Language - www.netrexx.org
- The Rexx Language Association - www.rexxla.org
- Regina Rexx Interpreter
- Mansfield Software Group, Inc. (KEDIT)
- Personal REXX, Quercus Systems
- CTC Command Technology
- CRX Open Source (right column side)
- R4, Kilowatt Software
- ROO, Kilowatt Software
- z/VM V6R1 REXX/VM Reference
- z/VM V6R1 REXX/VM User's Guide
- {many references to REXX manuals}
Rosetta Code tasks not implemented in REXX
Subcategories
This category has the following 4 subcategories, out of 4 total.
@
- REXX examples needing attention (empty)
- REXX User (31 P)
R
- REXX library routines (20 P)
Pages in category "REXX"
The following 200 pages are in this category, out of 1,161 total.
(previous page) (next page)M
- Minimum positive multiple in base 10 using only 0 and 1
- Minkowski question-mark function
- Modified random distribution
- Modular exponentiation
- Modular inverse
- Modulinos
- Monads/Maybe monad
- Monte Carlo methods
- Monty Hall problem
- Morpion solitaire
- Morse code
- Motzkin numbers
- Move-to-front algorithm
- Multi-base primes
- Multi-dimensional array
- Multifactorial
- Multiple distinct objects
- Multiplication tables
- Multiplicative order
- Multisplit
- Munchausen numbers
- Munching squares
- Musical scale
- Mutual recursion
- Möbius function
N
- N'th
- N-queens problem
- N-smooth numbers
- Named parameters
- Naming conventions
- Narcissist
- Narcissistic decimal number
- Native shebang
- Nautical bell
- Negative base numbers
- Neighbour primes
- Nested function
- Nested templated data
- Next highest int from digits
- Next special primes
- Nice primes
- Nim game
- Nimber arithmetic
- Non-continuous subsequences
- Non-decimal radices/Convert
- Non-decimal radices/Input
- Non-decimal radices/Output
- Nonoblock
- Nonogram solver
- Nth root
- Null object
- Number names
- Number reversal game
- Numbers divisible by their individual digits, but not by the product of their digits.
- Numbers in base 10 that are palindromic in bases 2, 4, and 16
- Numbers in base-16 representation that cannot be written with decimal digits
- Numbers whose binary and ternary digit sums are prime
- Numbers whose count of divisors is prime
- Numbers with equal rises and falls
- Numbers with prime digits whose sum is 13
- Numbers with same digit set in base 10 and base 16
- Numeric error propagation
- Numeric separator syntax
- Numerical and alphabetical suffixes
- Numerical integration
- Numerical integration/Adaptive Simpson's method
- Numerical integration/Gauss-Legendre Quadrature
- NYSIIS
O
- Odd squarefree semiprimes
- Odd word problem
- Odd words
- Old lady swallowed a fly
- Old Russian measure of length
- One of n lines in a file
- One-dimensional cellular automata
- Operator precedence
- Optional parameters
- Orbital elements
- Order by pair comparisons
- Order disjoint list items
- Order two numerical lists
- Ordered partitions
- Ordered words
- Overloaded operators
P
- Padovan n-step number sequences
- Padovan sequence
- Palindrome dates
- Palindrome detection
- Palindromic gapful numbers
- Palindromic primes
- Palindromic primes in base 16
- Pancake numbers
- Pandigital prime
- Pangram checker
- Paraffins
- Parametric polymorphism
- Parse an IP Address
- Parse command-line arguments
- Parsing/RPN calculator algorithm
- Parsing/RPN to infix conversion
- Parsing/Shunting-yard algorithm
- Partial function application
- Particle swarm optimization
- Partition an integer x into n primes
- Partition function P
- Pascal matrix generation
- Pascal's triangle
- Pascal's triangle/Puzzle
- Password generator
- Pathological floating point problems
- Pell's equation
- Penney's game
- Pentagram
- Perceptron
- Percolation/Mean run density
- Perfect numbers
- Perfect shuffle
- Perfect totient numbers
- Perlin noise
- Permutation test
- Permutations
- Permutations by swapping
- Permutations with repetitions
- Permutations with some identical elements
- Permutations/Derangements
- Permutations/Rank of a permutation
- Permuted multiples
- Pernicious numbers
- Phrase reversals
- Pi
- Pick random element
- Pierpont primes
- Pig the dice game
- Pig the dice game/Player
- Piprimes
- Pisano period
- Playfair cipher
- Playing cards
- Plot coordinate pairs
- Pointers and references
- Poker hand analyser
- Polymorphic copy
- Polynomial long division
- Polynomial regression
- Polynomial synthetic division
- Population count
- Positive decimal integers with the digit 1 occurring exactly twice
- Power set
- Pragmatic directives
- Price fraction
- Primality by trial division
- Primality by Wilson's theorem
- Prime conspiracy
- Prime decomposition
- Prime numbers p for which the sum of primes less than or equal to p is prime
- Prime numbers which contain 123
- Prime triplets
- Prime words
- Primes which contain only one odd digit
- Primes whose first and last number is 3
- Primes whose sum of digits is 25
- Primes with digits in nondecreasing order
- Primorial numbers
- Print debugging statement
- Print itself
- Priority queue
- Probabilistic choice
- Problem of Apollonius
- Product of divisors
- Program name
- Program termination
- Proper divisors
- Pseudo-random numbers/PCG32
- Pseudo-random numbers/Splitmix64
- Pseudo-random numbers/Xorshift star
- Pythagorean quadruples
- Pythagorean triples
Q
R
- Radical of an integer
- Ramanujan's constant
- Ramer-Douglas-Peucker line simplification
- Ramsey's theorem
- Random Latin squares
- Random number generator (device)
- Random number generator (included)
- Random numbers
- Range consolidation
- Range expansion
- Range extraction
- Ranking methods
- Rare numbers
- Rate counter
- Ray-casting algorithm
- Read a configuration file