| dstrings.html | 26Feb09 09:35:08EST | 39K | The Dynamic-Strings glossary. |
| smodel.html | 04Feb05 15:50:39EST | 26K | A dynamic strings model. |
| dstrings.fs | 21Nov08 10:42:39EST | 47K | ANS Forth implementation of the Dynamic-Strings word set. |
| ../pfe/dstrings/ | C implementation, pfe DSTRINGS-EXT environment. | ||
| dstrings-words.txt | 02Sep08 14:26:58EDT | 2.6K | Functional listing of words in dstrings.fs and pfe DSTRINGS-EXT environment. |
| dstester.fs | 09Sep04 09:34:00EDT | 4.9K | Hayes-style basic tester for dstrings-test.fs. |
| dstrings-test.fs | 02Oct08 11:52:11EDT | 20K | Test program for dstrings.fs or the pfe DSTRINGS-EXT environment. Loads dstester.fs. |
| trydstrings.fs | 04Sep08 14:56:10EDT | 4.6K | Another test program for dstrings.fs or the pfe DSTRINGS-EXT environment. |
| dstring-utils.fs | 26Apr09 14:22:32EDT | 5.3K | A library of dynamic string utilities, including number and date concatenations. Loads dstrings.fs by default, with the pfe DSTRINGS-EXT environment as an alternataive. |
| dstring-utils-test.fs | 28Feb09 11:29:10EST | 4.9K | Hayes tests for dstrings-utils.fs. Loads ttester.fs. |
| dstring-array.fs | 30Mar07 10:35:29EDT | 3.6K | Arrays for dynamic strings. Loads dstrings.fs by default, but there's a PFE switch. |
| parsing.fs | 22Mar09 10:17:30EDT | 24K | A parsing library for ANS Forth strings, represented on the data stack by (addr len), and the input stream. A consolidation of old words of ours, with some from Wil Baden's ToolBelt and other sources. |
| ../pfe/parsing/ | C implementation as a pfe external module. | ||
| parsing-words.txt | 27Feb09 10:56:53EST | 2.2K | Functional listing of the words in parsing.fs and the corresponding pfe module, with a description of the naming policy. |
| parsing-test.fs | 22Mar09 10:15:34EDT | 24K | Hayes-style tests for the string parsing words in parsing.fs and parsing-ext.c. Loads ttester.fs. |
| mstrings-srep.fs mstrings-cat.fs mstrings-store.fs mstrings-comma.fs mstrings-linput.fs mstrings-0end.fs |
27Aug08 13:19:03EDT 22Nov08 07:33:20EST 27Aug08 13:25:44EDT 27Aug08 13:25:03EDT 26Aug08 21:33:20EDT 26Aug08 21:33:35EDT |
2.0K 2.6K 2.3K 2.5K 7.9K 2.3K |
A collection of mostly small libraries for safe string storage with concatenation, using a cell-counted memory representation. They take off from the PLACE family of words in Wil Baden's ToolBelt, and include words for storing from the input stream across lines. Each one loads any of the others it needs, and any subset can be loaded in any order. The mstrings-linput.fs library loads all the others, and also parsing.fs, or the pfe module built from parsing-ext.c as an alternative. |
| mstrings.txt | 26Feb09 09:07:21EST | 16K | Documentation and detailed glossaries for the mstring libraries. |
| mstrings-test.fs | 20Nov08 16:37:27EST | 14K | Hayes-style tests for the mstring libraries. Loads ttester.fs. |
| pattern.fs | 30Jul04 12:11:16EDT | 12K | Wil Baden's code to enable argument expansion for simple string macros. |
| sarray.fs | 30Mar07 13:03:21EDT | 3.4K | ANS Forth string arrays, with coalesced bodies. |
| expr.html | 24Apr09 21:11:24EDT | 34K | Parsing algorithms for source to source translation of Veltman's AAma (Ann Arbor macro assembler, M680x0) numerical and address expressions (not really restricted to AAma), including Backus-Naur form (bnf) parser code generation. |
| bnaut.fs | 23Aug08 11:56:05EDT | 22K | ANS Forth automatic code generator for bnf's. Loads dstrings.fs, parsing.fs, and xstacks.fs, all of which are self-contained. Works with pfe and gforth. A PFE switch can be turned on to use pfe external C modules instead. |
| bnaut.out | 09Feb07 10:33:25EST | 3.8K | Parser generator examples output. |
| aexpr.fs | 09Mar07 11:59:08EST | 2.7K | Source for AAma address expression grammar bnf generation. |
| aexpr.out | 09Mar07 11:59:41EST | 1.8K | AAma address expression grammar bnf generation output. The version we actually use is edited to break up long lines. |
| fstrings/ | Some historical string development in Forth. |
| logs/ |
Files in this directory under the GNU LGPL typically have a POLITENESS request.