[XML-DEV Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message] Re: Seeking FSM for XML
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
|
PURCHASE STYLUS STUDIO ONLINE TODAY!Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced! Download The World's Best XML IDE!Accelerate XML development with our award-winning XML IDE - Download a free trial today! Subscribe in XML format
|