CGOL
From Wikipedia, the free encyclopedia
| CGOL | |
|---|---|
| Paradigm | procedural, imperative, structured |
| Designed by | Vaughan Pratt |
| First appeared | 1973 |
| Influenced by | |
| ALGOL, FORTRAN, MLisp | |
CGOL[1][2] (pronounced "see goll") is an alternative syntax featuring an extensible algebraic notation for the Lisp programming language. It was designed for MACLISP by Vaughan Pratt and subsequently ported to Common Lisp.[3]
The notation of CGOL is a traditional infix notation, in the style of ALGOL, rather than Lisp's traditional, uniformly-parenthesized prefix notation syntax. The CGOL parser is based on Pratt's design for top-down operator precedence parsing,[4][5] sometimes informally referred to as a "Pratt parser".
Semantically, CGOL is essentially just Common Lisp, with some additional reader and printer support.
CGOL may be regarded as a more successful incarnation of some of the essential ideas behind the earlier LISP 2 project. Lisp 2 was a successor to LISP 1.5 that aimed to provide ALGOL syntax. LISP 2 was abandoned, whereas it is possible to use the CGOL codebase today. This is because unlike LISP 2, CGOL is implemented as portable functions and macros written in Lisp, requiring no alterations to the host Lisp implementation.