As much as I want to look at that I want to pass or fail this one on my
own.. Otherwise I'm just cheating myself...
On 9 November 2010 16:27, namekuseijin wrote:
> On Tue, Nov 9, 2010 at 6:50 PM, Peter Breitsprecher
> wrote:
> > Ok, here is the exact assignment.
> >
> > Tiny Scheme Details: Th
On Tue, Nov 9, 2010 at 6:50 PM, Peter Breitsprecher
wrote:
> Ok, here is the exact assignment.
>
> Tiny Scheme Details: The Scheme or LISP that you are going to implement
> should include the following primitives:
hey, it's you lucky day! Tiny Scheme is implemented already and is an
open-source
On Nov 9, 2010, at 12:50 PM, Peter Breitsprecher wrote:
> Ok, here is the exact assignment.
Blecch, I don't like this assignment :).
Based on the text, it appears that your professor wants you to do both parsing
and evaluation. And some GUI stuff. Glug.
Here's what I'd do: since your profes
Ok, here is the exact assignment.
*
*
*Tiny Scheme Details**:* The Scheme or LISP that you are going to implement
should include the following primitives:
*T, NIL, CAR, CDR, CONS, ATOM, EQ, NULL, INT,*
*PLUS, MINUS, TIMES, LESS, GREATER COND, QUOTE, DEFINE.*
T and NIL represent true and false.
On Nov 9, 2010, at 12:32 PM, Peter Breitsprecher wrote:
> Ok, here is the code I have written so far for the function I am having
> trouble with...
I'm also a bit curious: does your assignment say anything about using or not
using 'read' ?
John Clements
smime.p7s
Description: S/MIME crypto
On Nov 9, 2010, at 12:32 PM, Peter Breitsprecher wrote:
> Ok, here is the code I have written so far for the function I am having
> trouble with...
>
> (define (rep-loop)
> (newline)
> (display "repl>")
> (read-token))
I'm going to ignore rep-loop.
>
> (define (read-token)
> (let ((e
Ok, here is the code I have written so far for the function I am having
trouble with...
(define (rep-loop)
(newline)
(display "repl>")
(read-token))
(define (read-token)
(let ((expr (read-char)))
((cond [(char-whitespace? expr) (read-token1)]
[(eq? expr #\() (read-token2)]
On Nov 9, 2010, at 12:27 PM, Peter Breitsprecher wrote:
> I'd lie but no.. I was just trying to clarify what I was looking for. I gave
> a the code for one of the functions I had written, and then an example of the
> input the user is giving below, and then tried to describe in more detail
>
I'd lie but no.. I was just trying to clarify what I was looking for. I
gave a the code for one of the functions I had written, and then an example
of the input the user is giving below, and then tried to describe in more
detail what I needed help with...
On 9 November 2010 15:23, Shriram Krishna
Hi,
That would not be considered an "example" for at least two reasons. Do you
see why?
On Nov 9, 2010 12:17 PM, "Peter Breitsprecher"
wrote:
As an example, I want have most of the functions for Plus, Minus already
written.
Here is the code for it.
(define (plus num1 num2)
(+ num1 num2))
Tha
As an example, I want have most of the functions for Plus, Minus already
written.
Here is the code for it.
(define (plus num1 num2)
(+ num1 num2))
That is childs stuff... Here is where I am having the problem, and please
keep in mind I am new to DrRacket...
If my program accepts input such as
On Nov 9, 2010, at 11:48 AM, Peter Breitsprecher wrote:
> I am in the process of writing a simple scheme interpreter for a class I
> have. I am running into an issue with regards to parsing the input properly.
> I will try and explain what I want to do and tell me if I am way off base or
> n
I am in the process of writing a simple scheme interpreter for a class I
have. I am running into an issue with regards to parsing the input
properly. I will try and explain what I want to do and tell me if I am way
off base or not. I have a procedure set up to read the input from the
user. Whic
13 matches
Mail list logo
