Subject: Re: Finite state mashines in LISP
From: Erik Naggum <>
Date: 1999/09/26
Newsgroups: comp.lang.lisp
Message-ID: <>

* 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.