simon/beowulf
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Much progress, but bad regression in parsing M-Expressions.

Browse source
This commit is contained in:
Simon Brooke 2023-04-09 20:51:36 +01:00
parent 1dbc57efff
commit cde3d79ff3
No known key found for this signature in database
GPG key ID: A7A4F18D1D4DF987
44 changed files with 451 additions and 347 deletions
Download patch file Download diff file Expand all files Collapse all files

15
doc/lisp1.5.md
View file

@ -2816,13 +2816,14 @@ Note that the following M-expression is different from that given in Section I,
the result is the same.
```
sublis[x;y] [null[x] -- y;
null[y] -- y;
T -. search[x;
k[[j]; equal[y;caar[j]]];
k[[j]; cdar[j]];
k[[j];[atom[y] - y;
T -c cons [sublis [x;car [y]];sublis [x;cdr [y]]]]]]]
sublis[x;y] = [null[x] -> y;
null[y] -> y;
T -> search[x;
lambda[[j]; equal[y;caar[j]]];
lambda[[j]; cdar[j]];
lambda[[j]; [atom[y] -> y;
T -> cons[sublis[x; car[y]];
sublis[x; cdr[y]]]]]]]
```
### List Handling Functions

4
doc/values.md
View file

@ -1,4 +1,6 @@
# The properties of the system, and their values: here be dragons
# The properties of the system, and their values
## here be dragons
Lisp is the list processing language; that is what its name means. It processes data structures built of lists - which may be lists of lists, or lists of numbers, or lists of any other sort of data item provided for by the designers of the system.