Hi,
https://ci.inria.fr/moose/job/petitparser/
Or PBE2 says:
Gofer new
smalltalkhubUser: 'Moose' project: 'PetitParser';
package: 'ConfigurationOfPetitParser';
load.
(Smalltalk at: #ConfigurationOfPetitParser) perform: #loadDefault.
Hope it helps, I use the first option.
Cheers,
Jan
On Thu,
Hi,
Anyone experience with Athens can help with the first issue?
TRLabelShapedrawOn: seem to be somehow responsible, but I don't see into
this :(
Regarding to the second issue, there are some cases, when one really needs
a start rule, e.g when computing follow. Yet I updated the code so that it
You mean deep into pharo? Or something else? I can do this...
On 21 December 2014 at 13:27, stepharo steph...@free.fr wrote:
Could one of you write a small paragraph for the petit parser chapter?
Le 18/12/14 09:07, Jan Kurš a écrit :
Exactly...
This happens so often that we should add
Hi,
PetitParser2 [1] supports parsing of streams. I have been experimenting
with ZnClient and come up with the following solution:
1) Create a PP2 stream from ZnClient stream:
byteStream := ZnClient new
url: 'http://pharo.org';
streaming: true;
get.
stream := PP2CharacterStream on:
Hi, not sure if I understand your requirement, but you can try:
Y not, chars star
Is this what you need?
Cheers Jan
On Sun, Aug 6, 2017, 04:47 Sean P. DeNigris wrote:
> vonbecmann wrote
> > did you try with negate?
>
> That is the standard trick with PP, but the
I run PP2 on travis [1], seems Pharo 6.1 loads all configurations, both on
linux and mac. Pharo 5, Pharo 6.0 got broken, why is build configuration so
hard :'( I don't know, how can I support you. I myself had to gave up on
some tools, because I failed to load them.
There is no specific reason to
HI Steffen,
Thanks for the report, number pleases me :)
Speaking of tool for porting, I was recently showed this one, I don't have
any experience with it:
https://github.com/ObjectProfile/Pharo2VW
Speaking of character ranges, there is currently available:
#letter asPParser (to recognize
#memoized is one of the most efficient and hardest optimizations. It cannot
be done efficiently in an automated way. It depends on input. Best way is
to identify repeated invocation of the same parser combinator at the same
position for a typical input, pp2 has a tooling support for this, I wrote