REC/SM: a semi structured programming language

Authors:
Jainendra K. Navlakha
Affiliations:
Florida International University, Miami, Florida
Venue:
ACM-SE 18 Proceedings of the 18th annual Southeast regional conference
Year:
1980

Citing 5
Cited 0

Structured Programming with go to Statements

ACM Computing Surveys (CSUR)
BLISS: a language for systems programming

Communications of the ACM
Flow diagrams, turing machines and languages with only two formation rules

Communications of the ACM
CONVERT

Communications of the ACM
A case against the GOTO

ACM '72 Proceedings of the ACM annual conference - Volume 2

Quantified Score

Hi-index	0.00

Visualization

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.