• Corpus ID: 14362269

Micro Spitbol

@article{Dewar2013MicroS,
  title={Micro Spitbol},
  author={Robert B. K. Dewar and Martin Charles Golumbic and Clinton F. Goss},
  journal={ArXiv},
  year={2013},
  volume={abs/1308.6096}
}
MACRO SPITBOL (1) is a compiler/ interpreter for a variant of SNOBOL4 (3), SPITBOL (4), which has been implemented on a variety of large computers. MICRO SPITBOL is an adaptation of the system for use on micro and minicomputers which compiles a language identical to MACRO SPITBOL with the exclusion of real arithmetic. The goal was to preserve the structure and machine independence of the system while allowing for the added constraints imposed by small computers, particularly the severe… 

Figures from this paper

Machine Code Optimization - Improving Executable Object Code
TLDR
This dissertation explores classes of compiler optimization techniques that are applicable late in the compilation process, after all executable code for a program has been linked and reports on improvements gained when optimizing production software.

References

SHOWING 1-10 OF 12 REFERENCES
Macro SPITBOL—a SNOBOL4 compiler
A fast and compact compiler/interpreter for SPITBOL (a variant of SNOBOL4) has been written in a machine‐independent macro assembly language and implemented initially on the ICL 1900 range of
The Design and Analysis of Computer Algorithms
TLDR
This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
A Characterization of Comparability Graphs and of Interval Graphs
Let < be a non-reflexive partial ordering defined on a set P. Let G(P, <) be the undirected graph whose vertices are the elements of P, and whose edges (a, b) connect vertices for which either a < b
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
TLDR
This paper presents ways for constructing efficient algorithms for finding a minimum coloring, a minimum covering by cliques, a maximum clique, and a maximum independent set given a chordal graph.
Algorithms for a maximum clique and a maximum independent set of a circle graph
TLDR
Efficient algorithms for finding a maximum clique and a maximum independent set of circle graphs that require at most n3 steps, where n is the number of vertices in the graph.
SNOBOL4 Compiler', Software – Practice and Experience
  • SNOBOL4 Compiler', Software – Practice and Experience
  • 1977
The SNOBOL4 Programming Language, Second Edition
  • 1971
The SNOBOL4 Programming LanguageSPITBOL Version 2.0', IIT Internal Report, 78 ppA linear pattern matching algorithm
  • Courant Institute of Mathematical Sciences, No. 012. 6) SPD 20/20 Multi -station Intelligent Terminal System – System Description MS-7233.6. 8) Incoterm SPD Assembly Language
  • 1970
...
...