Or you might have more luck with parser-combinators.regexp. I'm pretty
sure that implements group caputure correctly.
On Sat, Jan 17, 2009 at 11:09 AM, Daniel Ehrenberg micro...@gmail.com wrote:
Regexp group caputure hasn't been fully debugged yet. You should try
using some other parsing
Hi,
When I try to load /extra/webkit-demo/webkit-demo.factor, I get
Warning: no such C type: String
It happens both on PPC and Intel Mac. Have I overlooked something?
/Jon
--
This SF.net email is sponsored by:
Hi all,
I created a Wiki page with Google summer of code ideas, so far its just a stub:
https://concatenative.org/wiki/view/Factor/GSoC/2009
I need your help fleshing it out and adding more ideas. Let's put
together a really detailed proposal this time: last year we didn't get
accepted bcause
On Sun, Jan 18, 2009 at 6:09 AM, Daniel Ehrenberg micro...@gmail.com wrote:
Regexp group caputure hasn't been fully debugged yet. You should try
using some other parsing mechanism, like pegs. Hopefully this will be
fixed soon.
For peg.ebnf it would look something like:
em123/em [EBNF rule=em
I'm interested in PEG parsers, as the implementation for the language
Lua is impressively fast. When I saw that factor had a PEG parser
library included, I was curious to see how it would compare. As a
performance test, I tried to implement a search for the word Omega
in the text of the King James
On Sat, Jan 17, 2009 at 4:33 PM, Paul Moore p.f.mo...@gmail.com wrote:
3. Is there a good example anywhere of how to write a high-performance
bytecode interpreter in factor, which I could use as a guide to
implementing the Lua algorithm in factor (my experience so far says
that this isn't
