with
>>> an incremental query engine, such as EMF/CDO with Viatra or
>>> something similar. You could then put different character sets in
>>> connected objects and query only as far as you need to.
>>> Andrew Glynn
>>> Sent from
.
Andrew Glynn
Sent from Mail <https://go.microsoft.com/fwlink/?LinkId=550986> for
Windows 10
*From: *Thierry Goubier <mailto:thierry.goub...@gmail.com>
*Sent: *Tuesday, November 7, 2017 7:17 AM
*To: *Any question about pharo is welcome
<mailto:pharo-users@list
ttps://go.microsoft.com/fwlink/?LinkId=550986> for
Windows 10
*From: *Thierry Goubier <mailto:thierry.goub...@gmail.com>
*Sent: *Tuesday, November 7, 2017 7:17 AM
*To: *Any question about pharo is welcome
<mailto:pharo-users@lists.pharo.org>
*Subject: *Re:
could then put different character sets in connected
>objects and query only as far as you need to.
>
>Andrew Glynn
>
>Sent from Mail for Windows 10
>
>From: Thierry Goubier
>Sent: Tuesday, November 7, 2017 7:17 AM
>To: Any question about pharo is welcome
>Subject: Re: [Pha
10
From: Thierry Goubier
Sent: Tuesday, November 7, 2017 7:17 AM
To: Any question about pharo is welcome
Subject: Re: [Pharo-users] Binary Decision Diagram Package in Smalltalk
Hi Andrew, Steffen,
2017-11-07 13:10 GMT+01:00 Prof. Andrew P. Black :
> On 28 Oct 2017, at 17:37 , Steffen Märc
Hi Andrew, Steffen,
2017-11-07 13:10 GMT+01:00 Prof. Andrew P. Black :
>
> > On 28 Oct 2017, at 17:37 , Steffen Märcker wrote:
> >
> > Does that mean the sets/bdd would be constructed mainly at comile time?
> Anyway, Andrew, feel free to contact me, I might help you with this.
> >
>
> Thanks for
> On 28 Oct 2017, at 17:37 , Steffen Märcker wrote:
>
> Does that mean the sets/bdd would be constructed mainly at comile time?
> Anyway, Andrew, feel free to contact me, I might help you with this.
>
Thanks for the offer, Steffen! The problem is that I need to use SmaCC for my
current proj
Thanks I think that the sets will be known since the scanner
definition should not changed once defined.
Now andrew told me that he could use an existing solution but not
build one because he should make progress on his compiler.
But Steffen if you know how to build such package it would be a nice
Does that mean the sets/bdd would be constructed mainly at comile time?
Anyway, Andrew, feel free to contact me, I might help you with this.
Best, Steffen
Am .10.2017, 16:05 Uhr, schrieb Stephane Ducasse :
I think that andrew would like to improve smacc when parsing inputs
containing utf-8
specifics of the system and
its current state.
Cheers
Andrew
Sent from Mail for Windows 10
From: Stephane Ducasse
Sent: Saturday, October 28, 2017 10:06 AM
To: Any question about pharo is welcome
Subject: Re: [Pharo-users] Binary Decision Diagram Package in Smalltalk
I think that andrew would
I think that andrew would like to improve smacc when parsing inputs
containing utf-8 characters.
On Sat, Oct 28, 2017 at 1:46 PM, Steffen Märcker wrote:
> I see. What is the task in detail? Are some of the set fixed or known in
> advance? What's the argument against a bitset-based solution?
>
>
I see. What is the task in detail? Are some of the set fixed or known in
advance? What's the argument against a bitset-based solution?
Cheers, Steffen
Am 27. Oktober 2017 19:10:35 MESZ schrieb Stephane Ducasse
:
>It was for test inclusion of UTF-8 characters so we do not want to
>rely on exter
It was for test inclusion of UTF-8 characters so we do not want to
rely on external libraries.
On Fri, Oct 27, 2017 at 1:54 PM, Steffen Märcker wrote:
> Dear Andrew,
>
> I didn't find time to answer earlier. Some time ago, I was looking for a
> (MT)BDD package in ST as well. I didn't found one. S
Dear Andrew,
I didn't find time to answer earlier. Some time ago, I was looking for a
(MT)BDD package in ST as well. I didn't found one. So the only two options
left are
1) implementing a new BDD lib in ST and
2) doing FFI to some existing lib, e.g. CUDD, Sylvan, Jinc
I'd prefer 2) since t
Thanks for the responses so far. I see that I need to clarify my enquiry.
B-Trees and BDDs are not the same. BDDs are an efficient and compact
representations for Boolean functions, sometimes used in SAT-solvers and
electronics design. The key idea is that since the output must be 0 or 1, yo
On Thu, Oct 26, 2017 at 3:39 AM, Stephane Ducasse
wrote:
> Hi andrew
>
> I think that Avi did a package about BDD (but I thought it was special
> binary trees) so this is probably the same.
> Did you check on Squeaksource?
> http://www.squeaksource.com/BTree.html
> If this is what you are looking
Phil presented an Xmpp integration at Pharo days - I understood that was a
common comms mechanism too.
Tim
Sent from my iPhone
> On 25 Oct 2017, at 20:39, Stephane Ducasse wrote:
>
> Hi andrew
>
> I think that Avi did a package about BDD (but I thought it was special
> binary trees) so this
Hi andrew
I think that Avi did a package about BDD (but I thought it was special
binary trees) so this is probably the same.
Did you check on Squeaksource?
http://www.squeaksource.com/BTree.html
If this is what you are looking for I can help porting it to Pharo.
Stef
On Wed, Oct 25, 2017 at 9:0
18 matches
Mail list logo
