From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM autolearn=unavailable autolearn_force=no version=3.4.4 Path: border1.nntp.dca1.giganews.com!nntp.giganews.com!newspeer1.nac.net!newsfeed.xs4all.nl!newsfeed4a.news.xs4all.nl!xs4all!news.stack.nl!aioe.org!.POSTED!not-for-mail From: =?utf-8?Q?Yannick_Duch=C3=AAne_=28Hibou57?= =?utf-8?Q?=29?= Newsgroups: comp.lang.ada Subject: Re: Ada platforms and pricing, was: Re: a new language, designed for safety ! Date: Thu, 26 Jun 2014 05:24:47 +0200 Organization: Ada @ Home Message-ID: References: <5ebe316d-cd84-40fb-a983-9f953f205fef@googlegroups.com> <2100734262424129975.133931laguest-archeia.com@nntp.aioe.org> <5156oy7vhg99.17wu6q2ef45ke.dlg@40tude.net> <18et97c0c22vc$.y98lxxfblijn.dlg@40tude.net> <08f83f70-ccb1-45ec-8a4c-46e3442745b8@googlegroups.com> NNTP-Posting-Host: 0gipH8doFnFjPXlWycyiNg.user.speranza.aioe.org Mime-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed; delsp=yes Content-Transfer-Encoding: Quoted-Printable X-Complaints-To: abuse@aioe.org User-Agent: Opera Mail/12.16 (Linux) X-Notice: Filtered by postfilter v. 0.8.2 Xref: number.nntp.dca.giganews.com comp.lang.ada:187247 Date: 2014-06-26T05:24:47+02:00 List-Id: Le Mon, 23 Jun 2014 22:14:13 +0200, Dmitry A. Kazakov = a =C3=A9crit: > On Mon, 23 Jun 2014 12:21:11 -0700 (PDT), Dan'l Miller wrote: > >> On Monday, June 23, 2014 12:14:24 PM UTC-5, Dmitry A. Kazakov wrote: >>> On Mon, 23 Jun 2014 12:17:38 +0100, Simon Wright wrote: >>>> "Dmitry A. Kazakov" writes: >>>>> Programming a state machine is turning all design upside down. If >>>>> there were user-defined task support one could program this as if = it >>>>> were in proper tasks. >>> >>>> I find it easier to think about state machines as state machines = >>>> rather >>>> than by encoding them using the program counter! I geuss it depends= on >>>> your starting point. >> >> In the spirit of lambasting the lack of direct representation of >> finite-state machines (FSMs) in Ada: > > Egh? Ada lacks nothing for programming FSM. It has: > > 1. gotos and labels > 2. access to subprogram type > 3. dispatching Yes, labels, except the syntax of labels in (on purpose?) so ugly it = prevent it's frequent use. =E2=80=9CState_Foo:=E2=80=9D is more intuitive less ugly than =E2=80=9C<= >=E2=80=9D. The =E2=80=9Cgoto=E2=80=9D = statement is luckily fine. When I say it's ugly, that's because there is= = too much garbage around the label and the label name does not come first= = (there is the =E2=80=9C<<=E2=80=9D before it). This syntax would be OK for an emphasis, but within a state machine, one= = often have many labels and it's not a good idea to make them all looks = like emphases. -- = =E2=80=9CSyntactic sugar causes cancer of the semi-colons.=E2=80=9D [1] =E2=80=9CStructured Programming supports the law of the excluded muddle.= =E2=80=9D [1] [1]: Epigrams on Programming =E2=80=94 Alan J. =E2=80=94 P. Yale Univers= ity