Table of Contents
Advertisement
3.5
Intercompatibility between LAD, CSF and STL
General
Each o f t h e methods o f representa-
t i o n i n t h e STEP 5 programming
languages has s p e c i f i c p r o p e r t i e s
and l i m i t a t i o n s .
Consequently, a program b l o c k w r i t t e n
i n STL cannot s i m p l y be d i s p l a y e d as
an LAD o r CSF and t h e g r a p h i c methods
of representation, LAD and CSFy may
n o t always be f u l l y compatible.
I n o t h e r words, one form cannot a l -
ways be t r a n s l a t e d back i n t o t h e
other form.
I f t h e program has been e n t e r e d as
F i g . 7: Range and l i m i t a t i o n s o f t h e
an LAD o r CSF,
i t
can always be t r a n s -
methods o f r e p r e s e n t a t i o n i n t h e
l a t e d back i n t o STL form.
STEP 5 programming language
I n p u t
Output
The aim o f t h i s s e c t i o n i s t o e s t a b l i s h
a number o f r u l e s , which, i f adhered to,
w i l l ensure complete c o m p a t i b i l i t y be-
tween t h e t h r e e methods o f r e p r e s e n t a t i o n .
These r u l e s are c l a s s i f i e d as f o l l o w s :
-
Rules f o r c o m p a t i b i l i t y between t h e
graphic methods o f r e p r e s e n t a t i o n
(LAD and CSF)
.
I f these r u l e s are followed, i n p u t i s
p o s s i b l e i n one graphic f o r m and d i s p l a y
i n t h e others.
F i g . 8: Graphic i n p u t
I nput
Output
-
Rules f o r c o m p a t i b i l i t y between t h e
statement l i s t and t h e g r a p h i c methods
o f representat ion.
If these r u l e s are observed, i t i s
p o s s i b l e t o e n t e r a program i n any i f
t h e t h r e e methods o f r e p r e s e n t a t i o n ,
graphic o r not, and t o have i t d i s -
played i n t h e o t h e r two forms.
F i g . 9: I n p u t i n t h e f o r m o f a statement l i s t
Advertisement
Table of Contents
