 | | H8 & unaligned word accesses
|
|
I discovered an interesting "feature" of the H8 series processors used in the RCX. It will only affect people using raw H8 code on the RCX, such as those of us using LegOS, and perhaps pbforth. The H8 does not support unaligned word accesses. If you (...) (28 years ago, 11-May-99, to lugnet.robotics)
|
| |
 | | RE: H8 & unaligned word accesses
|
|
(...) Right you are Matt. This created a bit of trouble when I was porting the original pbFORTH code over to the H8. I THINK this is because the H8 core is extensible to a full 16 bit machine - or even 32. The "8" in H8 is a misnomer except at the (...) (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: 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)
|
| |
 | | RE: H8 & unaligned word accesses
|
|
(...) Brian, how does the rest of the Hitachi H8 line stack up? Up until now, I have been using Motorola exclusively, except for the odd PIC design and even a 4 bit NEC 75000 series design!!! The Hitachi gnu chain seems pretty decent, even the (...) (28 years ago, 11-May-99, to lugnet.robotics)
|
| |
 | | Re: Scheme
|
|
From: Joel Shafer <joel@connect.net> (...) exists (...) (URL) my view Scheme is the most useful subset of lisp, designed to make a small, elegant, functional language. This is compared to Common Lisp, which is kind of a superset of the various (...) (28 years ago, 11-May-99, to lugnet.robotics)
|
| |
 | | RE: Would-be hacker queries.
|
|
(...) You are right, but recursion carries a terrible price in terms of stack usage. Most recursion is useful for implementing search and traversal algorithms, but unless the hardware supports DEEP stacks for the worst case, the problem is almost (...) (28 years ago, 11-May-99, to lugnet.robotics)
|
| |
 | | RE: Would-be hacker queries.
|
|
It's too bad that recursion pays the price of stack usage. Recursion is almost always a more elegant solution and is more easily maintained. But as it is, recursion should only be used when you know that the worst case scenario won't overflow the (...) (28 years ago, 11-May-99, to lugnet.robotics)
|
| |
 | | Re: Would-be hacker queries. / Re: Request for new list
|
|
Ah, er, right. I forgot that bit. I was sorta in a hurry to get to class and I didn't elaborate my example. My bad. You're quite right. (...) (28 years ago, 11-May-99, to lugnet.robotics)
|
| |
 | | FW: Forward of pbFORTH debug sessions
|
|
-----Original Message----- From: news-gateway@lugnet.com [mailto:news-gateway...ugnet.com] On Behalf Of Ralph Hempel Sent: Tuesday, May 11, 1999 12:36 PM To: lugnet.robotics.rcx....lugnet.com Subject: Forward of pbFORTH debug sessions John Cooper (...) (28 years ago, 11-May-99, to lugnet.robotics)
|
| |
 | | Re: Scheme
|
|
It strikes me that Scheme is largely an academic language. Granted, there are a few Scheme devotees out there who worship the language, but they seem to be all at MIT or Rice. I think they've even written modules for web programming with Scheme, but (...) (28 years ago, 11-May-99, to lugnet.robotics)
|
| |
 | | RE: Would-be hacker queries. (fwd)
|
|
----- Forwarded message from Joel Shafer ----- Date: Tue, 11 May 1999 10:50:14 -0500 From: Joel Shafer <joel@connect.net> Subject: RE: Would-be hacker queries. Searching and replacing is a good example of recursion. Suppose that you are editing a (...) (28 years ago, 11-May-99, to lugnet.robotics)
|
| |
 | | RE: Would-be hacker queries. (fwd)
|
|
I'm afraid you are wrong. That is exactly what it does. The result of the first replacement is dependent on the result of the second replacement which is dependant on the result of the third replacement ... It is exactly like the factorial example (...) (28 years ago, 11-May-99, to lugnet.robotics)
|
| |
 | | RE: Would-be hacker queries. (fwd)
|
|
----- Forwarded message from Joel Shafer ----- Date: Tue, 11 May 1999 12:24:13 -0500 From: Joel Shafer <joel@connect.net> Subject: RE: Would-be hacker queries. (fwd) I'm afraid you are wrong. That is exactly what it does. The result of the first (...) (28 years ago, 11-May-99, to lugnet.robotics)
|
| |
 | | Re: Would-be hacker queries.
|
|
(...) The factorial is useful for probability. The factorial is a simple, understandable example of recursion, useful to teach the concept; it is lacking only in that it is not very efficient. But when you are first learning, I think concepts are (...) (28 years ago, 11-May-99, to lugnet.robotics)
|
| |
 | | Re: Would-be hacker queries.
|
|
(...) You know, a 'bot that actually solves a Towers of Hanoi puzzle with real plates and whatnot would be a pretty cool challenge on hardware like the RCX. (ponder, ponder, ponder)... I don't think it's possible with anything less than LegOS or (...) (28 years ago, 11-May-99, to lugnet.robotics)
|