Search found 14 matches

by ebie
Wed Mar 02, 2011 11:20 pm
Forum: Common Lisp
Topic: Retrieving code from implementation
Replies: 2
Views: 1184

Re: Retrieving code from implementation

nuntius wrote:Does your editor use any *~ or #*# files for backups?


Why yes it does. :oops:

Thanks Nuntis
by ebie
Wed Mar 02, 2011 9:23 pm
Forum: Common Lisp
Topic: Retrieving code from implementation
Replies: 2
Views: 1184

Retrieving code from implementation

I had an accident and a lost a file I had loaded into SBCL from my editor :cry: .
Is it possible to retrieve the code from the still running implementation and dribble it back to a text file?

Thanks!
by ebie
Wed Jul 07, 2010 1:01 pm
Forum: The Lounge
Topic: L-99: Ninety-Nine Lisp Problems
Replies: 3
Views: 5900

Re: L-99: Ninety-Nine Lisp Problems

Yes. Sorry, should have been a little more specific.

They built steadily from one to the next right up until problem 50 (Huffman Coding).
by ebie
Wed Jul 07, 2010 8:56 am
Forum: The Lounge
Topic: L-99: Ninety-Nine Lisp Problems
Replies: 3
Views: 5900

L-99: Ninety-Nine Lisp Problems

I was wondering what others thought about these exercises. There doesn't seem to be much discussion about them. Are they worthwhile? Has anyone worked them all? I'm asking because I've reached the binary tree section and my solutions are getting really ugly. Without the solutions to learn from (they...
by ebie
Mon Jul 05, 2010 10:27 am
Forum: Common Lisp
Topic: Connect 4 in lisp
Replies: 2
Views: 2166

Re: Connect 4 in lisp

Finished this a couple days after my original post (way back in December), but wanted to get some input. Ruthless criticism welcome. Thanks for your time. ;;;Connect4 (setf b1 (make-array '(6 7) :initial-element nil)) ;empty board. (setf *num-connect* 4) ;number connected to win. ; up right up-right...
by ebie
Tue Dec 22, 2009 1:49 pm
Forum: Common Lisp
Topic: Connect 4 in lisp
Replies: 2
Views: 2166

Re: Connect 4 in lisp

I'm finishing up a connect 4 project and was wondering if anyone would be willing to critique it. I don't really know how to program, so I know I'm doing some of it all wrong. Thanks.
by ebie
Tue Nov 03, 2009 12:48 pm
Forum: Common Lisp
Topic: Shortest Universal Turing Machine Implementation
Replies: 10
Views: 7575

Re: Shortest Universal Turing Machine Implementation

I see. So, practically speaking, in order to really be able to use just these primitives, one would need to add SETQ, and if you wanted lexical scoping, LET. I suppose LAMBDA as well, for convenience sake. ...scheme added additional features for handling variables, like lexical scope and a single na...
by ebie
Mon Nov 02, 2009 10:58 am
Forum: Common Lisp
Topic: Shortest Universal Turing Machine Implementation
Replies: 10
Views: 7575

Re: Shortest Universal Turing Machine Implementation

So, to name a value using only these primitives I would use defun like this?

(defun x () 10)
by ebie
Sat Oct 31, 2009 9:22 pm
Forum: Common Lisp
Topic: Shortest Universal Turing Machine Implementation
Replies: 10
Views: 7575

Re: Shortest Universal Turing Machine Implementation

methusala wrote: ; Assumes only quote, atom, eq, cons, car, cdr, cond.
So, this means that defun, quote, atom, eq, cons, car, cdr, and cond are the bare minimum constructs in Common Lisp?
by ebie
Thu Oct 08, 2009 8:57 pm
Forum: Common Lisp
Topic: Shortest Universal Turing Machine Implementation
Replies: 10
Views: 7575

Shortest Universal Turing Machine Implementation

I'm new to programming and have been reading up on fundamental programming theory. So, Turing machines are the first thing I stumble upon. I believe I understand on a very basic level the idea of a Universal Turing Machine (what it is and how it works, it's significance, etc.). I became intrigued by...