Category Archives: Parsing Theory

A Brief History Of Parsing

The primary goal a parser is to organize a sequence of tokens based on the rules of a formal language. As the parser accepts a sequence of tokens, it determines, based on this information, when the grammar’s respective rules are … Continue reading

Posted in Parsing Theory, XPath | Leave a comment

Creating A Scanner From A Given Input Grammar – The Current State Of The Art

I’m trawling through conventional theory at the moment to see if my approach shows up on the radar anywhere – if it does then I can probably get some hints and tips on what could make it better or if … Continue reading

Posted in Parsing Theory | 2 Comments

Finite State Automata – The State Of The Art

[Rescued from the old blog – Thanks to Damian] I’m trawling through conventional theory at the moment to see if my approach shows up on the radar anywhere – if it does then I can probably get some hints and … Continue reading

Posted in MetaWrap Server, Parsing Theory | 7 Comments

Grammar Visualiser – Part II

http://documentation.metawrap.com/tests/dot/test3.png (generated automagically) http://documentation.metawrap.com/tests/dot/test.png (the original target plan) It lurches into being. I’m thinking that I may have to write this with MwW3ParserLexerState being the node instead of the current plan for MwW3ParserLexerStateGroup. The issue at hand is that a MwW3ParserLexerStateGroup can consist … Continue reading

Posted in Parsing Theory, XPath | 1 Comment

New (Old) 21" Monitor And New Test Cases

I am now dual headed. We will see how it goes. I have the G4 and PC second display on the second monitor. The G4 stays up as long as I don’t move much. (Long Story) Testing all the basic … Continue reading

Posted in Meta-Narrative, My Hardware, Parsing Theory | Leave a comment

Grammar Visualiser – Part III

Its pretty obvious from this failed experiment that my original plan was the correct one. http://set-top.net/tests/dot/test7.png By associating an exact description of the potential state, but then using transitions wrt. the group of states, I’ve created something that makes logical sense … Continue reading

Posted in Parsing Theory, XPath | Leave a comment

Parsers Progress – Convergence

[Rescued from the old blog – Thanks to Damian] The algorithm and data structure are designed to build a near optimal deterministic finite state automata for a regular language with a single pass, unlike the current three pass ‘Thompson Process’. But even I was … Continue reading

Posted in MetaWrap Server, Parsing Theory | Leave a comment