2011-05-06 03:27, Andrew Garrett skrev:
On Thu, May 5, 2011 at 3:21 AM, Andreas Jonsson
andreas.jons...@kreablo.se wrote:
2011-05-04 08:13, Tim Starling skrev:
On 04/05/11 15:52, Andreas Jonsson wrote:
The time it takes to execute the code that glues together the regexps
2011-05-04 08:41, Domas Mituzas skrev:
Ohi,
The time it takes to execute the code that glues together the regexps
will be insignificant compared to actually executing the regexps for any
article larger than a few hundred bytes.
Well, you did an edge case - a long line. Actually, try
, doesn't it? Regexp pattern matching are
implemented by native functions. Does the Zend engine have a slow
regexp implementation? I would have guessed that the main reason that
the parser is slow is the algorithm, not its implementation.
Best Regards,
Andreas Jonsson
Hi,
I'm not sure what you are profiling, but when repeatingly requesting a
preview of an article containing 20 bytes of data consisting of the
pattern a a a a a a I got the below results. (The php parser doesn't
seem to depend on perl regexps.)
CPU: CPU with timer interrupt, speed 0 MHz
2011-05-03 22:50, Domas Mituzas skrev:
Hi!
I'm not sure what you are profiling,
Wikipedia :)
but when repeatingly requesting a
preview of an article containing 20 bytes of data consisting of the
pattern a a a a a a I got the below results. (The php parser doesn't
seem to depend
2011-05-03 13:25, Daniel Friesen skrev:
On 11-05-03 03:40 AM, Andreas Jonsson wrote:
2011-05-03 02:38, Chad skrev:
[...]
I don't see any problem with keeping the parser in PHP, and as you point out
with HipHop support on the not-too-distant horizon the complaints about
performance with Zend
2010-12-29 08:33, Andrew Dunbar skrev:
I've thought a lot about this too. It certainly is not any type of
standard grammar. But on the other hand it is a pretty common kind of
nonstandard grammar. I call it a recursive text replacement grammar.
Perhaps this type of grammar has some useful
2010-09-27 20:05, Ashar Voultoiz skrev:
On 27/09/10 19:42, Aryeh Gregor wrote:
snip
:: we've had various people trying to replace MediaWiki's parser
with a more conventional one since like 2003, and it's never produced
anything usable in practice.
JeLuF wrote a token based parser
2010-09-27 20:58, Chad skrev:
On Mon, Sep 27, 2010 at 1:42 PM, Aryeh Gregor
simetrical+wikil...@gmail.com wrote:
On Mon, Sep 27, 2010 at 3:38 AM, Andreas Jonsson
andreas.jons...@kreablo.se wrote:
Point me to one that has.
Maybe I'm wrong. I've never looked at them
2010-09-27 22:46, Paul Houle skrev:
On 9/27/2010 2:58 PM, Chad wrote:
This. Tim sums up the consensus very well with that commit summary.
He also made some comments on the history of wikitext and alternative
parsers on foundation-l back in Jan '09[0]. Worth a read (starting mainly
at
Hi,
I have written a parser for MediaWiki syntax and have set up a test
site for it here:
http://libmwparser.kreablo.se/index.php/Libmwparsertest
and the source code is available here:
http://svn.wikimedia.org/svnroot/mediawiki/trunk/parsers/libmwparser
A preprocessor will take care of parser
2010-09-23 11:34, Bryan Tong Minh skrev:
Hi,
Pretty awesome work you've done!
On Thu, Sep 23, 2010 at 11:27 AM, Andreas Jonsson
andreas.jons...@kreablo.se wrote:
I think that this demonstrates the feasability of replacing the
MediaWiki parser. There is still a lot of work to do
2010-09-23 14:56, Krinkle skrev:
Op 23 sep 2010, om 14:47 heeft Andreas Jonsson het volgende geschreven:
2010-09-23 14:17, Krinkle skrev:
Op 23 sep 2010, om 14:14 heeft Andreas Jonsson het volgende
geschreven:
2010-09-23 11:34, Bryan Tong Minh skrev:
Hi
13 matches
Mail list logo
