Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| infinite state machines karthik@cdotd.ernet.in (1999-10-21) |
| Re: infinite state machines jfflorio@acm.org (J. Florio) (1999-10-21) |
| Re: infinite state machines qjackson@wave.home.com (Quinn Tyler Jackson) (1999-10-21) |
| Re: infinite state machines bourguet@my-deja.com (1999-10-27) |
| Re: infinite state machines chstapfer@bluewin.ch (Christian Stapfer) (1999-10-27) |
| Re: infinite state machines mac@coos.dartmouth.edu (1999-10-27) |
| Re: infinite state machines scorp@btinternet.com (1999-10-28) |
| From: | "J. Florio" <jfflorio@acm.org> |
| Newsgroups: | comp.compilers |
| Date: | 21 Oct 1999 22:02:21 -0400 |
| Organization: | Compilers Central |
| References: | 99-10-104 |
| Keywords: | DFA |
Just speculating: "Finite" meaning there are a finite number of states
that the machine can take. In compiler construction FSM's have
application in syntax (and some cases) semantic analysis of the input
statements (at least as I recall, it's one of the major applications).
Various data structures make it easy to automate generation of part of
the compiler through the application of FSM's. That gets a little
messy if you have an infinite number of states that you're trying to
represent in a machine that has a finite amount of storage. 8-)
- Jack Florio
karthik@cdotd.ernet.in wrote:
> If we have finite state machines, is it possible to have 'infinite'
> state machines. Does anybody know of any web site or book or paper
> which explains something about this? I tried searching in Altavista
> but got very little. One web site just mentioned that 'infinite state
> machines are conceivable but not practical'. Can somebody explain?
Return to the
comp.compilers page.
Search the
comp.compilers archives again.