1-d languagesmulti-d languagehp visualisationsstructure templatesrecord declarationseasy-draw...

1-D languages Multi-D language HP Visualisations Structure Templates Record declarations Easy-draw pics Active templates 3-layer architecture


Programming in Several DimensionsProgramming in Several Dimensions

Paul Lyons

Massey University


Textual Languages are One-Textual Languages are One-dimensionaldimensional

Computers are sequential.

Input devices

Output devices

Memory addresses

Accumulator

Buses

Parsers

Flow of controlSequential syntax

Tree-structured semantics

DeclarationsTree-structured

Inverted w.r.t. procedures

I/OAsynchronous

How about programs?


Computers Support Multi-Computers Support Multi-dimensionalitydimensionality

Power

Easy 2-D input

High-res 2-D and 3-D graphic output

Multiple window support

Synchronous updating

Hyperlinks


A Multi-dimensional LanguageA Multi-dimensional Language

Desiderata

Multiple viewsNon-sequential access

Easy editingEfficient space use

High-level

Mid-levelControl relationships

Text where appropriateGraphics where appropriate

Low-levelGroup related concepts

Purge brackets


HyperPascalHyperPascal

VisualisationsAction Tree Scope Treehyperlinks

Subprog



VisualisationsAction Tree Scope Treehyperlinks

Subprog

main progsubprog2subprog3



VisualisationsScope Treehyperlinks

Subprog

Action Treemain progsubprog2subprog3

in1 realin2 real

out1 out2 out3

stringstringboolean

Subprog

var1var2

stringinteger

Action Tree



VisualisationsScope Treehyperlinks

Subprog

Action Tree

A<3

average

sum/9X+7 B

names“John”

“, ”& &

“Jenna”

Main prog

subprog1

subprog3 subprog3

subprog1



Structure Template VisualisationPictorial notationDot-and-caret notation

new(newNode);newNode^.data := x;if L = nil then begin L := newNode^.next := L; newNode; endelse begin parent := nil; thisNode := L; status := running; while status = running do begin if (thisNode^.data > x) or (thisNode = nil)_then begin newNode^.next := thisNode; if parent = nil then L := newNode else parent^.next := newNode; status = finished; end {then clause} else begin parent := thisNode; thisNode := thisNode^.next; end {if}; end;

end;


new(newNode);newNode^.data := x;if L = nil then begin L := newNode^.next := L; newNode; endelse begin parent := nil; thisNode := L; status := running; while status = running do begin if (thisNode^.data > x) or (thisNode = nil)_then begin newNode^.next := thisNode; if parent = nil then L := newNode else parent^.next := newNode; status = finished; end {then clause} else begin parent := thisNode; thisNode := thisNode^.next; end {if}; end;

end;



new(newNode);newNode^.data := x;if L = nil then begin newNode^.next := L; L := newNode; endelse begin {L isn’t nil} parent := nil; thisNode := L; status := running; while status = running do begin if (thisNode^.data > x) or (thisNode = nil)_then begin newNode^.next := thisNode; if parent = nil then L := newNode else parent^.next := newNode; status = finished; end {then clause} else begin {the node goes somewhere else} parent := thisNode; thisNode := thisNode^.next; end {if}; end;end;

thisNode := L;parent := nil;


new(newNode);newNode^.data := x;if L = nil then begin newNode^.next := L; L := newNode; endelse begin {L isn’t nil} parent := nil; thisNode := L; status := running; while status = running do begin if (thisNode^.data > x) or (thisNode = nil)_then begin newNode^.next := thisNode; if parent = nil then L := newNode else parent^.next := newNode; status = finished; end {then clause} else begin {the node goes somewhere else} parent := thisNode; thisNode := thisNode^.next; end {if}; end;end;

parent := thisNode; thisNode := thisNode^.next;


Ltop

Ltop



new(newNode);newNode^.data := x;if L = nil then begin L := newNode^.next := L; newNode; endelse begin parent := nil; thisNode := L; status := running; while status = running do begin if (thisNode^.data > x) or (thisNode = nil) then begin newNode^.next := thisNode; if parent = nil then L := newNode else parent^.next := newNode; status = finished; end {then clause} else begin parent := thisNode; thisNode := thisNode^.next; end {if}; end;

end;

>x

L L

x

L

x

top top

L

top top

<=x

L

toptop

<=x

L

top toptopL

x

>x

L

top top



Pictorial declarations


LL


Easy-to-draw pictures

LL




LL




LL

>x




LL

>x

x

toptop


Ltop

Ltoptoptop



L

x

>x

L

top topif thisNode <> nil then

if thisNode^.data > x then {generate after-picture1}

top

<=x

L

toptop

<=x

L

top

else {thisNode <> nil and thisNode^.data <=x}

{generate after-picture 2}else {thisNode = nil}

L

x

toptop

L

top

{generate after-picture 3}



Three-layer architectureConcrete

(distorted) view

abstract (undistorted)

view

Semantic (parse tree)

view

Concrete (distorted)

view

Concrete (distorted)

view

Draw commands User actions

Object association informationRedraw messages

(undistorted coordinates) (undistorted coordinates)

(coordinate-free)(coordinate-free)



FIN


names

“John”

“Jenna”

“, ”&

&


L

x

top


top

L

top

if L <> nil then

if L^.data > x then {generate after-picture1}

else {L^.data <=x} {generate after-picture 2}

if L <> nil then

if L^.data > x then {generate after-picture1}

else {L^.data <=x} {generate after-picture 2}

else {L = nil}

if thisNode <> nil then

if thisNode^.data > x then {generate after-picture1}

else {thisNode^.data <=x} {generate after-picture 2}

else {thisNode = nil} {generate after-picture 3}


1-d languagesmulti-d languagehp visualisationsstructure templatesrecord declarationseasy-draw...

Documents

end slide

thisnode thisnode

d input highres

nil thisnode

newnode status

data x

finished end

appropriate graphics