added tests as prepared by oliver

test/ref/wf1.c

@@ -0,0 +1,132 @@
+/*
+  !!DESCRIPTION!! print word frequencies; uses structures
+  !!ORIGIN!!      LCC 4.1 Testsuite
+  !!LICENCE!!     own, freely distributeable for non-profit. read CPYRIGHT.LCC
+*/
+
+#include <stdlib.h>
+#include <stdio.h>
+#include <string.h>
+#include <ctype.h>
+
+#define MAXWORDS 250
+
+struct node
+{
+	int count;		/* frequency count */
+	struct node *left;	/* left subtree */
+	struct node *right;	/* right subtree */
+	char *word;		/* word itself */
+} words[MAXWORDS];
+int next;		/* index of next free entry in words */
+
+/*struct node *lookup();*/
+
+#if defined(NO_NEW_PROTOTYPES_FOR_OLD_FUNC_DECL) && !defined(NO_OLD_FUNC_DECL)
+
+#else
+
+int err(char *s);
+int getword(char *buf);
+void tprint(struct node *tree);
+struct node *lookup(char *word, struct node **p);
+
+#endif
+
+int isletter(char c);
+
+/* err - print error message s and die	*/
+#ifndef NO_OLD_FUNC_DECL
+err(s) char *s; {
+#else
+int err(char *s) {
+#endif
+	printf("? %s\n", s);
+	exit(1);
+}
+
+/* getword - get next input word into buf, return 0 on EOF */
+#ifndef NO_OLD_FUNC_DECL
+int getword(buf) char *buf;
+#else
+int getword(char *buf)
+#endif
+{
+	char *s;
+	int c;
+
+        while (((c = getchar()) != -1) && (isletter(c) == 0))
+		;
+        for (s = buf; (c = isletter(c)); c = getchar())
+		*s++ = c;
+	*s = 0;
+	if (s > buf)
+		return 1;
+	return 0;
+}
+
+/* isletter - return folded version of c if it is a letter, 0 otherwise */
+int isletter(char c)
+{
+	if ((c >= 'A') && (c <= 'Z')) c += 'a' - 'A';
+	if ((c >= 'a') && (c <= 'z')) return c;
+	return 0;
+}
+
+/* lookup - lookup word in tree; install if necessary */
+#ifndef NO_OLD_FUNC_DECL
+struct node *lookup(word, p)
+char *word; struct node **p;
+#else
+struct node *lookup(char *word, struct node **p)
+#endif
+{
+	int cond;
+/*	char *malloc(); */
+
+	if (*p) {
+		cond = strcmp(word, (*p)->word);
+		if (cond < 0)
+			return lookup(word, &(*p)->left);
+		else if (cond > 0)
+			return lookup(word, &(*p)->right);
+		else
+			return *p;
+	}
+	if (next >= MAXWORDS)
+		err("out of node storage");
+	words[next].count = 0;
+	words[next].left = words[next].right = 0;
+	words[next].word = malloc(strlen(word) + 1);
+	if (words[next].word == 0)
+		err("out of word storage");
+	strcpy(words[next].word, word);
+	return *p = &words[next++];
+}
+
+/* tprint - print tree */
+#ifndef NO_OLD_FUNC_DECL
+void tprint(tree) struct node *tree; {
+#else
+void tprint(struct node *tree) {
+#endif
+	if (tree) {
+		tprint(tree->left);
+		printf("%d:%s\n", tree->count, tree->word);
+		tprint(tree->right);
+	}
+}
+
+int main(void)
+{
+	struct node *root;
+	char word[20];
+
+	root = 0;
+	next = 0;
+	while (getword(word))
+		lookup(word, &root)->count++;
+	tprint(root);
+
+        return 0;
+}