REC/SM: a semi structured programming language

ABSTRACT

Regular Expression Compiler (REC) is a programming language of extremely simple structure. It is a goto-less language which has very appealing transfer of control operations. It is a generalized language which can be implemented for special purpose applications by a proper choice of operators and predicates. This paper describes REC language and one of its "symbol manipulation" implementations, REC/SM. The language has been enormously successful from the users satisfaction point of view. And like BLISS, it has once again proved that the well-publicized inconvenience of programming without a goto is a myth.

REFERENCES

• 1: Corrado Böhm , Giuseppe Jacopini, Flow diagrams, turing machines and languages with only two formation rules, Communications of the ACM, v.9 n.5, p.366-371, May 1966 [doi>10.1145/355592.365646]
• 2: Adolfo Guzmán , Harold V. McIntosh, CONVERT, Communications of the ACM, v.9 n.8, p.604-615, Aug. 1966 [doi>10.1145/365758.365787]
• 3: Donald E. Knuth, Structured Programming with go to Statements, ACM Computing Surveys (CSUR), v.6 n.4, p.261-301, Dec. 1974 [doi>10.1145/356635.356640]
• 4: McIntosh, H., "A CONVERT Compiler of REC for the PDP-8", Acta Mexicana de Cienciay Tecnologia, Vol. 2, No. 1, Jan-April 1968, pp. 33-43.
• 5: Navlakha, J.K., "Verification of Information in a file", Accepted for presentation at the National Computer Conference 1980 at Anaheim.
• 6: William A. Wulf, A case against the GOTO, Proceedings of the ACM annual conference, p.791-797, August 01-01, 1972, Boston, Massachusetts, United States [doi>10.1145/800194.805861]
• 7: W. A. Wulf , D. B. Russell , A. N. Habermann, BLISS: a language for systems programming, Communications of the ACM, v.14 n.12, p.780-790, Dec. 1971 [doi>10.1145/362919.362936]

INDEX TERMS

Keywords:
Semi-structured programming language, Structured programming, Symbol manipulation