The programming languages REC and convert

Authors:
Harold V. McIntosh;Gerardo Cisneros
Affiliations:
Department de Aplicación de Microcomputadoras, Instituto de Ciencias, Universidad Autónoma de Puebla, Apartado postal 461, 72000 Puebla, Puebla, México;Department de Aplicación de Microcomputadoras, Instituto de Ciencias, Universidad Autónoma de Puebla, Apartado postal 461, 72000 Puebla, Puebla, México
Venue:
ACM SIGPLAN Notices
Year:
1990

Citing 5
Cited 1

CONVERT

Communications of the ACM
Recursive functions of symbolic expressions and their computation by machine, Part I

Communications of the ACM
PASCAL user manual and report

PASCAL user manual and report
Computation: finite and infinite machines

Computation: finite and infinite machines
LISP 1.5 Programmer's Manual

LISP 1.5 Programmer's Manual

Configurable REC

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two symbol manipulation languages are presented. REC (an acronym for Regular Expression Compiler) is a very compact language possessing a simple control structure. CONVERT is a pattern matching and substitution language well suited to problems whose solution may conveniently be expressed in terms of transformation rules. REC is useful when conciseness is required. such as for microcomputers with limited memory, interactive programming via the keyboard, and so on. Its present form was carefully chosen to facilitate the compilation of CONVERT programs while still preserving a universal appearance. In turn, CONVERT is a natural alternative to consider for an application which is already expressed in terms of transformation rules, as are many compilers, assemblers and symbol manipulation systems. This article primarily describes the appearance of these two languages, but some of the applications which they have been given are mentioned.