Lmst

#DSSP

"Probably it is the first English paper about DSSP"

#DSSP #retrocomputing #retrodev #programming #setun #setun70

Sidorov S.A. (MSU), Shumakov M.N. (NIISI RAN)
DSSP AND FORTH. COMPARE ANALYSIS

1. HISTORY
DSSP (Dialog System for Structured Programming) was
created in the laboratory of Brousentsov N.P. at the Computer
science department of the Moscow State University in 1980,
contemporary version - in 1985, 32-bit version - in 1989.

Genealogy: Setun-70 ----- Forth
|
DSSP

Setun-70 is a ternary minicomputer with a two-stack
architecture. From it DSSP inherited control constructions and the basic idea: programming without a semantic gap.
From Forth DSSP inherited the idea of vocabulary and the method of notation of procedures between ":" and ";" . The ideologist of DSSP, d-r. Brousentsov was educated as mathematician. He has theoretical works in the fields of logic and computer architecture.
And he had a big experience in the computer industry as an architect and constructor of ternary computers Setun and Setun-70.
In 1980 he was not young men (55) and worked as a theorist and leader of a project. The code of DSSP is created mainly by students and postgraduate students of Moscow university. After 1991 the majority of them works in other fields, DSSP-activities decreased.

A Fibonacci algorithm implementation in DSSP.

$PROGRAM $FIB \ Define variables to store Fibonacci numbers FIX VAR A 0 ! A \ First Fibonacci number FIX VAR B 1 ! B \ Second Fibonacci number FIX VAR T 0 ! T \ Temporary variable for calculation \ Calculate and print the Nth Fibonacci number : FIB1 [n] IF+ FIB-CALC .D CR [] ; \ If n > 0, calculate : FIB-CALC [n] C 1- IF+ FIB-ITER [] ; \ If n > 1, iterate : FIB-ITER [n] 0 ! A 1 ! B \ Initialize A=0, B=1 [n] 1- DO NEXT-FIB [] ; \ Loop n-1 times : NEXT-FIB [] B ! T A B + ! B T ! A [] ; \ Calculate next Fibonacci number \ Calculate and print Fibonacci sequence up to N : FIBSEQ [n] IF+ FIBSEQ-CALC [] ; \ If n > 0, calculate sequence : FIBSEQ-CALC [n] 0 ! A 1 ! B \ Initialize A=0, B=1 0 .D CR \ Print first number (0) [n] 1- IF+ B .D CR FIBSEQ-ITER [] ; \ If n > 1, print 1 and continue : FIBSEQ-ITER [n] [n] 1- DO PRINT-NEXT [] ; \ Loop n-2 times : PRINT-NEXT [] B ! T A B + ! B T ! A B .D CR [] ; \ Calculate and print next number \ Help information : HELP [] CR ." FIB1 [n] - Calculate and print the Nth Fibonacci number" CR ." FIBSEQ [n] - Print Fibonacci sequence up to N terms" CR ." Example: 10 FIB1 - prints the 10th Fibonacci number" CR ." Example: 8 FIBSEQ - prints the first 8 Fibonacci numbers" CR [] ; HELP \ Display help information when program is loaded$

DSSP (Dialog System for Structured Programming)

http://brokestream.com/daf.txt

"DSSP was created in the laboratory of Brousentsov N.P. at the Computer science department of the Moscow State University in 1980, contemporary version - in 1985, 32-bit version - in 1989."

"Setun-70 is a ternary minicomputer with a two-stack architecture. From it DSSP inherited control constructions and the basic idea: programming without a semantic gap."

"Brousentsov was educated as mathematician. He has theoretical works in the fields of logic and computer architecture.
And he had a big experience in the computer industry as an architect and constructor of ternary computers Setun and Setun-70."

#DSSP #SETUN #Forth #programming #retrodev #retrocomputing

Client Info

Server: https://mastodon.social

Version: 2025.07

Repository: https://github.com/cyevgeniy/lmst