From ... From: Erik Naggum Subject: Re: Finite state mashines in LISP Date: 1999/09/26 Message-ID: <3147299366337458@naggum.no>#1/1 X-Deja-AN: 529591164 References: mail-copies-to: never X-Complaints-To: usenet@news.eunet.no X-Trace: oslo-nntp.eunet.no 938310569 8670 195.0.192.66 (26 Sep 1999 01:49:29 GMT) Organization: Naggum Software; +47 8800 8879; +1 510 435 8604; http://www.naggum.no NNTP-Posting-Date: 26 Sep 1999 01:49:29 GMT Newsgroups: comp.lang.lisp * Mohamed Noamany | Is there any representation of finite state machines (automata) in LISP. | ayny advice is highly appreciated, the usual way to write them is with PROG, utilizing tags for the state names, and GO to effect state transitions. despite the shudder that some people feel for this way to write code, the important thing to remember with PROG in Common Lisp is that tags can only be specified at elements in the list of forms in the PROG form itself, i.e., no tags at any lower level. this fact means that the usual problems with "goto" are avoided. #:Erik