Category Archives: XPath

  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 … Continue reading →

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 →

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 →

A formal grammar is an abstract structure that describes a formal language precisely: i.e., a set of rules that mathematically delineates a (usually infinite) set of finite-length strings over a (usually finite) alphabet. A formal language is a set of finite-length character … Continue reading →

The million dollar question is… Should a construction which consists of a simple option like “ABBB” | “CBBB” have a parse table that compresses and merges the last sequence of states into common groups? http://www.metawrap.com/tests/dot/test12.png In the same way that the start sequence … Continue reading →

http://www.metawrap.com/tests/dot/test9.png Minimal testcase for simplest production I could think of – with an at that un unhandled visitor type. (now implemented of course). The wonderful thing about applying such a complicated visitor pattern to this type of problem is that even though the first type … Continue reading →

I have defined a new module for MetaWrap which consists of 4 Logical groups of classes. MwParser, MwParserBNF* and MwParserCST and MwParserAST. All the new W3 Specs seem to be heading towards shared definitions using BNF. (eh XQuery, XPath2.0 and XSLT2.0) . … Continue reading →

Parsing And Protocols There are really two types of information packing in protocols and grammars and these boil down to data being length or lexically delimited. A parser implements a certain grammar. The grammar parses a certain pattern of tokens … Continue reading →