CLPR is a programming language created in 1986.
| #1890on PLDB | 38Years Old |
CLP(R) is a declarative programming language. It stands for constraint logic programming (Real) where real refers to the real numbers. It can be considered and is generally implemented as a superset or add-on package for a Prolog implementation.. Read more on Wikipedia...
3*X + 4*Y - 2*Z = 8,
X - 5*Y + Z = 10,
2*X + 3*Y -Z = 20.3*X + 4*Y - 2*Z = 8,
X - 5*Y + Z = 10,
2*X + 3*Y -Z = 20.| Feature | Supported | Token | Example |
|---|---|---|---|
| Binary Literals | ✓ | % 0b[01]+ |
|
| Integers | ✓ | % \d\d?\'[a-zA-Z0-9]+ |
|
| Floats | ✓ | % (\d+\.\d*|\d*\.\d+)([eE][+-]?[0-9]+)? |
|
| Hexadecimals | ✓ | % 0x[0-9a-fA-F]+ |
|
| Octals | ✓ | % 0o[0-7]+ |
|
| Case Sensitivity | ✓ | ||
| Strings | ✓ | 'Hello world' |
|
| MultiLine Comments | ✓ | /* A comment */ |
|
| Print() Debugging | ✓ | ||
| Line Comments | ✓ | % A comment |
|
| Macros | ✓ | term_expansion(parent_child(Parent, Child),
child_parent(Child, Parent)).
parent_child(trevor, simon).
% With the above definitions, we can query (even though the predicate child_parent/2 is nowhere explicitly defined in the code above):
?- child_parent(Child, Parent).
Child = simon, Parent = trevor. |
|
| Type Inference | ✓ | ||
| Comments | ✓ | ||
| Case Insensitive Identifiers | X | ||
| Semantic Indentation | X |