search for: parsestr

...ode from TableGen. It is also trivial to merge identical parsers before generating them, which means there's no code size explosion. Here's an example of what this would generate. ArgParseResult parseJoinedOrSeperate(const ArgParseState APS) { return parseOr(parseJoined("", parseStr(0)), parseSeperate(parseStr(0)))(APS); } Each parse* function is a template function which creates a function object that implements that parser with the given arguments. The integer argument for parseStr tell it which Argument value slot to put it in. This is based on v0 from...

...also > trivial to merge identical parsers before generating them, which means there's > no code size explosion. Here's an example of what this would generate. > > ArgParseResult parseJoinedOrSeperate(const ArgParseState APS) { > return parseOr(parseJoined("", parseStr(0)), > parseSeperate(parseStr(0)))(APS); > } > > Each parse* function is a template function which creates a function object that > implements that parser with the given arguments. The integer argument for > parseStr tell it which Argument value slot to put it...

While doing some embedded programming and trying to figure out how to generate a hand coded SEXP equivalent of the line "t.test(x,conf.level=(1-p))$conf.int[2]" I had an idea for an addition to the embedded API. There are a number of hidden or static parse functions (R_ParseBuffer, R_Parse1Buffer, etc.) which take an IoBuffer* and returns a parsed tree. If one or more of these