newlispfanclub.alh.net

Thanks for the clarification, Neil, and all your sleuthing. That would have flummoxed me a bit too -- good report.

Lutz wrote:I would watch the input parameters and error result of the import function

Exactly. When Neil said "the code that is failing" and "code ... to produce the error", I was thinking to myself, "Well, what *is* the error (message)?" :)

Yeah, np. BTW, regular ol' let works for this example too. (let ((local-even? (lambda (n) (if (= n 0) true (local-odd? (- n 1))))) (local-odd? (lambda (n) (if (= n 0) nil (local-even? (- n 1)))))) (list (local-even? 23) (local-odd? 23))) ;=> (nil true) If you're porting code from Scheme to newLISP, ...

AFAIK, letrec is not needed in newLISP. Take Sitaram's classic example from http://www.ccs.neu.edu/home/dorai/t-y-scheme/t-y-scheme-Z-H-8.html#node_sec_6.1. You would simply use newLISP's letn to do that. (letn ((local-even? (lambda (n) (if (= n 0) true (local-odd? (- n 1))))) (local-odd? (lambda (n...

:)

The TLDR is that newlisp parses 2323abc as two atoms, namely the integer 2323 and the symbol abc. Finally, the primitive number? only reads its first argument (and ignores any additional arguments). So saying
is the same as saying

It's not a bug. 2323 is a number.

Thanks, Lutz!

BTW, when you make a release like this, do you ping the port maintainers of newlisp on the BSDs, or do they have to keep up with the releases by keeping their own eye out for them? Just curious. I've always meant to ask you this.

Thank you, Lutz!

Running 10.6.0 on FreeBSD.

Check this:
But the same calls work in MAIN.
Why?

Lutz explained why this so, not too long ago here: http://www.newlispfanclub.alh.net/forum/viewtopic.php?f=5&t=4553&p=22482#p22482 In short, fn and lambda cannot be symbols in the sense you are using them. If you are trying to build newLISP lambdas in your macro code, then follow Lutz's advice in th...

Yeah, that behavior is baked into newLISP. I have also experienced this problem before also -- where I've misspelled a symbol name and newLISP happily evaluates it to nil. However, I've always been able to detect this error in unit testing; so it hasn't been a problem for me. How to help check for t...

In newLISP, lexical symbol is declare with *let*, *letn*, *letex* and *args expression*. No. You are misusing the term "lexical". In Perl parlance, it means "static(ally) scope(d)." This also means "lexically scoped." Now, the problem is that you are comparing apples to oranges, as newLISP "variabl...

Also I see Kanen's point about what is said in the manual about it. From http://www.newlisp.org/downloads/newlisp_manual.html#json-parse: All data types conforming to the ECMA-262 standard are translated. In turn, the ECMA-262 standard here says There are only two Boolean values, true and false. The...

You need to reserve nil for newLISP when lookup fails I thought that's what exp-default was for. From http://www.newlisp.org/downloads/newlisp_manual.html#lookup: syntax: (lookup exp-key list-assoc [int-index [exp-default]]) ... Optionally, exp-default can be specified, which is returned if an asso...

Here's another attachment of code. This contains the code from the previous post with a few additions. Everything you can do with parents and ancestors ("deep parents") in the former code, you can now do with children and descendants ("deep children") also. I also added some comments showing example...

I'd use FOOP. After all, FOOP "objects" are just lists (and using only lists was one of your requirements). Anyway, it seems like a natural choice. So, here's a walk through a FOOP implementation. First some preliminaries. (BTW, I always seem to use mappend , and this time was no different.) (define...

If I design a function, need call other function which also call this function. How to Decalare it: . . . What you wrote (or what ryuo wrote) is the basic idea. It is OK because the calls of sub-1 and sub-2 in the bodies of the functions (lambdas) only get resolved during call time. For instance, t...

psilwen, Are you suggesting that newLISP allow the user to enter a number of arbitrary length (as input) and then parse and store the internal representation of the number (as an exact representation of the input, i.e. arbitrarily large)? AFAIK, no programming language allows this. There are always ...

Just a quick note FYI. For another topic in the fanclub, I needed to build 10.6.2. I was on one of my FreeBSD machines, so I did the build there. Bottom line is that it builds without an issue. There was only one change I had to make for the build. This: $ make should now be this: $ make CC=clang be...

Hello psilwen, Most of these issues you raise are not issues at all in version 10.6.2. I recommend you download and build that version on your machine and repeat these examples. I've done just that and I only recall this one example still being an issue. >$ ./newlisp newLISP v.10.6.2 64-bit on BSD I...

Thank you, psilwen and Lutz!

Thanks, Lutz!

Looks like that could be made into a nice lookup table. It's easy to see the pronounced vowel sounds (in the code) and count them. That count should equal the syllable count. Nice find, Ralph!

Kanen, To answer your question, no. But, assuming you mean English words and you want a purely algorithmic approach, it looks like the best you can do it is by heuristic. The first (highest voted answer) on this stackoverflow post has a link to the TeX hyphenation algorithm. That looks pretty promis...

Just use (args) . (Other lisps call them rest args.) > (define (my-silly-func) (cons 'op (args))) (lambda () (cons 'op (args))) > (map my-silly-func '(1 2 3)) ((op 1) (op 2) (op 3)) > (map my-silly-func '(1 2 3) '(4 5 6)) ((op 1 4) (op 2 5) (op 3 6)) > (map my-silly-func '(1 2 3) '(4 5 6) '(7 8 9)) ...