|
|
Re: [xml-dev] Seeking FSM for XML
|
[
Lists Home |
Date Index |
Thread Index
]
Damn that Bermuda Triangled then!
But wont this FSM contain possibilities of valid and invalid state? So
how does that play with knowledge of the rules of the grammer, with
just being a parser, in effect?
Adam
On 12/04/06, Rick Jelliffe <rjelliffe@allette.com.au> wrote:
Mukul Gandhi said:
> A finite state machine (FSM) or finite automaton is a model of
> behavior composed of states, transitions and actions.
>
> Refering to
http://en.wikipedia.org/wiki/Finite_state_machine, I can
> represent FSM as a XML for the door example as follows
>
> <fsm>
> <state name="opened">
> <entryaction name="open door" />
> <condition name="close door" tostate="closed" />
> </state>
> <state name="closed">
> <entryaction name="close door" />
> <condition name="open door" tostate="opened" />
> </state>
> </fsm>
>
> Do you have something like this in mind?
Err no, exactly wrong. I want an FSM for parsing XML. A DFA for parsing XML.
I want the grammar of XML expressed in a state machine form. I want an
automaton for lexing well-formed XML. (Not the grammar for XML. Not an XML
document type for FSMs.)
For example, Tim Bray used one for generating the original Lark parser
code, but it isnt included in the Lark distribution.
Cheers
Rick Jelliffe
-----------------------------------------------------------------
The xml-dev list is sponsored by XML.org <
http://www.xml.org>, an
initiative of OASIS <http://www.oasis-open.org>
The list archives are at http://lists.xml.org/archives/xml-dev/
To subscribe or unsubscribe from this list use the subscription
manager: <http://www.oasis-open.org/mlmanage/index.php>
|
|
|
|
|
|