Raph,

      Our emails crossed.  I now found the link that you recommended.
Thank you very much.

                                            Craig


On 3/20/07, Craig Ugoretz <[EMAIL PROTECTED]> wrote:

Raph,

         I looked at the supplemental website, but am having trouble
locating the source code for Solve.  I especially looked at the section
titled "Mozart System Supplements".  Additionally, I may be able to
implement what I want to do strictly through Ch. 9.  I beg this mailing
list's indulgence as I talk about constraints, computation spaces, and other
topics without full knowledge of the foundations.  I see that there is an
EBNF parser in Ch.9 and I want to investigate if it may be useful in
setting up a production grammar.  There is certainly a lot to learn and
absorb.

                                                                  Craig


 On 3/20/07, Craig Ugoretz <[EMAIL PROTECTED]> wrote:
>
> Raph,
>
>        No, I have not.  I will give it a try.
>
>                                                            Thanks,
>                                                            Craig
>
>
>  On 3/20/07, Raphael Collet <[EMAIL PROTECTED] > wrote:
> >
> > Craig,
> >
> > Solve is not defined by Mozart.  Have you picked the definition of
> > Solve
> > that is provided on the book's supplement web site?
> >
> > raph
> >
> >
> > Craig Ugoretz wrote:
> > > Hello,
> > >
> > >      I have an idea how to generate test data for a parser that I
> > may
> > > need to create for a Java based parser generator.  This process
> > > would involve using what I have learned about relational programming
> > in
> > > the CTM book.  However, I am running into a problem with the program
> > > blocking on the {Solve F} construct in a sample program that I have
> > > created.  The program should print out the following strings:  ab,
> > ac,
> > > ba, bc, ca, cb.  The code for the program is given below:
> > >
> > >
> > > declare
> > > fun {Pick} choice a [] b [] c end end
> > >
> > > fun {DiffPair}
> > >    P1 P2
> > > in
> > >    P1 = {Pick}
> > >    P2 = {Pick}
> > >    if P1==P2 then fail else P1#P2 end
> > > end
> > >
> > > fun {SolveAll F}
> > >    L={Solve F}
> > >    proc {TouchAll L}
> > >       if L==nil then skip else {TouchAll L.2} end
> > >    end
> > > in
> > >    {TouchAll L}
> > >    L
> > > end
> > >
> > > {Browse {SolveAll DiffPair}}
> > 
_________________________________________________________________________________
> >
> > mozart-users mailing list
> > [email protected]
> > http://www.mozart-oz.org/mailman/listinfo/mozart-users
> >
>
>

_________________________________________________________________________________
mozart-users mailing list                               
[email protected]
http://www.mozart-oz.org/mailman/listinfo/mozart-users

Reply via email to