To LUGNET HomepageTo LUGNET News HomepageTo LUGNET Guide Homepage
 Help on Searching
 
Post new message to lugnet.roboticsOpen lugnet.robotics in your NNTP NewsreaderTo LUGNET News Traffic PageSign In (Members)
 Robotics / *11471 (+5)
  Re: Scheme
 
Could you give a brief description of scheme? I've heard that it is a fairly high level language and I know that a compiler or interpreter exists for it on linux. (...) -- Did you check the web site first?: (URL) (28 years ago, 11-May-99, to lugnet.robotics)
 
  RE: Would-be hacker queries. (fwd)
 
----- Forwarded message from JR Conlin ----- Date: Tue, 11 May 1999 07:46:20 -0700 From: JR Conlin <jrconlin@email.com> Subject: RE: Would-be hacker queries. You know, I have never really liked the factorial example of recursion. Honestly, how many (...) (28 years ago, 11-May-99, to lugnet.robotics)
 
  RE: Would-be hacker queries.
 
(...) problem. (...) You know, I have never really liked the factorial example of recursion. Honestly, how many times have you really needed to generate a factorial in general experience? I feel a better example is building stuff with LEGO. In this (...) (28 years ago, 11-May-99, to lugnet.robotics)
 
  RE: H8 & unaligned word accesses
 
(...) I am currently using the H8S/2144 processor at work. The above statement is totally correct - the H8 series is directly compatible with the 16-bit H8S series. Because the H8S is a true 16 bit processor, internal memory is always accessed as a (...) (28 years ago, 11-May-99, to lugnet.robotics)
 
  RE: Would-be hacker queries.
 
Searching and replacing is a good example of recursion. Suppose that you are editing a document and want to replace every occurrence of the word "the" with the word "then". Here is one way that the program could handle it. Function (...) (28 years ago, 11-May-99, to lugnet.robotics)

Next Page:  5 more | 10 more | 20 more
Redisplay Messages:  All | Compact

©2005 LUGNET. All rights reserved. - hosted by steinbruch.info GbR