2 ms·
Kind of reminds me of something I was subjected to in another life, called LSE (a frenchified BASIC) [1][2]. Here's an example: * Quelques déclarations
by ur-whale 7y ago
Kind of reminds me of something I was subjected to in another life, called LSE (a frenchified BASIC) [1][2].
Here's an example:
* Quelques déclarations
* Suivies d'une boucle
BOOLEEN A←.VRAI.,B←.FAUX.
ENTIER U,W,X←200
NOMBRE PI←3.14159
CHAINE CHN
TABLEAU DE ENTIER TBL[3,3]
QUEUE DE CHAINE Q[8]
ENSEMBLE DE NOMBRE NPREMIER←{1.0,2.0,3.0,7.0}
CHN←'Salut'
X ← SELON X ALORS 1,2,3,7,11 SINON 0
POUR U←0 JUSQUA 2 FAIRE
POUR W←0 JUSQUA 2 FAIRE
TBL[U,W]←X
BOUCLER
BOUCLER
TERMINER
Needless to say, the thing was an absolute dead-end.
The only thing I still feel it had going for it is that assignment to variables were done via the ← sign and not the dreaded '=' so common to modern languages.
[1] https://en.wikipedia.org/wiki/LSE_(programming_language) https://en.wikipedia.org/wiki/LSE_(programming_language)
[2] https://fr.wikipedia.org/wiki/LSE_(langage) https://fr.wikipedia.org/wiki/LSE_(langage)