diff --git a/doc/gf-history.html b/doc/gf-history.html
index f25dbeec2..c75f2a080 100644
--- a/doc/gf-history.html
+++ b/doc/gf-history.html
@@ -49,6 +49,20 @@ Use pg -printer=vxml.
generated from a multilingual GF grammar. Use pm -printer=js.
+
+
+5/12 (BB) A new tool for generating C linearization libraries
+from a GFCC file. make gfcc2c in src
+compiles the tool. The generated
+code includes header files in lib/c and should be linked
+against libgfcc.a in lib/c. For an example of
+using the generated code, see src/tools/c/examples/bronzeage.
+make in that directory generates a GFCC file, then generates
+C code from that, and then compiles a program bronzeage-test.
+The main function for that program is defined in
+bronzeage-test.c.
+
+
20/11 (AR) Type error messages in concrete syntax are printed with a
diff --git a/lib/c/Makefile b/lib/c/Makefile
new file mode 100644
index 000000000..72ac7ea79
--- /dev/null
+++ b/lib/c/Makefile
@@ -0,0 +1,19 @@
+CC = gcc
+CFLAGS += -O2 -W -Wall
+
+.PHONY: all clean
+
+all: libgfcc.a
+
+libgfcc.a: gfcc-tree.o gfcc-term.o
+ ar r $@ $^
+
+gfcc-tree.o: gfcc-tree.c gfcc-tree.h
+ $(CC) $(CFLAGS) -c -o $@ $<
+
+gfcc-term.o: gfcc-term.c gfcc-term.h
+ $(CC) $(CFLAGS) -c -o $@ $<
+
+clean:
+ -rm -f libgfcc.a
+ -rm -f *.o
diff --git a/lib/c/gfcc-term.c b/lib/c/gfcc-term.c
new file mode 100644
index 000000000..b427479e6
--- /dev/null
+++ b/lib/c/gfcc-term.c
@@ -0,0 +1,203 @@
+#include "gfcc-term.h"
+
+#include
+#include
+#include
+
+static void *buffer = NULL;
+static size_t current;
+
+extern void term_alloc_pool(size_t size) {
+ if (buffer == NULL)
+ buffer = malloc(size);
+ current = 0;
+}
+
+extern void term_free_pool() {
+ if (buffer != NULL)
+ free(buffer);
+ buffer = NULL;
+}
+
+extern void *term_alloc(size_t size) {
+ void *off = buffer + current;
+ current += size;
+ return off;
+}
+
+static inline Term *create_term(TermType type, int n) {
+ Term *t = (Term*)term_alloc(sizeof(Term) + n * sizeof(Term *));
+ t->type = type;
+ t->value.size = n; /* FIXME: hack! */
+ return t;
+}
+
+extern Term *term_array(int n, ...) {
+ Term *t = create_term(TERM_ARRAY, n);
+ va_list ap;
+ int i;
+
+ va_start(ap, n);
+ for (i = 0; i < n; i++) {
+ term_set_child(t, i, va_arg(ap, Term *));
+ }
+ va_end(ap);
+
+ return t;
+}
+
+extern Term *term_seq(int n, ...) {
+ Term *t = create_term(TERM_SEQUENCE, n);
+ va_list ap;
+ int i;
+
+ va_start(ap, n);
+ for (i = 0; i < n; i++) {
+ term_set_child(t, i, va_arg(ap, Term *));
+ }
+ va_end(ap);
+
+ return t;
+}
+
+extern Term *term_variants(int n, ...) {
+ Term *t = create_term(TERM_VARIANTS, n);
+ va_list ap;
+ int i;
+
+ va_start(ap, n);
+ for (i = 0; i < n; i++) {
+ term_set_child(t, i, va_arg(ap, Term *));
+ }
+ va_end(ap);
+
+ return t;
+}
+
+extern Term *term_glue(int n, ...) {
+ Term *t = create_term(TERM_GLUE, n);
+ va_list ap;
+ int i;
+
+ va_start(ap, n);
+ for (i = 0; i < n; i++) {
+ term_set_child(t, i, va_arg(ap, Term *));
+ }
+ va_end(ap);
+
+ return t;
+}
+
+extern Term *term_rp(Term *t1, Term *t2) {
+ Term *t = create_term(TERM_RECORD_PARAM, 2);
+ term_set_child(t, 0, t1);
+ term_set_child(t, 1, t2);
+ return t;
+}
+
+extern Term *term_suffix(const char *pref, Term *suf) {
+ Term *t = create_term(TERM_SUFFIX_TABLE, 2);
+ term_set_child(t,0,term_str(pref));
+ term_set_child(t,1,suf);
+ return t;
+}
+
+extern Term *term_str(const char *s) {
+ Term *t = create_term(TERM_STRING, 0);
+ t->value.string_value = s;
+ return t;
+}
+
+extern Term *term_int(int i) {
+ Term *t = create_term(TERM_INTEGER,0);
+ t->value.integer_value = i;
+ return t;
+}
+
+extern Term *term_meta() {
+ return create_term(TERM_META, 0);
+}
+
+
+
+extern Term *term_sel_int(Term *t, int i) {
+ switch (t->type) {
+ case TERM_ARRAY:
+ return term_get_child(t,i);
+ case TERM_SUFFIX_TABLE:
+ return term_glue(2,
+ term_get_child(t,0),
+ term_sel_int(term_get_child(t,1),i));
+ case TERM_META:
+ return t;
+ default:
+ fprintf(stderr,"Error: term_sel_int %d %d\n", t->type, i);
+ exit(1);
+ return NULL;
+ }
+}
+
+extern Term *term_sel(Term *t1, Term *t2) {
+ switch (t2->type) {
+ case TERM_INTEGER:
+ return term_sel_int(t1, t2->value.integer_value);
+ case TERM_RECORD_PARAM:
+ return term_sel(t1,term_get_child(t2,0));
+ case TERM_META:
+ return term_sel_int(t1,0);
+ default:
+ fprintf(stderr,"Error: term_sel %d %d\n", t1->type, t2->type);
+ exit(1);
+ return 0;
+ }
+}
+
+
+
+static void term_print_sep(FILE *stream, Term *t, const char *sep) {
+ int n = t->value.size;
+ int i;
+
+ for (i = 0; i < n; i++) {
+ term_print(stream, term_get_child(t,i));
+ if (i < n-1) {
+ fputs(sep, stream);
+ }
+ }
+}
+
+extern void term_print(FILE *stream, Term *t) {
+ switch (t->type) {
+ case TERM_ARRAY:
+ term_print(stream, term_get_child(t,0));
+ break;
+ case TERM_SEQUENCE:
+ term_print_sep(stream, t, " ");
+ break;
+ case TERM_VARIANTS:
+ term_print_sep(stream, t, "/");
+ break;
+ case TERM_GLUE:
+ term_print_sep(stream, t, "");
+ break;
+ case TERM_RECORD_PARAM:
+ term_print(stream, term_get_child(t,0));
+ break;
+ case TERM_SUFFIX_TABLE:
+ term_print(stream, term_get_child(t,0));
+ term_print(stream, term_get_child(t,1));
+ break;
+ case TERM_META:
+ fputs("?", stream);
+ break;
+ case TERM_STRING:
+ fputs(t->value.string_value, stream);
+ break;
+ case TERM_INTEGER:
+ fprintf(stream, "%d", t->value.integer_value);
+ break;
+ default:
+ fprintf(stderr,"Error: term_print %d\n", t->type);
+ exit(1);
+ }
+}
diff --git a/lib/c/gfcc-term.h b/lib/c/gfcc-term.h
new file mode 100644
index 000000000..d1307259d
--- /dev/null
+++ b/lib/c/gfcc-term.h
@@ -0,0 +1,65 @@
+#ifndef GFCC_TERM_H
+#define GFCC_TERM_H
+
+#include
+
+typedef enum {
+ /* size = variable */
+ TERM_ARRAY,
+ TERM_SEQUENCE,
+ TERM_VARIANTS,
+ TERM_GLUE,
+ /* size = 2 */
+ TERM_RECORD_PARAM,
+ TERM_SUFFIX_TABLE,
+ /* size = 0 */
+ TERM_META,
+ TERM_STRING,
+ TERM_INTEGER
+} TermType;
+
+struct Term_ {
+ TermType type;
+ union {
+ const char *string_value;
+ int integer_value;
+ int size;
+ } value;
+ struct Term_ *args[0];
+};
+
+typedef struct Term_ Term;
+
+
+
+static inline Term *term_get_child(Term *t, int n) {
+ return t->args[n];
+}
+
+static inline void term_set_child(Term *t, int n, Term *c) {
+ t->args[n] = c;
+}
+
+extern void term_alloc_pool(size_t size);
+extern void term_free_pool();
+extern void *term_alloc(size_t size);
+
+
+extern Term *term_array(int n, ...);
+extern Term *term_seq(int n, ...);
+extern Term *term_variants(int n, ...);
+extern Term *term_glue(int n, ...);
+
+extern Term *term_rp(Term *t1, Term *t2);
+extern Term *term_suffix(const char *pref, Term *suf);
+extern Term *term_str(const char *s);
+extern Term *term_int(int i);
+extern Term *term_meta();
+
+extern Term *term_sel_int(Term *t, int i);
+extern Term *term_sel(Term *t1, Term *t2);
+
+
+extern void term_print(FILE *stream, Term *t);
+
+#endif
diff --git a/lib/c/gfcc-tree.c b/lib/c/gfcc-tree.c
new file mode 100644
index 000000000..6cd8759be
--- /dev/null
+++ b/lib/c/gfcc-tree.c
@@ -0,0 +1,61 @@
+#include "gfcc-tree.h"
+
+#include
+
+
+extern int arity(Tree *t) {
+ switch (t->type) {
+ case ATOM_STRING:
+ case ATOM_INTEGER:
+ case ATOM_DOUBLE:
+ case ATOM_META:
+ return 0;
+ default:
+ return t->value.size;
+ }
+}
+
+static Tree *create_tree(atom_type c, int n) {
+ Tree *t = (Tree *)malloc(sizeof(Tree) + n * sizeof(Tree *));
+ t->type = c;
+ return t;
+}
+
+extern Tree *tree_string(const char *s) {
+ Tree *t = create_tree(ATOM_STRING, 0);
+ t->value.string_value = s;
+ return t;
+}
+
+extern Tree *tree_integer(int i) {
+ Tree *t = create_tree(ATOM_INTEGER, 0);
+ t->value.integer_value = i;
+ return t;
+}
+
+extern Tree *tree_double(double d) {
+ Tree *t = create_tree(ATOM_DOUBLE, 0);
+ t->value.double_value = d;
+ return t;
+}
+
+extern Tree *tree_meta() {
+ return create_tree(ATOM_META, 0);
+}
+
+extern Tree *tree_fun(atom_type f, int n) {
+ Tree *t = create_tree(f, n);
+ t->value.size = n;
+ return t;
+}
+
+
+extern void tree_free(Tree *t) {
+ int n = arity(t);
+ int i;
+
+ for (i = 0; i < n; i++) {
+ tree_free(tree_get_child(t,i));
+ }
+ free(t);
+}
diff --git a/lib/c/gfcc-tree.h b/lib/c/gfcc-tree.h
new file mode 100644
index 000000000..cc8f0fcab
--- /dev/null
+++ b/lib/c/gfcc-tree.h
@@ -0,0 +1,49 @@
+#ifndef GFCC_TREE_H
+#define GFCC_TREE_H
+
+typedef enum {
+ ATOM_STRING,
+ ATOM_INTEGER,
+ ATOM_DOUBLE,
+ ATOM_META,
+ ATOM_FIRST_FUN
+} atom_type;
+
+struct Tree_{
+ atom_type type;
+ union {
+ const char *string_value;
+ int integer_value;
+ double double_value;
+ int size;
+ } value;
+ struct Tree_ *args[0];
+};
+
+typedef struct Tree_ Tree;
+
+static inline Tree *tree_get_child(Tree *t, int n) {
+ return t->args[n];
+}
+
+static inline void tree_set_child(Tree *t, int n, Tree *a) {
+ t->args[n] = a;
+}
+
+extern int arity(Tree *t);
+
+
+extern Tree *tree_string(const char *s);
+
+extern Tree *tree_integer(int i);
+
+extern Tree *tree_double(double d);
+
+extern Tree *tree_meta();
+
+extern Tree *tree_fun(atom_type f, int n);
+
+
+extern void tree_free(Tree *t);
+
+#endif
diff --git a/src/Makefile b/src/Makefile
index f6458543f..856e668a2 100644
--- a/src/Makefile
+++ b/src/Makefile
@@ -112,6 +112,9 @@ clean:
-rm -f $(GFEDITOR)/de/uka/ilkd/key/ocl/gf/*.class
-rm -f gf.wixobj
-rm -f ../bin/$(GF_EXE)
+ $(MAKE) -C tools/c clean
+ $(MAKE) -C ../lib/c clean
+ -rm -f ../bin/gfcc2c
distclean: clean
-rm -f JavaGUI/gf-java.jar jgf
@@ -182,6 +185,12 @@ gfcc:
$(GHMAKE) $(GHCOPTFLAGS) -o gfcc GF/Canon/GFCC/RunGFCC.hs
strip gfcc
mv gfcc ../bin/
+
+gfcc2c:
+ $(MAKE) -C tools/c
+ $(MAKE) -C ../lib/c
+ mv tools/c/gfcc2c ../bin
+
#
# Distribution
#
diff --git a/src/tools/c/GFCC/Abs.hs b/src/tools/c/GFCC/Abs.hs
new file mode 100644
index 000000000..f42447ebb
--- /dev/null
+++ b/src/tools/c/GFCC/Abs.hs
@@ -0,0 +1,227 @@
+{-# OPTIONS_GHC -fglasgow-exts #-}
+module GFCC.Abs (Tree(..), Grammar, Header, Abstract, Concrete, AbsDef, CncDef, Type, Exp, Atom, Term, Tokn, Variant, CId, johnMajorEq, module GFCC.ComposOp) where
+
+import GFCC.ComposOp
+
+import Data.Monoid
+
+-- Haskell module generated by the BNF converter
+
+data Grammar_
+type Grammar = Tree Grammar_
+data Header_
+type Header = Tree Header_
+data Abstract_
+type Abstract = Tree Abstract_
+data Concrete_
+type Concrete = Tree Concrete_
+data AbsDef_
+type AbsDef = Tree AbsDef_
+data CncDef_
+type CncDef = Tree CncDef_
+data Type_
+type Type = Tree Type_
+data Exp_
+type Exp = Tree Exp_
+data Atom_
+type Atom = Tree Atom_
+data Term_
+type Term = Tree Term_
+data Tokn_
+type Tokn = Tree Tokn_
+data Variant_
+type Variant = Tree Variant_
+data CId_
+type CId = Tree CId_
+
+data Tree :: * -> * where
+ Grm :: Header -> Abstract -> [Concrete] -> Tree Grammar_
+ Hdr :: CId -> [CId] -> Tree Header_
+ Abs :: [AbsDef] -> Tree Abstract_
+ Cnc :: CId -> [CncDef] -> Tree Concrete_
+ Fun :: CId -> Type -> Exp -> Tree AbsDef_
+ Lin :: CId -> Term -> Tree CncDef_
+ Typ :: [CId] -> CId -> Tree Type_
+ Tr :: Atom -> [Exp] -> Tree Exp_
+ AC :: CId -> Tree Atom_
+ AS :: String -> Tree Atom_
+ AI :: Integer -> Tree Atom_
+ AF :: Double -> Tree Atom_
+ AM :: Tree Atom_
+ R :: [Term] -> Tree Term_
+ P :: Term -> Term -> Tree Term_
+ S :: [Term] -> Tree Term_
+ K :: Tokn -> Tree Term_
+ V :: Integer -> Tree Term_
+ C :: Integer -> Tree Term_
+ F :: CId -> Tree Term_
+ FV :: [Term] -> Tree Term_
+ W :: String -> Term -> Tree Term_
+ RP :: Term -> Term -> Tree Term_
+ TM :: Tree Term_
+ L :: CId -> Term -> Tree Term_
+ BV :: CId -> Tree Term_
+ KS :: String -> Tree Tokn_
+ KP :: [String] -> [Variant] -> Tree Tokn_
+ Var :: [String] -> [String] -> Tree Variant_
+ CId :: String -> Tree CId_
+
+instance Compos Tree where
+ compos r a f t = case t of
+ Grm header abstract concretes -> r Grm `a` f header `a` f abstract `a` foldr (a . a (r (:)) . f) (r []) concretes
+ Hdr cid cids -> r Hdr `a` f cid `a` foldr (a . a (r (:)) . f) (r []) cids
+ Abs absdefs -> r Abs `a` foldr (a . a (r (:)) . f) (r []) absdefs
+ Cnc cid cncdefs -> r Cnc `a` f cid `a` foldr (a . a (r (:)) . f) (r []) cncdefs
+ Fun cid type' exp -> r Fun `a` f cid `a` f type' `a` f exp
+ Lin cid term -> r Lin `a` f cid `a` f term
+ Typ cids cid -> r Typ `a` foldr (a . a (r (:)) . f) (r []) cids `a` f cid
+ Tr atom exps -> r Tr `a` f atom `a` foldr (a . a (r (:)) . f) (r []) exps
+ AC cid -> r AC `a` f cid
+ R terms -> r R `a` foldr (a . a (r (:)) . f) (r []) terms
+ P term0 term1 -> r P `a` f term0 `a` f term1
+ S terms -> r S `a` foldr (a . a (r (:)) . f) (r []) terms
+ K tokn -> r K `a` f tokn
+ F cid -> r F `a` f cid
+ FV terms -> r FV `a` foldr (a . a (r (:)) . f) (r []) terms
+ W str term -> r W `a` r str `a` f term
+ RP term0 term1 -> r RP `a` f term0 `a` f term1
+ L cid term -> r L `a` f cid `a` f term
+ BV cid -> r BV `a` f cid
+ KP strs variants -> r KP `a` r strs `a` foldr (a . a (r (:)) . f) (r []) variants
+ _ -> r t
+
+instance Show (Tree c) where
+ showsPrec n t = case t of
+ Grm header abstract concretes -> opar n . showString "Grm" . showChar ' ' . showsPrec 1 header . showChar ' ' . showsPrec 1 abstract . showChar ' ' . showsPrec 1 concretes . cpar n
+ Hdr cid cids -> opar n . showString "Hdr" . showChar ' ' . showsPrec 1 cid . showChar ' ' . showsPrec 1 cids . cpar n
+ Abs absdefs -> opar n . showString "Abs" . showChar ' ' . showsPrec 1 absdefs . cpar n
+ Cnc cid cncdefs -> opar n . showString "Cnc" . showChar ' ' . showsPrec 1 cid . showChar ' ' . showsPrec 1 cncdefs . cpar n
+ Fun cid type' exp -> opar n . showString "Fun" . showChar ' ' . showsPrec 1 cid . showChar ' ' . showsPrec 1 type' . showChar ' ' . showsPrec 1 exp . cpar n
+ Lin cid term -> opar n . showString "Lin" . showChar ' ' . showsPrec 1 cid . showChar ' ' . showsPrec 1 term . cpar n
+ Typ cids cid -> opar n . showString "Typ" . showChar ' ' . showsPrec 1 cids . showChar ' ' . showsPrec 1 cid . cpar n
+ Tr atom exps -> opar n . showString "Tr" . showChar ' ' . showsPrec 1 atom . showChar ' ' . showsPrec 1 exps . cpar n
+ AC cid -> opar n . showString "AC" . showChar ' ' . showsPrec 1 cid . cpar n
+ AS str -> opar n . showString "AS" . showChar ' ' . showsPrec 1 str . cpar n
+ AI n -> opar n . showString "AI" . showChar ' ' . showsPrec 1 n . cpar n
+ AF d -> opar n . showString "AF" . showChar ' ' . showsPrec 1 d . cpar n
+ AM -> showString "AM"
+ R terms -> opar n . showString "R" . showChar ' ' . showsPrec 1 terms . cpar n
+ P term0 term1 -> opar n . showString "P" . showChar ' ' . showsPrec 1 term0 . showChar ' ' . showsPrec 1 term1 . cpar n
+ S terms -> opar n . showString "S" . showChar ' ' . showsPrec 1 terms . cpar n
+ K tokn -> opar n . showString "K" . showChar ' ' . showsPrec 1 tokn . cpar n
+ V n -> opar n . showString "V" . showChar ' ' . showsPrec 1 n . cpar n
+ C n -> opar n . showString "C" . showChar ' ' . showsPrec 1 n . cpar n
+ F cid -> opar n . showString "F" . showChar ' ' . showsPrec 1 cid . cpar n
+ FV terms -> opar n . showString "FV" . showChar ' ' . showsPrec 1 terms . cpar n
+ W str term -> opar n . showString "W" . showChar ' ' . showsPrec 1 str . showChar ' ' . showsPrec 1 term . cpar n
+ RP term0 term1 -> opar n . showString "RP" . showChar ' ' . showsPrec 1 term0 . showChar ' ' . showsPrec 1 term1 . cpar n
+ TM -> showString "TM"
+ L cid term -> opar n . showString "L" . showChar ' ' . showsPrec 1 cid . showChar ' ' . showsPrec 1 term . cpar n
+ BV cid -> opar n . showString "BV" . showChar ' ' . showsPrec 1 cid . cpar n
+ KS str -> opar n . showString "KS" . showChar ' ' . showsPrec 1 str . cpar n
+ KP strs variants -> opar n . showString "KP" . showChar ' ' . showsPrec 1 strs . showChar ' ' . showsPrec 1 variants . cpar n
+ Var strs0 strs1 -> opar n . showString "Var" . showChar ' ' . showsPrec 1 strs0 . showChar ' ' . showsPrec 1 strs1 . cpar n
+ CId str -> opar n . showString "CId" . showChar ' ' . showsPrec 1 str . cpar n
+ where opar n = if n > 0 then showChar '(' else id
+ cpar n = if n > 0 then showChar ')' else id
+
+instance Eq (Tree c) where (==) = johnMajorEq
+
+johnMajorEq :: Tree a -> Tree b -> Bool
+johnMajorEq (Grm header abstract concretes) (Grm header_ abstract_ concretes_) = header == header_ && abstract == abstract_ && concretes == concretes_
+johnMajorEq (Hdr cid cids) (Hdr cid_ cids_) = cid == cid_ && cids == cids_
+johnMajorEq (Abs absdefs) (Abs absdefs_) = absdefs == absdefs_
+johnMajorEq (Cnc cid cncdefs) (Cnc cid_ cncdefs_) = cid == cid_ && cncdefs == cncdefs_
+johnMajorEq (Fun cid type' exp) (Fun cid_ type'_ exp_) = cid == cid_ && type' == type'_ && exp == exp_
+johnMajorEq (Lin cid term) (Lin cid_ term_) = cid == cid_ && term == term_
+johnMajorEq (Typ cids cid) (Typ cids_ cid_) = cids == cids_ && cid == cid_
+johnMajorEq (Tr atom exps) (Tr atom_ exps_) = atom == atom_ && exps == exps_
+johnMajorEq (AC cid) (AC cid_) = cid == cid_
+johnMajorEq (AS str) (AS str_) = str == str_
+johnMajorEq (AI n) (AI n_) = n == n_
+johnMajorEq (AF d) (AF d_) = d == d_
+johnMajorEq AM AM = True
+johnMajorEq (R terms) (R terms_) = terms == terms_
+johnMajorEq (P term0 term1) (P term0_ term1_) = term0 == term0_ && term1 == term1_
+johnMajorEq (S terms) (S terms_) = terms == terms_
+johnMajorEq (K tokn) (K tokn_) = tokn == tokn_
+johnMajorEq (V n) (V n_) = n == n_
+johnMajorEq (C n) (C n_) = n == n_
+johnMajorEq (F cid) (F cid_) = cid == cid_
+johnMajorEq (FV terms) (FV terms_) = terms == terms_
+johnMajorEq (W str term) (W str_ term_) = str == str_ && term == term_
+johnMajorEq (RP term0 term1) (RP term0_ term1_) = term0 == term0_ && term1 == term1_
+johnMajorEq TM TM = True
+johnMajorEq (L cid term) (L cid_ term_) = cid == cid_ && term == term_
+johnMajorEq (BV cid) (BV cid_) = cid == cid_
+johnMajorEq (KS str) (KS str_) = str == str_
+johnMajorEq (KP strs variants) (KP strs_ variants_) = strs == strs_ && variants == variants_
+johnMajorEq (Var strs0 strs1) (Var strs0_ strs1_) = strs0 == strs0_ && strs1 == strs1_
+johnMajorEq (CId str) (CId str_) = str == str_
+johnMajorEq _ _ = False
+
+instance Ord (Tree c) where
+ compare x y = compare (index x) (index y) `mappend` compareSame x y
+index :: Tree c -> Int
+index (Grm _ _ _) = 0
+index (Hdr _ _) = 1
+index (Abs _) = 2
+index (Cnc _ _) = 3
+index (Fun _ _ _) = 4
+index (Lin _ _) = 5
+index (Typ _ _) = 6
+index (Tr _ _) = 7
+index (AC _) = 8
+index (AS _) = 9
+index (AI _) = 10
+index (AF _) = 11
+index (AM ) = 12
+index (R _) = 13
+index (P _ _) = 14
+index (S _) = 15
+index (K _) = 16
+index (V _) = 17
+index (C _) = 18
+index (F _) = 19
+index (FV _) = 20
+index (W _ _) = 21
+index (RP _ _) = 22
+index (TM ) = 23
+index (L _ _) = 24
+index (BV _) = 25
+index (KS _) = 26
+index (KP _ _) = 27
+index (Var _ _) = 28
+index (CId _) = 29
+compareSame :: Tree c -> Tree c -> Ordering
+compareSame (Grm header abstract concretes) (Grm header_ abstract_ concretes_) = mappend (compare header header_) (mappend (compare abstract abstract_) (compare concretes concretes_))
+compareSame (Hdr cid cids) (Hdr cid_ cids_) = mappend (compare cid cid_) (compare cids cids_)
+compareSame (Abs absdefs) (Abs absdefs_) = compare absdefs absdefs_
+compareSame (Cnc cid cncdefs) (Cnc cid_ cncdefs_) = mappend (compare cid cid_) (compare cncdefs cncdefs_)
+compareSame (Fun cid type' exp) (Fun cid_ type'_ exp_) = mappend (compare cid cid_) (mappend (compare type' type'_) (compare exp exp_))
+compareSame (Lin cid term) (Lin cid_ term_) = mappend (compare cid cid_) (compare term term_)
+compareSame (Typ cids cid) (Typ cids_ cid_) = mappend (compare cids cids_) (compare cid cid_)
+compareSame (Tr atom exps) (Tr atom_ exps_) = mappend (compare atom atom_) (compare exps exps_)
+compareSame (AC cid) (AC cid_) = compare cid cid_
+compareSame (AS str) (AS str_) = compare str str_
+compareSame (AI n) (AI n_) = compare n n_
+compareSame (AF d) (AF d_) = compare d d_
+compareSame AM AM = EQ
+compareSame (R terms) (R terms_) = compare terms terms_
+compareSame (P term0 term1) (P term0_ term1_) = mappend (compare term0 term0_) (compare term1 term1_)
+compareSame (S terms) (S terms_) = compare terms terms_
+compareSame (K tokn) (K tokn_) = compare tokn tokn_
+compareSame (V n) (V n_) = compare n n_
+compareSame (C n) (C n_) = compare n n_
+compareSame (F cid) (F cid_) = compare cid cid_
+compareSame (FV terms) (FV terms_) = compare terms terms_
+compareSame (W str term) (W str_ term_) = mappend (compare str str_) (compare term term_)
+compareSame (RP term0 term1) (RP term0_ term1_) = mappend (compare term0 term0_) (compare term1 term1_)
+compareSame TM TM = EQ
+compareSame (L cid term) (L cid_ term_) = mappend (compare cid cid_) (compare term term_)
+compareSame (BV cid) (BV cid_) = compare cid cid_
+compareSame (KS str) (KS str_) = compare str str_
+compareSame (KP strs variants) (KP strs_ variants_) = mappend (compare strs strs_) (compare variants variants_)
+compareSame (Var strs0 strs1) (Var strs0_ strs1_) = mappend (compare strs0 strs0_) (compare strs1 strs1_)
+compareSame (CId str) (CId str_) = compare str str_
+compareSame x y = error "BNFC error:" compareSame
diff --git a/src/tools/c/GFCC/ComposOp.hs b/src/tools/c/GFCC/ComposOp.hs
new file mode 100644
index 000000000..401c1d778
--- /dev/null
+++ b/src/tools/c/GFCC/ComposOp.hs
@@ -0,0 +1,30 @@
+{-# OPTIONS_GHC -fglasgow-exts #-}
+module GFCC.ComposOp (Compos(..),composOp,composOpM,composOpM_,composOpMonoid,
+ composOpMPlus,composOpFold) where
+
+import Control.Monad.Identity
+import Data.Monoid
+
+class Compos t where
+ compos :: (forall a. a -> m a) -> (forall a b. m (a -> b) -> m a -> m b)
+ -> (forall a. t a -> m (t a)) -> t c -> m (t c)
+
+composOp :: Compos t => (forall a. t a -> t a) -> t c -> t c
+composOp f = runIdentity . composOpM (Identity . f)
+
+composOpM :: (Compos t, Monad m) => (forall a. t a -> m (t a)) -> t c -> m (t c)
+composOpM = compos return ap
+
+composOpM_ :: (Compos t, Monad m) => (forall a. t a -> m ()) -> t c -> m ()
+composOpM_ = composOpFold (return ()) (>>)
+
+composOpMonoid :: (Compos t, Monoid m) => (forall a. t a -> m) -> t c -> m
+composOpMonoid = composOpFold mempty mappend
+
+composOpMPlus :: (Compos t, MonadPlus m) => (forall a. t a -> m b) -> t c -> m b
+composOpMPlus = composOpFold mzero mplus
+
+composOpFold :: Compos t => b -> (b -> b -> b) -> (forall a. t a -> b) -> t c -> b
+composOpFold z c f = unC . compos (\_ -> C z) (\(C x) (C y) -> C (c x y)) (C . f)
+
+newtype C b a = C { unC :: b }
diff --git a/src/tools/c/GFCC/ErrM.hs b/src/tools/c/GFCC/ErrM.hs
new file mode 100644
index 000000000..820473ccd
--- /dev/null
+++ b/src/tools/c/GFCC/ErrM.hs
@@ -0,0 +1,16 @@
+-- BNF Converter: Error Monad
+-- Copyright (C) 2004 Author: Aarne Ranta
+
+-- This file comes with NO WARRANTY and may be used FOR ANY PURPOSE.
+module GFCC.ErrM where
+
+-- the Error monad: like Maybe type with error msgs
+
+data Err a = Ok a | Bad String
+ deriving (Read, Show, Eq)
+
+instance Monad Err where
+ return = Ok
+ fail = Bad
+ Ok a >>= f = f a
+ Bad s >>= f = Bad s
diff --git a/src/tools/c/GFCC/Lex.hs b/src/tools/c/GFCC/Lex.hs
new file mode 100644
index 000000000..f12c824cd
--- /dev/null
+++ b/src/tools/c/GFCC/Lex.hs
@@ -0,0 +1,340 @@
+{-# OPTIONS -fglasgow-exts -cpp #-}
+{-# LINE 3 "GFCC/Lex.x" #-}
+{-# OPTIONS -fno-warn-incomplete-patterns #-}
+module GFCC.Lex where
+
+
+
+#if __GLASGOW_HASKELL__ >= 603
+#include "ghcconfig.h"
+#else
+#include "config.h"
+#endif
+#if __GLASGOW_HASKELL__ >= 503
+import Data.Array
+import Data.Char (ord)
+import Data.Array.Base (unsafeAt)
+#else
+import Array
+import Char (ord)
+#endif
+#if __GLASGOW_HASKELL__ >= 503
+import GHC.Exts
+#else
+import GlaExts
+#endif
+alex_base :: AlexAddr
+alex_base = AlexA# "\x01\x00\x00\x00\x39\x00\x00\x00\x42\x00\x00\x00\x00\x00\x00\x00\xcb\xff\xff\xff\x0a\x00\x00\x00\xec\xff\xff\xff\x9a\x00\x00\x00\x6a\x01\x00\x00\x00\x00\x00\x00\x15\x01\x00\x00\xd3\x00\x00\x00\x35\x00\x00\x00\xe5\x00\x00\x00\x3f\x00\x00\x00\xf0\x00\x00\x00\x1b\x01\x00\x00\xb8\x01\x00\x00"#
+
+alex_table :: AlexAddr
+alex_table = AlexA# "\x00\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x02\x00\x02\x00\x02\x00\x02\x00\x02\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x02\x00\x03\x00\x0a\x00\x03\x00\x03\x00\xff\xff\xff\xff\xff\xff\x03\x00\x03\x00\xff\xff\x03\x00\x03\x00\x05\x00\xff\xff\x03\x00\x0c\x00\x0c\x00\x0c\x00\x0c\x00\x0c\x00\x0c\x00\x0c\x00\x0c\x00\x0c\x00\x0c\x00\x03\x00\x03\x00\xff\xff\x03\x00\xff\xff\x03\x00\x03\x00\x02\x00\x02\x00\x02\x00\x02\x00\x02\x00\x03\x00\x03\x00\x03\x00\x00\x00\x02\x00\x02\x00\x02\x00\x02\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x04\x00\xff\xff\x03\x00\xff\xff\x07\x00\xff\xff\x02\x00\x0f\x00\x00\x00\x0c\x00\x0c\x00\x0c\x00\x0c\x00\x0c\x00\x0c\x00\x0c\x00\x0c\x00\x0c\x00\x0c\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x00\x00\x00\x00\x00\x00\x03\x00\x06\x00\x03\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\xff\xff\x00\x00\x00\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x0a\x00\x00\x00\x00\x00\xff\xff\x07\x00\x0a\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x0d\x00\x0d\x00\x0d\x00\x0d\x00\x0d\x00\x0d\x00\x0d\x00\x0d\x00\x0d\x00\x0d\x00\xff\xff\x0d\x00\x0d\x00\x0d\x00\x0d\x00\x0d\x00\x0d\x00\x0d\x00\x0d\x00\x0d\x00\x0d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0a\x00\x00\x00\x00\x00\x11\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x0b\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x08\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x07\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\x00\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x10\x00\x00\x00\x00\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x00\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x00\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#
+
+alex_check :: AlexAddr
+alex_check = AlexA# "\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\x04\x00\x05\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x7c\x00\x3e\x00\x5d\x00\xff\xff\x09\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x20\x00\xff\xff\xff\xff\x5b\x00\x5c\x00\x5d\x00\x5e\x00\x5f\x00\x60\x00\x20\x00\x2e\x00\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\x7b\x00\x7c\x00\x7d\x00\x7e\x00\x7f\x00\x80\x00\x81\x00\x82\x00\x83\x00\x84\x00\x85\x00\x86\x00\x87\x00\x88\x00\x89\x00\x8a\x00\x8b\x00\x8c\x00\x8d\x00\x8e\x00\x8f\x00\x90\x00\x91\x00\x92\x00\x93\x00\x94\x00\x95\x00\x96\x00\x97\x00\x98\x00\x99\x00\x9a\x00\x9b\x00\x9c\x00\x9d\x00\x9e\x00\x9f\x00\xa0\x00\xa1\x00\xa2\x00\xa3\x00\xa4\x00\xa5\x00\xa6\x00\xa7\x00\xa8\x00\xa9\x00\xaa\x00\xab\x00\xac\x00\xad\x00\xae\x00\xaf\x00\xb0\x00\xb1\x00\xb2\x00\xb3\x00\xb4\x00\xb5\x00\xb6\x00\xb7\x00\xb8\x00\xb9\x00\xba\x00\xbb\x00\xbc\x00\xbd\x00\xbe\x00\xbf\x00\x27\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xd7\x00\xff\xff\xff\xff\x41\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x47\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x4c\x00\x4d\x00\x4e\x00\x4f\x00\x50\x00\x51\x00\x52\x00\x53\x00\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x22\x00\xff\xff\xff\xff\xf7\x00\x5f\x00\x27\x00\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x0a\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x5c\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x22\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x6e\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x74\x00\xff\xff\xff\xff\x65\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xc0\x00\xc1\x00\xc2\x00\xc3\x00\xc4\x00\xc5\x00\xc6\x00\xc7\x00\xc8\x00\xc9\x00\xca\x00\xcb\x00\xcc\x00\xcd\x00\xce\x00\xcf\x00\xd0\x00\xd1\x00\xd2\x00\xd3\x00\xd4\x00\xd5\x00\xd6\x00\x5c\x00\xd8\x00\xd9\x00\xda\x00\xdb\x00\xdc\x00\xdd\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\xe5\x00\xe6\x00\xe7\x00\xe8\x00\xe9\x00\xea\x00\xeb\x00\xec\x00\xed\x00\xee\x00\xef\x00\xf0\x00\xf1\x00\xf2\x00\xf3\x00\xf4\x00\xf5\x00\xf6\x00\x27\x00\xf8\x00\xf9\x00\xfa\x00\xfb\x00\xfc\x00\xfd\x00\xfe\x00\xff\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x41\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x47\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x4c\x00\x4d\x00\x4e\x00\x4f\x00\x50\x00\x51\x00\x52\x00\x53\x00\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\xff\xff\xff\xff\xff\xff\xff\xff\x5f\x00\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x2d\x00\xff\xff\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xc0\x00\xc1\x00\xc2\x00\xc3\x00\xc4\x00\xc5\x00\xc6\x00\xc7\x00\xc8\x00\xc9\x00\xca\x00\xcb\x00\xcc\x00\xcd\x00\xce\x00\xcf\x00\xd0\x00\xd1\x00\xd2\x00\xd3\x00\xd4\x00\xd5\x00\xd6\x00\xff\xff\xd8\x00\xd9\x00\xda\x00\xdb\x00\xdc\x00\xdd\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\xe5\x00\xe6\x00\xe7\x00\xe8\x00\xe9\x00\xea\x00\xeb\x00\xec\x00\xed\x00\xee\x00\xef\x00\xf0\x00\xf1\x00\xf2\x00\xf3\x00\xf4\x00\xf5\x00\xf6\x00\xff\xff\xf8\x00\xf9\x00\xfa\x00\xfb\x00\xfc\x00\xfd\x00\xfe\x00\xff\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff"#
+
+alex_deflt :: AlexAddr
+alex_deflt = AlexA# "\x08\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x0a\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff"#
+
+alex_accept = listArray (0::Int,17) [[],[],[(AlexAccSkip)],[(AlexAcc (alex_action_1))],[(AlexAcc (alex_action_1))],[],[],[(AlexAcc (alex_action_2))],[(AlexAcc (alex_action_2))],[(AlexAcc (alex_action_4))],[],[],[(AlexAcc (alex_action_5))],[(AlexAcc (alex_action_6))],[(AlexAcc (alex_action_6))],[],[],[]]
+{-# LINE 33 "GFCC/Lex.x" #-}
+
+tok f p s = f p s
+
+share :: String -> String
+share = id
+
+data Tok =
+ TS !String -- reserved words and symbols
+ | TL !String -- string literals
+ | TI !String -- integer literals
+ | TV !String -- identifiers
+ | TD !String -- double precision float literals
+ | TC !String -- character literals
+ | T_CId !String
+
+ deriving (Eq,Show,Ord)
+
+data Token =
+ PT Posn Tok
+ | Err Posn
+ deriving (Eq,Show,Ord)
+
+tokenPos (PT (Pn _ l _) _ :_) = "line " ++ show l
+tokenPos (Err (Pn _ l _) :_) = "line " ++ show l
+tokenPos _ = "end of file"
+
+posLineCol (Pn _ l c) = (l,c)
+mkPosToken t@(PT p _) = (posLineCol p, prToken t)
+
+prToken t = case t of
+ PT _ (TS s) -> s
+ PT _ (TI s) -> s
+ PT _ (TV s) -> s
+ PT _ (TD s) -> s
+ PT _ (TC s) -> s
+ PT _ (T_CId s) -> s
+
+ _ -> show t
+
+data BTree = N | B String Tok BTree BTree deriving (Show)
+
+eitherResIdent :: (String -> Tok) -> String -> Tok
+eitherResIdent tv s = treeFind resWords
+ where
+ treeFind N = tv s
+ treeFind (B a t left right) | s < a = treeFind left
+ | s > a = treeFind right
+ | s == a = t
+
+resWords = b "grammar" (b "concrete" (b "abstract" N N) N) (b "pre" N N)
+ where b s = B s (TS s)
+
+unescapeInitTail :: String -> String
+unescapeInitTail = unesc . tail where
+ unesc s = case s of
+ '\\':c:cs | elem c ['\"', '\\', '\''] -> c : unesc cs
+ '\\':'n':cs -> '\n' : unesc cs
+ '\\':'t':cs -> '\t' : unesc cs
+ '"':[] -> []
+ c:cs -> c : unesc cs
+ _ -> []
+
+-------------------------------------------------------------------
+-- Alex wrapper code.
+-- A modified "posn" wrapper.
+-------------------------------------------------------------------
+
+data Posn = Pn !Int !Int !Int
+ deriving (Eq, Show,Ord)
+
+alexStartPos :: Posn
+alexStartPos = Pn 0 1 1
+
+alexMove :: Posn -> Char -> Posn
+alexMove (Pn a l c) '\t' = Pn (a+1) l (((c+7) `div` 8)*8+1)
+alexMove (Pn a l c) '\n' = Pn (a+1) (l+1) 1
+alexMove (Pn a l c) _ = Pn (a+1) l (c+1)
+
+type AlexInput = (Posn, -- current position,
+ Char, -- previous char
+ String) -- current input string
+
+tokens :: String -> [Token]
+tokens str = go (alexStartPos, '\n', str)
+ where
+ go :: (Posn, Char, String) -> [Token]
+ go inp@(pos, _, str) =
+ case alexScan inp 0 of
+ AlexEOF -> []
+ AlexError (pos, _, _) -> [Err pos]
+ AlexSkip inp' len -> go inp'
+ AlexToken inp' len act -> act pos (take len str) : (go inp')
+
+alexGetChar :: AlexInput -> Maybe (Char,AlexInput)
+alexGetChar (p, c, []) = Nothing
+alexGetChar (p, _, (c:s)) =
+ let p' = alexMove p c
+ in p' `seq` Just (c, (p', c, s))
+
+alexInputPrevChar :: AlexInput -> Char
+alexInputPrevChar (p, c, s) = c
+
+alex_action_1 = tok (\p s -> PT p (TS $ share s))
+alex_action_2 = tok (\p s -> PT p (eitherResIdent (T_CId . share) s))
+alex_action_3 = tok (\p s -> PT p (eitherResIdent (TV . share) s))
+alex_action_4 = tok (\p s -> PT p (TL $ share $ unescapeInitTail s))
+alex_action_5 = tok (\p s -> PT p (TI $ share s))
+alex_action_6 = tok (\p s -> PT p (TD $ share s))
+{-# LINE 1 "GenericTemplate.hs" #-}
+{-# LINE 1 "" #-}
+{-# LINE 1 "" #-}
+{-# LINE 1 "GenericTemplate.hs" #-}
+-- -----------------------------------------------------------------------------
+-- ALEX TEMPLATE
+--
+-- This code is in the PUBLIC DOMAIN; you may copy it freely and use
+-- it for any purpose whatsoever.
+
+-- -----------------------------------------------------------------------------
+-- INTERNALS and main scanner engine
+
+{-# LINE 35 "GenericTemplate.hs" #-}
+
+{-# LINE 45 "GenericTemplate.hs" #-}
+
+
+data AlexAddr = AlexA# Addr#
+
+#if __GLASGOW_HASKELL__ < 503
+uncheckedShiftL# = shiftL#
+#endif
+
+{-# INLINE alexIndexInt16OffAddr #-}
+alexIndexInt16OffAddr (AlexA# arr) off =
+#ifdef WORDS_BIGENDIAN
+ narrow16Int# i
+ where
+ i = word2Int# ((high `uncheckedShiftL#` 8#) `or#` low)
+ high = int2Word# (ord# (indexCharOffAddr# arr (off' +# 1#)))
+ low = int2Word# (ord# (indexCharOffAddr# arr off'))
+ off' = off *# 2#
+#else
+ indexInt16OffAddr# arr off
+#endif
+
+
+
+
+
+{-# INLINE alexIndexInt32OffAddr #-}
+alexIndexInt32OffAddr (AlexA# arr) off =
+#ifdef WORDS_BIGENDIAN
+ narrow32Int# i
+ where
+ i = word2Int# ((b3 `uncheckedShiftL#` 24#) `or#`
+ (b2 `uncheckedShiftL#` 16#) `or#`
+ (b1 `uncheckedShiftL#` 8#) `or#` b0)
+ b3 = int2Word# (ord# (indexCharOffAddr# arr (off' +# 3#)))
+ b2 = int2Word# (ord# (indexCharOffAddr# arr (off' +# 2#)))
+ b1 = int2Word# (ord# (indexCharOffAddr# arr (off' +# 1#)))
+ b0 = int2Word# (ord# (indexCharOffAddr# arr off'))
+ off' = off *# 4#
+#else
+ indexInt32OffAddr# arr off
+#endif
+
+
+
+
+
+#if __GLASGOW_HASKELL__ < 503
+quickIndex arr i = arr ! i
+#else
+-- GHC >= 503, unsafeAt is available from Data.Array.Base.
+quickIndex = unsafeAt
+#endif
+
+
+
+
+-- -----------------------------------------------------------------------------
+-- Main lexing routines
+
+data AlexReturn a
+ = AlexEOF
+ | AlexError !AlexInput
+ | AlexSkip !AlexInput !Int
+ | AlexToken !AlexInput !Int a
+
+-- alexScan :: AlexInput -> StartCode -> Maybe (AlexInput,Int,act)
+alexScan input (I# (sc))
+ = alexScanUser undefined input (I# (sc))
+
+alexScanUser user input (I# (sc))
+ = case alex_scan_tkn user input 0# input sc AlexNone of
+ (AlexNone, input') ->
+ case alexGetChar input of
+ Nothing ->
+
+
+
+ AlexEOF
+ Just _ ->
+
+
+
+ AlexError input'
+
+ (AlexLastSkip input len, _) ->
+
+
+
+ AlexSkip input len
+
+ (AlexLastAcc k input len, _) ->
+
+
+
+ AlexToken input len k
+
+
+-- Push the input through the DFA, remembering the most recent accepting
+-- state it encountered.
+
+alex_scan_tkn user orig_input len input s last_acc =
+ input `seq` -- strict in the input
+ case s of
+ -1# -> (last_acc, input)
+ _ -> alex_scan_tkn' user orig_input len input s last_acc
+
+alex_scan_tkn' user orig_input len input s last_acc =
+ let
+ new_acc = check_accs (alex_accept `quickIndex` (I# (s)))
+ in
+ new_acc `seq`
+ case alexGetChar input of
+ Nothing -> (new_acc, input)
+ Just (c, new_input) ->
+
+
+
+ let
+ base = alexIndexInt32OffAddr alex_base s
+ (I# (ord_c)) = ord c
+ offset = (base +# ord_c)
+ check = alexIndexInt16OffAddr alex_check offset
+
+ new_s = if (offset >=# 0#) && (check ==# ord_c)
+ then alexIndexInt16OffAddr alex_table offset
+ else alexIndexInt16OffAddr alex_deflt s
+ in
+ alex_scan_tkn user orig_input (len +# 1#) new_input new_s new_acc
+
+ where
+ check_accs [] = last_acc
+ check_accs (AlexAcc a : _) = AlexLastAcc a input (I# (len))
+ check_accs (AlexAccSkip : _) = AlexLastSkip input (I# (len))
+ check_accs (AlexAccPred a pred : rest)
+ | pred user orig_input (I# (len)) input
+ = AlexLastAcc a input (I# (len))
+ check_accs (AlexAccSkipPred pred : rest)
+ | pred user orig_input (I# (len)) input
+ = AlexLastSkip input (I# (len))
+ check_accs (_ : rest) = check_accs rest
+
+data AlexLastAcc a
+ = AlexNone
+ | AlexLastAcc a !AlexInput !Int
+ | AlexLastSkip !AlexInput !Int
+
+data AlexAcc a user
+ = AlexAcc a
+ | AlexAccSkip
+ | AlexAccPred a (AlexAccPred user)
+ | AlexAccSkipPred (AlexAccPred user)
+
+type AlexAccPred user = user -> AlexInput -> Int -> AlexInput -> Bool
+
+-- -----------------------------------------------------------------------------
+-- Predicates on a rule
+
+alexAndPred p1 p2 user in1 len in2
+ = p1 user in1 len in2 && p2 user in1 len in2
+
+--alexPrevCharIsPred :: Char -> AlexAccPred _
+alexPrevCharIs c _ input _ _ = c == alexInputPrevChar input
+
+--alexPrevCharIsOneOfPred :: Array Char Bool -> AlexAccPred _
+alexPrevCharIsOneOf arr _ input _ _ = arr ! alexInputPrevChar input
+
+--alexRightContext :: Int -> AlexAccPred _
+alexRightContext (I# (sc)) user _ _ input =
+ case alex_scan_tkn user input 0# input sc AlexNone of
+ (AlexNone, _) -> False
+ _ -> True
+ -- TODO: there's no need to find the longest
+ -- match when checking the right context, just
+ -- the first match will do.
+
+-- used by wrappers
+iUnbox (I# (i)) = i
diff --git a/src/tools/c/GFCC/Lex.x b/src/tools/c/GFCC/Lex.x
new file mode 100644
index 000000000..f5fda82b6
--- /dev/null
+++ b/src/tools/c/GFCC/Lex.x
@@ -0,0 +1,135 @@
+-- -*- haskell -*-
+-- This Alex file was machine-generated by the BNF converter
+{
+{-# OPTIONS -fno-warn-incomplete-patterns #-}
+module GFCC.Lex where
+
+
+}
+
+
+$l = [a-zA-Z\192 - \255] # [\215 \247] -- isolatin1 letter FIXME
+$c = [A-Z\192-\221] # [\215] -- capital isolatin1 letter FIXME
+$s = [a-z\222-\255] # [\247] -- small isolatin1 letter FIXME
+$d = [0-9] -- digit
+$i = [$l $d _ '] -- identifier character
+$u = [\0-\255] -- universal: any character
+
+@rsyms = -- symbols and non-identifier-like reserved words
+ \; | \( | \) | \{ | \} | \: | \= | \- \> | \? | \[ | \] | \! | \$ | \[ \| | \| \] | \+ | \@ | \# | \/ | \,
+
+:-
+
+$white+ ;
+@rsyms { tok (\p s -> PT p (TS $ share s)) }
+(\_ | $l)($l | $d | \' | \_)* { tok (\p s -> PT p (eitherResIdent (T_CId . share) s)) }
+
+$l $i* { tok (\p s -> PT p (eitherResIdent (TV . share) s)) }
+\" ([$u # [\" \\ \n]] | (\\ (\" | \\ | \' | n | t)))* \"{ tok (\p s -> PT p (TL $ share $ unescapeInitTail s)) }
+
+$d+ { tok (\p s -> PT p (TI $ share s)) }
+$d+ \. $d+ (e (\-)? $d+)? { tok (\p s -> PT p (TD $ share s)) }
+
+{
+
+tok f p s = f p s
+
+share :: String -> String
+share = id
+
+data Tok =
+ TS !String -- reserved words and symbols
+ | TL !String -- string literals
+ | TI !String -- integer literals
+ | TV !String -- identifiers
+ | TD !String -- double precision float literals
+ | TC !String -- character literals
+ | T_CId !String
+
+ deriving (Eq,Show,Ord)
+
+data Token =
+ PT Posn Tok
+ | Err Posn
+ deriving (Eq,Show,Ord)
+
+tokenPos (PT (Pn _ l _) _ :_) = "line " ++ show l
+tokenPos (Err (Pn _ l _) :_) = "line " ++ show l
+tokenPos _ = "end of file"
+
+posLineCol (Pn _ l c) = (l,c)
+mkPosToken t@(PT p _) = (posLineCol p, prToken t)
+
+prToken t = case t of
+ PT _ (TS s) -> s
+ PT _ (TI s) -> s
+ PT _ (TV s) -> s
+ PT _ (TD s) -> s
+ PT _ (TC s) -> s
+ PT _ (T_CId s) -> s
+
+ _ -> show t
+
+data BTree = N | B String Tok BTree BTree deriving (Show)
+
+eitherResIdent :: (String -> Tok) -> String -> Tok
+eitherResIdent tv s = treeFind resWords
+ where
+ treeFind N = tv s
+ treeFind (B a t left right) | s < a = treeFind left
+ | s > a = treeFind right
+ | s == a = t
+
+resWords = b "grammar" (b "concrete" (b "abstract" N N) N) (b "pre" N N)
+ where b s = B s (TS s)
+
+unescapeInitTail :: String -> String
+unescapeInitTail = unesc . tail where
+ unesc s = case s of
+ '\\':c:cs | elem c ['\"', '\\', '\''] -> c : unesc cs
+ '\\':'n':cs -> '\n' : unesc cs
+ '\\':'t':cs -> '\t' : unesc cs
+ '"':[] -> []
+ c:cs -> c : unesc cs
+ _ -> []
+
+-------------------------------------------------------------------
+-- Alex wrapper code.
+-- A modified "posn" wrapper.
+-------------------------------------------------------------------
+
+data Posn = Pn !Int !Int !Int
+ deriving (Eq, Show,Ord)
+
+alexStartPos :: Posn
+alexStartPos = Pn 0 1 1
+
+alexMove :: Posn -> Char -> Posn
+alexMove (Pn a l c) '\t' = Pn (a+1) l (((c+7) `div` 8)*8+1)
+alexMove (Pn a l c) '\n' = Pn (a+1) (l+1) 1
+alexMove (Pn a l c) _ = Pn (a+1) l (c+1)
+
+type AlexInput = (Posn, -- current position,
+ Char, -- previous char
+ String) -- current input string
+
+tokens :: String -> [Token]
+tokens str = go (alexStartPos, '\n', str)
+ where
+ go :: (Posn, Char, String) -> [Token]
+ go inp@(pos, _, str) =
+ case alexScan inp 0 of
+ AlexEOF -> []
+ AlexError (pos, _, _) -> [Err pos]
+ AlexSkip inp' len -> go inp'
+ AlexToken inp' len act -> act pos (take len str) : (go inp')
+
+alexGetChar :: AlexInput -> Maybe (Char,AlexInput)
+alexGetChar (p, c, []) = Nothing
+alexGetChar (p, _, (c:s)) =
+ let p' = alexMove p c
+ in p' `seq` Just (c, (p', c, s))
+
+alexInputPrevChar :: AlexInput -> Char
+alexInputPrevChar (p, c, s) = c
+}
diff --git a/src/tools/c/GFCC/Par.hs b/src/tools/c/GFCC/Par.hs
new file mode 100644
index 000000000..1f5479e64
--- /dev/null
+++ b/src/tools/c/GFCC/Par.hs
@@ -0,0 +1,1096 @@
+{-# OPTIONS -fglasgow-exts -cpp #-}
+{-# OPTIONS -fno-warn-incomplete-patterns -fno-warn-overlapping-patterns #-}
+module GFCC.Par where
+import GFCC.Abs
+import GFCC.Lex
+import GFCC.ErrM
+#if __GLASGOW_HASKELL__ >= 503
+import Data.Array
+#else
+import Array
+#endif
+#if __GLASGOW_HASKELL__ >= 503
+import GHC.Exts
+#else
+import GlaExts
+#endif
+
+-- parser produced by Happy Version 1.16
+
+newtype HappyAbsSyn = HappyAbsSyn (() -> ())
+happyIn23 :: (String) -> (HappyAbsSyn )
+happyIn23 x = unsafeCoerce# x
+{-# INLINE happyIn23 #-}
+happyOut23 :: (HappyAbsSyn ) -> (String)
+happyOut23 x = unsafeCoerce# x
+{-# INLINE happyOut23 #-}
+happyIn24 :: (Integer) -> (HappyAbsSyn )
+happyIn24 x = unsafeCoerce# x
+{-# INLINE happyIn24 #-}
+happyOut24 :: (HappyAbsSyn ) -> (Integer)
+happyOut24 x = unsafeCoerce# x
+{-# INLINE happyOut24 #-}
+happyIn25 :: (Double) -> (HappyAbsSyn )
+happyIn25 x = unsafeCoerce# x
+{-# INLINE happyIn25 #-}
+happyOut25 :: (HappyAbsSyn ) -> (Double)
+happyOut25 x = unsafeCoerce# x
+{-# INLINE happyOut25 #-}
+happyIn26 :: (CId) -> (HappyAbsSyn )
+happyIn26 x = unsafeCoerce# x
+{-# INLINE happyIn26 #-}
+happyOut26 :: (HappyAbsSyn ) -> (CId)
+happyOut26 x = unsafeCoerce# x
+{-# INLINE happyOut26 #-}
+happyIn27 :: (Grammar) -> (HappyAbsSyn )
+happyIn27 x = unsafeCoerce# x
+{-# INLINE happyIn27 #-}
+happyOut27 :: (HappyAbsSyn ) -> (Grammar)
+happyOut27 x = unsafeCoerce# x
+{-# INLINE happyOut27 #-}
+happyIn28 :: (Header) -> (HappyAbsSyn )
+happyIn28 x = unsafeCoerce# x
+{-# INLINE happyIn28 #-}
+happyOut28 :: (HappyAbsSyn ) -> (Header)
+happyOut28 x = unsafeCoerce# x
+{-# INLINE happyOut28 #-}
+happyIn29 :: (Abstract) -> (HappyAbsSyn )
+happyIn29 x = unsafeCoerce# x
+{-# INLINE happyIn29 #-}
+happyOut29 :: (HappyAbsSyn ) -> (Abstract)
+happyOut29 x = unsafeCoerce# x
+{-# INLINE happyOut29 #-}
+happyIn30 :: (Concrete) -> (HappyAbsSyn )
+happyIn30 x = unsafeCoerce# x
+{-# INLINE happyIn30 #-}
+happyOut30 :: (HappyAbsSyn ) -> (Concrete)
+happyOut30 x = unsafeCoerce# x
+{-# INLINE happyOut30 #-}
+happyIn31 :: (AbsDef) -> (HappyAbsSyn )
+happyIn31 x = unsafeCoerce# x
+{-# INLINE happyIn31 #-}
+happyOut31 :: (HappyAbsSyn ) -> (AbsDef)
+happyOut31 x = unsafeCoerce# x
+{-# INLINE happyOut31 #-}
+happyIn32 :: (CncDef) -> (HappyAbsSyn )
+happyIn32 x = unsafeCoerce# x
+{-# INLINE happyIn32 #-}
+happyOut32 :: (HappyAbsSyn ) -> (CncDef)
+happyOut32 x = unsafeCoerce# x
+{-# INLINE happyOut32 #-}
+happyIn33 :: (Type) -> (HappyAbsSyn )
+happyIn33 x = unsafeCoerce# x
+{-# INLINE happyIn33 #-}
+happyOut33 :: (HappyAbsSyn ) -> (Type)
+happyOut33 x = unsafeCoerce# x
+{-# INLINE happyOut33 #-}
+happyIn34 :: (Exp) -> (HappyAbsSyn )
+happyIn34 x = unsafeCoerce# x
+{-# INLINE happyIn34 #-}
+happyOut34 :: (HappyAbsSyn ) -> (Exp)
+happyOut34 x = unsafeCoerce# x
+{-# INLINE happyOut34 #-}
+happyIn35 :: (Atom) -> (HappyAbsSyn )
+happyIn35 x = unsafeCoerce# x
+{-# INLINE happyIn35 #-}
+happyOut35 :: (HappyAbsSyn ) -> (Atom)
+happyOut35 x = unsafeCoerce# x
+{-# INLINE happyOut35 #-}
+happyIn36 :: (Term) -> (HappyAbsSyn )
+happyIn36 x = unsafeCoerce# x
+{-# INLINE happyIn36 #-}
+happyOut36 :: (HappyAbsSyn ) -> (Term)
+happyOut36 x = unsafeCoerce# x
+{-# INLINE happyOut36 #-}
+happyIn37 :: (Tokn) -> (HappyAbsSyn )
+happyIn37 x = unsafeCoerce# x
+{-# INLINE happyIn37 #-}
+happyOut37 :: (HappyAbsSyn ) -> (Tokn)
+happyOut37 x = unsafeCoerce# x
+{-# INLINE happyOut37 #-}
+happyIn38 :: (Variant) -> (HappyAbsSyn )
+happyIn38 x = unsafeCoerce# x
+{-# INLINE happyIn38 #-}
+happyOut38 :: (HappyAbsSyn ) -> (Variant)
+happyOut38 x = unsafeCoerce# x
+{-# INLINE happyOut38 #-}
+happyIn39 :: ([Concrete]) -> (HappyAbsSyn )
+happyIn39 x = unsafeCoerce# x
+{-# INLINE happyIn39 #-}
+happyOut39 :: (HappyAbsSyn ) -> ([Concrete])
+happyOut39 x = unsafeCoerce# x
+{-# INLINE happyOut39 #-}
+happyIn40 :: ([AbsDef]) -> (HappyAbsSyn )
+happyIn40 x = unsafeCoerce# x
+{-# INLINE happyIn40 #-}
+happyOut40 :: (HappyAbsSyn ) -> ([AbsDef])
+happyOut40 x = unsafeCoerce# x
+{-# INLINE happyOut40 #-}
+happyIn41 :: ([CncDef]) -> (HappyAbsSyn )
+happyIn41 x = unsafeCoerce# x
+{-# INLINE happyIn41 #-}
+happyOut41 :: (HappyAbsSyn ) -> ([CncDef])
+happyOut41 x = unsafeCoerce# x
+{-# INLINE happyOut41 #-}
+happyIn42 :: ([CId]) -> (HappyAbsSyn )
+happyIn42 x = unsafeCoerce# x
+{-# INLINE happyIn42 #-}
+happyOut42 :: (HappyAbsSyn ) -> ([CId])
+happyOut42 x = unsafeCoerce# x
+{-# INLINE happyOut42 #-}
+happyIn43 :: ([Term]) -> (HappyAbsSyn )
+happyIn43 x = unsafeCoerce# x
+{-# INLINE happyIn43 #-}
+happyOut43 :: (HappyAbsSyn ) -> ([Term])
+happyOut43 x = unsafeCoerce# x
+{-# INLINE happyOut43 #-}
+happyIn44 :: ([Exp]) -> (HappyAbsSyn )
+happyIn44 x = unsafeCoerce# x
+{-# INLINE happyIn44 #-}
+happyOut44 :: (HappyAbsSyn ) -> ([Exp])
+happyOut44 x = unsafeCoerce# x
+{-# INLINE happyOut44 #-}
+happyIn45 :: ([String]) -> (HappyAbsSyn )
+happyIn45 x = unsafeCoerce# x
+{-# INLINE happyIn45 #-}
+happyOut45 :: (HappyAbsSyn ) -> ([String])
+happyOut45 x = unsafeCoerce# x
+{-# INLINE happyOut45 #-}
+happyIn46 :: ([Variant]) -> (HappyAbsSyn )
+happyIn46 x = unsafeCoerce# x
+{-# INLINE happyIn46 #-}
+happyOut46 :: (HappyAbsSyn ) -> ([Variant])
+happyOut46 x = unsafeCoerce# x
+{-# INLINE happyOut46 #-}
+happyInTok :: Token -> (HappyAbsSyn )
+happyInTok x = unsafeCoerce# x
+{-# INLINE happyInTok #-}
+happyOutTok :: (HappyAbsSyn ) -> Token
+happyOutTok x = unsafeCoerce# x
+{-# INLINE happyOutTok #-}
+
+happyActOffsets :: HappyAddr
+happyActOffsets = HappyA# "\xff\x00\xff\x00\xfc\x00\xfe\x00\xfb\x00\xfb\x00\xfb\x00\x37\x00\x4d\x00\x29\x00\x2b\x00\x00\x00\x00\x00\x00\x00\x00\x00\xfb\x00\x29\x00\x00\x00\x00\x00\xfa\x00\xf9\x00\x00\x00\xf8\x00\xa8\x00\xf7\x00\xae\x00\xff\xff\x00\x00\x00\x00\x00\x00\xf6\x00\x00\x00\xf5\x00\x29\x00\x00\x00\x15\x00\xf3\x00\x29\x00\xf4\x00\x00\x00\x00\x00\xf2\x00\xf1\x00\xad\x00\xad\x00\x76\x00\xf1\x00\xf1\x00\xf0\x00\xe9\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe9\x00\x00\x00\x00\x00\xe9\x00\x00\x00\x4d\x00\xe9\x00\xef\x00\xeb\x00\xe3\x00\xee\x00\xe2\x00\xe2\x00\xe8\x00\xe1\x00\xed\x00\xe0\x00\xd4\x00\xd1\x00\xec\x00\xd3\x00\xea\x00\x00\x00\xe7\x00\xce\x00\x29\x00\xce\x00\x00\x00\x00\x00\xe6\x00\xe5\x00\xe4\x00\xc8\x00\x00\x00\xdf\x00\x00\x00\xde\x00\xd2\x00\xdb\x00\xbc\x00\xdd\x00\x29\x00\x00\x00\x00\x00\x00\x00\xa7\x00\x00\x00\xc6\x00\x00\x00\x00\x00\x29\x00\x29\x00\x29\x00\x29\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xfc\xff\x23\x00\x00\x00\x00\x00\xda\x00\x00\x00\x05\x00\xc2\x00\xdc\x00\x00\x00\xd9\x00\x00\x00\x04\x00\x37\x00\x00\x00\xa7\x00\xd8\x00\xd7\x00\xd6\x00\xd5\x00\x00\x00\x00\x00\x00\x00\x00\x00\xcc\x00\x00\x00\x00\x00\x00\x00\xc0\x00\xca\x00\x00\x00\x00\x00"#
+
+happyGotoOffsets :: HappyAddr
+happyGotoOffsets = HappyA# "\x95\x00\xcf\x00\xcd\x00\xcb\x00\x54\x00\xa6\x00\x09\x00\xb2\x00\xc3\x00\x92\x00\x41\x00\xf8\xff\xc1\x00\xbd\x00\xaa\x00\x27\x00\x61\x00\x96\x00\xb4\x00\x87\x00\x00\x00\x00\x00\x00\x00\xbf\x00\x00\x00\xbf\x00\xa5\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5d\x00\x00\x00\x4b\x00\xa9\x00\x47\x00\xab\x00\x00\x00\x00\x00\x00\x00\x00\x00\x7a\x00\x0a\x00\x72\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb6\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x8d\x00\x00\x00\x00\x00\x00\x00\x7f\x00\x00\x00\x00\x00\x6c\x00\x00\x00\x5f\x00\x00\x00\x01\x00\x8e\x00\x60\x00\x38\x00\x44\x00\x00\x00\x00\x00\x00\x00\x25\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x33\x00\x70\x00\x00\x00\x11\x00\x00\x00\x00\x00\x8a\x00\x7b\x00\x77\x00\x73\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x11\x00\xa5\x00\x00\x00\x00\x00\x00\x00\x34\x00\x0a\x00\x21\x00\x00\x00\x20\x00\x00\x00\x00\x00\x7a\x00\xa1\x00\x00\x00\x56\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x22\x00\x00\x00\x00\x00\x00\x00"#
+
+happyDefActions :: HappyAddr
+happyDefActions = HappyA# "\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc3\xff\x00\x00\x00\x00\x00\x00\x00\x00\xbb\xff\xc9\xff\xc7\xff\xc5\xff\xc3\xff\xc0\xff\xbd\xff\xbb\xff\xbb\xff\x00\x00\xeb\xff\xb8\xff\x00\x00\x00\x00\x00\x00\x00\x00\xcc\xff\xd4\xff\xd3\xff\xbf\xff\xd6\xff\x00\x00\xc0\xff\xcf\xff\xc0\xff\x00\x00\xc0\xff\x00\x00\xea\xff\xe8\xff\xc2\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xdd\xff\xdc\xff\xdb\xff\xde\xff\x00\x00\xda\xff\xe9\xff\x00\x00\xdf\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc7\xff\x00\x00\xc3\xff\x00\x00\x00\x00\xbd\xff\xbb\xff\x00\x00\x00\x00\x00\x00\xc3\xff\xcd\xff\x00\x00\xd5\xff\x00\x00\xcc\xff\xd3\xff\xbf\xff\x00\x00\xc0\xff\xbc\xff\xba\xff\xbb\xff\xb9\xff\xb7\xff\xca\xff\xbe\xff\xd7\xff\x00\x00\x00\x00\x00\x00\x00\x00\xd9\xff\xd2\xff\xc1\xff\xc4\xff\xc6\xff\xc8\xff\x00\x00\x00\x00\xe1\xff\xe2\xff\x00\x00\xc5\xff\x00\x00\xc3\xff\x00\x00\xc9\xff\x00\x00\xe5\xff\x00\x00\x00\x00\xe0\xff\xb9\xff\x00\x00\x00\x00\x00\x00\x00\x00\xd8\xff\xd0\xff\xce\xff\xd1\xff\x00\x00\xe3\xff\xe4\xff\xe6\xff\xe7\xff\x00\x00\xcb\xff"#
+
+happyCheck :: HappyAddr
+happyCheck = HappyA# "\xff\xff\x02\x00\x00\x00\x01\x00\x03\x00\x03\x00\x0a\x00\x0f\x00\x09\x00\x05\x00\x05\x00\x0a\x00\x03\x00\x03\x00\x16\x00\x0d\x00\x0e\x00\x00\x00\x08\x00\x0a\x00\x13\x00\x19\x00\x14\x00\x02\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x13\x00\x1e\x00\x09\x00\x0a\x00\x1c\x00\x1c\x00\x0d\x00\x0e\x00\x03\x00\x02\x00\x03\x00\x12\x00\x03\x00\x07\x00\x03\x00\x02\x00\x09\x00\x18\x00\x19\x00\x1a\x00\x10\x00\x1c\x00\x09\x00\x0a\x00\x13\x00\x0a\x00\x0d\x00\x0e\x00\x13\x00\x02\x00\x13\x00\x12\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x09\x00\x00\x00\x19\x00\x1a\x00\x19\x00\x1c\x00\x12\x00\x00\x00\x01\x00\x16\x00\x03\x00\x00\x00\x01\x00\x15\x00\x03\x00\x0e\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x0d\x00\x0e\x00\x09\x00\x03\x00\x0d\x00\x0e\x00\x16\x00\x14\x00\x08\x00\x00\x00\x01\x00\x14\x00\x03\x00\x00\x00\x01\x00\x03\x00\x03\x00\x0f\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x0d\x00\x0e\x00\x16\x00\x17\x00\x0d\x00\x0e\x00\x11\x00\x14\x00\x06\x00\x00\x00\x01\x00\x14\x00\x03\x00\x00\x00\x01\x00\x07\x00\x03\x00\x00\x00\x01\x00\x03\x00\x03\x00\x0f\x00\x0d\x00\x0e\x00\x03\x00\x09\x00\x0d\x00\x0e\x00\x16\x00\x17\x00\x0d\x00\x0e\x00\x00\x00\x01\x00\x16\x00\x03\x00\x00\x00\x01\x00\x03\x00\x03\x00\x00\x00\x01\x00\x1e\x00\x03\x00\x0f\x00\x0d\x00\x0e\x00\x04\x00\x05\x00\x0d\x00\x0e\x00\x16\x00\x17\x00\x0d\x00\x0e\x00\x00\x00\x01\x00\x02\x00\x03\x00\x00\x00\x01\x00\x02\x00\x03\x00\x03\x00\x01\x00\x15\x00\x0b\x00\x0c\x00\x03\x00\x09\x00\x0b\x00\x0c\x00\x00\x00\x01\x00\x02\x00\x03\x00\x00\x00\x01\x00\x02\x00\x03\x00\x13\x00\x13\x00\x12\x00\x0b\x00\x0c\x00\x00\x00\x19\x00\x19\x00\x0c\x00\x00\x00\x01\x00\x02\x00\x03\x00\x19\x00\x0c\x00\x1c\x00\x16\x00\x1e\x00\x1e\x00\x11\x00\x11\x00\x0c\x00\x14\x00\x10\x00\x07\x00\x06\x00\x05\x00\x0b\x00\x16\x00\x0b\x00\x03\x00\x03\x00\x03\x00\x03\x00\x03\x00\x01\x00\x1c\x00\x19\x00\x03\x00\x07\x00\x10\x00\x08\x00\x1c\x00\x01\x00\x01\x00\x01\x00\x15\x00\x0b\x00\x1c\x00\x04\x00\x02\x00\x01\x00\x0f\x00\x1e\x00\x1c\x00\x04\x00\x07\x00\xff\xff\x06\x00\xff\xff\xff\xff\x08\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x1e\x00\x1e\x00\x1e\x00\x1e\x00\xff\xff\xff\xff\x1c\x00\xff\xff\x14\x00\x1e\x00\x18\x00\xff\xff\x14\x00\xff\xff\x14\x00\x1a\x00\xff\xff\x1e\x00\x1c\x00\x15\x00\x19\x00\x1e\x00\x16\x00\x1e\x00\x17\x00\x1c\x00\x1e\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff"#
+
+happyTable :: HappyAddr
+happyTable = HappyA# "\x00\x00\x3c\x00\x1b\x00\x1c\x00\x29\x00\x1d\x00\x82\x00\x2e\x00\x38\x00\x8d\x00\x7e\x00\x76\x00\x29\x00\x40\x00\x17\x00\x1e\x00\x1f\x00\x61\x00\x54\x00\x3c\x00\x3d\x00\x16\x00\x66\x00\x22\x00\x16\x00\x28\x00\x39\x00\x29\x00\x3d\x00\xff\xff\x23\x00\x24\x00\x29\x00\x29\x00\x25\x00\x26\x00\x29\x00\x3c\x00\x81\x00\x27\x00\x29\x00\x53\x00\x29\x00\x22\x00\x38\x00\x53\x00\x16\x00\x28\x00\x8e\x00\x29\x00\x23\x00\x24\x00\x7c\x00\x31\x00\x25\x00\x26\x00\x6e\x00\x3c\x00\x2a\x00\x27\x00\x16\x00\x28\x00\x39\x00\x29\x00\x38\x00\x1b\x00\x16\x00\x28\x00\x16\x00\x29\x00\x7e\x00\x1b\x00\x1c\x00\x65\x00\x1d\x00\x1b\x00\x1c\x00\x73\x00\x1d\x00\x2f\x00\x16\x00\x28\x00\x39\x00\x29\x00\x1e\x00\x1f\x00\x38\x00\x40\x00\x1e\x00\x1f\x00\x72\x00\x58\x00\x41\x00\x5b\x00\x1c\x00\x5a\x00\x5c\x00\x1b\x00\x1c\x00\x74\x00\x1d\x00\x16\x00\x16\x00\x28\x00\x39\x00\x29\x00\x5d\x00\x1f\x00\x17\x00\x8a\x00\x1e\x00\x1f\x00\x78\x00\x5e\x00\x7a\x00\x1b\x00\x1c\x00\x20\x00\x1d\x00\x1b\x00\x1c\x00\x53\x00\x1d\x00\x1b\x00\x1c\x00\x3e\x00\x1d\x00\x16\x00\x82\x00\x1f\x00\x4b\x00\x55\x00\x83\x00\x1f\x00\x17\x00\x64\x00\x84\x00\x1f\x00\x1b\x00\x1c\x00\x44\x00\x1d\x00\x1b\x00\x1c\x00\x4d\x00\x1d\x00\x1b\x00\x1c\x00\xff\xff\x1d\x00\x16\x00\x85\x00\x1f\x00\x48\x00\x49\x00\x75\x00\x1f\x00\x17\x00\x18\x00\x31\x00\x1f\x00\x32\x00\x33\x00\x34\x00\x35\x00\x32\x00\x33\x00\x34\x00\x35\x00\x3e\x00\x59\x00\x1a\x00\x8b\x00\x3a\x00\x57\x00\x3f\x00\x60\x00\x3a\x00\x32\x00\x33\x00\x34\x00\x35\x00\x32\x00\x33\x00\x34\x00\x35\x00\xbb\xff\x63\x00\x2b\x00\x39\x00\x3a\x00\x61\x00\xbb\xff\x16\x00\x51\x00\x32\x00\x33\x00\x34\x00\x35\x00\x16\x00\x69\x00\x29\x00\x19\x00\xff\xff\xff\xff\x6a\x00\x2c\x00\x36\x00\x60\x00\x2d\x00\x42\x00\x44\x00\x46\x00\x91\x00\x44\x00\x90\x00\x87\x00\x88\x00\x89\x00\x8a\x00\x8e\x00\x7c\x00\x29\x00\x16\x00\x68\x00\x80\x00\x6c\x00\x6b\x00\x29\x00\x70\x00\x71\x00\x72\x00\x46\x00\x6d\x00\x29\x00\x78\x00\x7a\x00\x4b\x00\x6e\x00\xff\xff\x29\x00\x4d\x00\x50\x00\x00\x00\x4f\x00\x00\x00\x00\x00\x51\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xff\xff\xff\xff\xff\xff\xff\xff\x00\x00\x00\x00\x29\x00\x00\x00\x57\x00\xff\xff\x53\x00\x00\x00\x60\x00\x00\x00\x64\x00\x28\x00\x00\x00\xff\xff\x29\x00\x46\x00\x16\x00\xff\xff\x44\x00\xff\xff\x48\x00\x29\x00\xb9\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#
+
+happyReduceArr = array (20, 72) [
+ (20 , happyReduce_20),
+ (21 , happyReduce_21),
+ (22 , happyReduce_22),
+ (23 , happyReduce_23),
+ (24 , happyReduce_24),
+ (25 , happyReduce_25),
+ (26 , happyReduce_26),
+ (27 , happyReduce_27),
+ (28 , happyReduce_28),
+ (29 , happyReduce_29),
+ (30 , happyReduce_30),
+ (31 , happyReduce_31),
+ (32 , happyReduce_32),
+ (33 , happyReduce_33),
+ (34 , happyReduce_34),
+ (35 , happyReduce_35),
+ (36 , happyReduce_36),
+ (37 , happyReduce_37),
+ (38 , happyReduce_38),
+ (39 , happyReduce_39),
+ (40 , happyReduce_40),
+ (41 , happyReduce_41),
+ (42 , happyReduce_42),
+ (43 , happyReduce_43),
+ (44 , happyReduce_44),
+ (45 , happyReduce_45),
+ (46 , happyReduce_46),
+ (47 , happyReduce_47),
+ (48 , happyReduce_48),
+ (49 , happyReduce_49),
+ (50 , happyReduce_50),
+ (51 , happyReduce_51),
+ (52 , happyReduce_52),
+ (53 , happyReduce_53),
+ (54 , happyReduce_54),
+ (55 , happyReduce_55),
+ (56 , happyReduce_56),
+ (57 , happyReduce_57),
+ (58 , happyReduce_58),
+ (59 , happyReduce_59),
+ (60 , happyReduce_60),
+ (61 , happyReduce_61),
+ (62 , happyReduce_62),
+ (63 , happyReduce_63),
+ (64 , happyReduce_64),
+ (65 , happyReduce_65),
+ (66 , happyReduce_66),
+ (67 , happyReduce_67),
+ (68 , happyReduce_68),
+ (69 , happyReduce_69),
+ (70 , happyReduce_70),
+ (71 , happyReduce_71),
+ (72 , happyReduce_72)
+ ]
+
+happy_n_terms = 31 :: Int
+happy_n_nonterms = 24 :: Int
+
+happyReduce_20 = happySpecReduce_1 0# happyReduction_20
+happyReduction_20 happy_x_1
+ = case happyOutTok happy_x_1 of { (PT _ (TL happy_var_1)) ->
+ happyIn23
+ (happy_var_1
+ )}
+
+happyReduce_21 = happySpecReduce_1 1# happyReduction_21
+happyReduction_21 happy_x_1
+ = case happyOutTok happy_x_1 of { (PT _ (TI happy_var_1)) ->
+ happyIn24
+ ((read happy_var_1) :: Integer
+ )}
+
+happyReduce_22 = happySpecReduce_1 2# happyReduction_22
+happyReduction_22 happy_x_1
+ = case happyOutTok happy_x_1 of { (PT _ (TD happy_var_1)) ->
+ happyIn25
+ ((read happy_var_1) :: Double
+ )}
+
+happyReduce_23 = happySpecReduce_1 3# happyReduction_23
+happyReduction_23 happy_x_1
+ = case happyOutTok happy_x_1 of { (PT _ (T_CId happy_var_1)) ->
+ happyIn26
+ (CId (happy_var_1)
+ )}
+
+happyReduce_24 = happyReduce 5# 4# happyReduction_24
+happyReduction_24 (happy_x_5 `HappyStk`
+ happy_x_4 `HappyStk`
+ happy_x_3 `HappyStk`
+ happy_x_2 `HappyStk`
+ happy_x_1 `HappyStk`
+ happyRest)
+ = case happyOut28 happy_x_1 of { happy_var_1 ->
+ case happyOut29 happy_x_3 of { happy_var_3 ->
+ case happyOut39 happy_x_5 of { happy_var_5 ->
+ happyIn27
+ (Grm happy_var_1 happy_var_3 (reverse happy_var_5)
+ ) `HappyStk` happyRest}}}
+
+happyReduce_25 = happyReduce 5# 5# happyReduction_25
+happyReduction_25 (happy_x_5 `HappyStk`
+ happy_x_4 `HappyStk`
+ happy_x_3 `HappyStk`
+ happy_x_2 `HappyStk`
+ happy_x_1 `HappyStk`
+ happyRest)
+ = case happyOut26 happy_x_2 of { happy_var_2 ->
+ case happyOut42 happy_x_4 of { happy_var_4 ->
+ happyIn28
+ (Hdr happy_var_2 happy_var_4
+ ) `HappyStk` happyRest}}
+
+happyReduce_26 = happyReduce 4# 6# happyReduction_26
+happyReduction_26 (happy_x_4 `HappyStk`
+ happy_x_3 `HappyStk`
+ happy_x_2 `HappyStk`
+ happy_x_1 `HappyStk`
+ happyRest)
+ = case happyOut40 happy_x_3 of { happy_var_3 ->
+ happyIn29
+ (Abs (reverse happy_var_3)
+ ) `HappyStk` happyRest}
+
+happyReduce_27 = happyReduce 5# 7# happyReduction_27
+happyReduction_27 (happy_x_5 `HappyStk`
+ happy_x_4 `HappyStk`
+ happy_x_3 `HappyStk`
+ happy_x_2 `HappyStk`
+ happy_x_1 `HappyStk`
+ happyRest)
+ = case happyOut26 happy_x_2 of { happy_var_2 ->
+ case happyOut41 happy_x_4 of { happy_var_4 ->
+ happyIn30
+ (Cnc happy_var_2 (reverse happy_var_4)
+ ) `HappyStk` happyRest}}
+
+happyReduce_28 = happyReduce 5# 8# happyReduction_28
+happyReduction_28 (happy_x_5 `HappyStk`
+ happy_x_4 `HappyStk`
+ happy_x_3 `HappyStk`
+ happy_x_2 `HappyStk`
+ happy_x_1 `HappyStk`
+ happyRest)
+ = case happyOut26 happy_x_1 of { happy_var_1 ->
+ case happyOut33 happy_x_3 of { happy_var_3 ->
+ case happyOut34 happy_x_5 of { happy_var_5 ->
+ happyIn31
+ (Fun happy_var_1 happy_var_3 happy_var_5
+ ) `HappyStk` happyRest}}}
+
+happyReduce_29 = happySpecReduce_3 9# happyReduction_29
+happyReduction_29 happy_x_3
+ happy_x_2
+ happy_x_1
+ = case happyOut26 happy_x_1 of { happy_var_1 ->
+ case happyOut36 happy_x_3 of { happy_var_3 ->
+ happyIn32
+ (Lin happy_var_1 happy_var_3
+ )}}
+
+happyReduce_30 = happySpecReduce_3 10# happyReduction_30
+happyReduction_30 happy_x_3
+ happy_x_2
+ happy_x_1
+ = case happyOut42 happy_x_1 of { happy_var_1 ->
+ case happyOut26 happy_x_3 of { happy_var_3 ->
+ happyIn33
+ (Typ happy_var_1 happy_var_3
+ )}}
+
+happyReduce_31 = happyReduce 4# 11# happyReduction_31
+happyReduction_31 (happy_x_4 `HappyStk`
+ happy_x_3 `HappyStk`
+ happy_x_2 `HappyStk`
+ happy_x_1 `HappyStk`
+ happyRest)
+ = case happyOut35 happy_x_2 of { happy_var_2 ->
+ case happyOut44 happy_x_3 of { happy_var_3 ->
+ happyIn34
+ (Tr happy_var_2 (reverse happy_var_3)
+ ) `HappyStk` happyRest}}
+
+happyReduce_32 = happySpecReduce_1 11# happyReduction_32
+happyReduction_32 happy_x_1
+ = case happyOut35 happy_x_1 of { happy_var_1 ->
+ happyIn34
+ (trA_ happy_var_1
+ )}
+
+happyReduce_33 = happySpecReduce_1 12# happyReduction_33
+happyReduction_33 happy_x_1
+ = case happyOut26 happy_x_1 of { happy_var_1 ->
+ happyIn35
+ (AC happy_var_1
+ )}
+
+happyReduce_34 = happySpecReduce_1 12# happyReduction_34
+happyReduction_34 happy_x_1
+ = case happyOut23 happy_x_1 of { happy_var_1 ->
+ happyIn35
+ (AS happy_var_1
+ )}
+
+happyReduce_35 = happySpecReduce_1 12# happyReduction_35
+happyReduction_35 happy_x_1
+ = case happyOut24 happy_x_1 of { happy_var_1 ->
+ happyIn35
+ (AI happy_var_1
+ )}
+
+happyReduce_36 = happySpecReduce_1 12# happyReduction_36
+happyReduction_36 happy_x_1
+ = case happyOut25 happy_x_1 of { happy_var_1 ->
+ happyIn35
+ (AF happy_var_1
+ )}
+
+happyReduce_37 = happySpecReduce_1 12# happyReduction_37
+happyReduction_37 happy_x_1
+ = happyIn35
+ (AM
+ )
+
+happyReduce_38 = happySpecReduce_3 13# happyReduction_38
+happyReduction_38 happy_x_3
+ happy_x_2
+ happy_x_1
+ = case happyOut43 happy_x_2 of { happy_var_2 ->
+ happyIn36
+ (R happy_var_2
+ )}
+
+happyReduce_39 = happyReduce 5# 13# happyReduction_39
+happyReduction_39 (happy_x_5 `HappyStk`
+ happy_x_4 `HappyStk`
+ happy_x_3 `HappyStk`
+ happy_x_2 `HappyStk`
+ happy_x_1 `HappyStk`
+ happyRest)
+ = case happyOut36 happy_x_2 of { happy_var_2 ->
+ case happyOut36 happy_x_4 of { happy_var_4 ->
+ happyIn36
+ (P happy_var_2 happy_var_4
+ ) `HappyStk` happyRest}}
+
+happyReduce_40 = happySpecReduce_3 13# happyReduction_40
+happyReduction_40 happy_x_3
+ happy_x_2
+ happy_x_1
+ = case happyOut43 happy_x_2 of { happy_var_2 ->
+ happyIn36
+ (S happy_var_2
+ )}
+
+happyReduce_41 = happySpecReduce_1 13# happyReduction_41
+happyReduction_41 happy_x_1
+ = case happyOut37 happy_x_1 of { happy_var_1 ->
+ happyIn36
+ (K happy_var_1
+ )}
+
+happyReduce_42 = happySpecReduce_2 13# happyReduction_42
+happyReduction_42 happy_x_2
+ happy_x_1
+ = case happyOut24 happy_x_2 of { happy_var_2 ->
+ happyIn36
+ (V happy_var_2
+ )}
+
+happyReduce_43 = happySpecReduce_1 13# happyReduction_43
+happyReduction_43 happy_x_1
+ = case happyOut24 happy_x_1 of { happy_var_1 ->
+ happyIn36
+ (C happy_var_1
+ )}
+
+happyReduce_44 = happySpecReduce_1 13# happyReduction_44
+happyReduction_44 happy_x_1
+ = case happyOut26 happy_x_1 of { happy_var_1 ->
+ happyIn36
+ (F happy_var_1
+ )}
+
+happyReduce_45 = happySpecReduce_3 13# happyReduction_45
+happyReduction_45 happy_x_3
+ happy_x_2
+ happy_x_1
+ = case happyOut43 happy_x_2 of { happy_var_2 ->
+ happyIn36
+ (FV happy_var_2
+ )}
+
+happyReduce_46 = happyReduce 5# 13# happyReduction_46
+happyReduction_46 (happy_x_5 `HappyStk`
+ happy_x_4 `HappyStk`
+ happy_x_3 `HappyStk`
+ happy_x_2 `HappyStk`
+ happy_x_1 `HappyStk`
+ happyRest)
+ = case happyOut23 happy_x_2 of { happy_var_2 ->
+ case happyOut36 happy_x_4 of { happy_var_4 ->
+ happyIn36
+ (W happy_var_2 happy_var_4
+ ) `HappyStk` happyRest}}
+
+happyReduce_47 = happyReduce 5# 13# happyReduction_47
+happyReduction_47 (happy_x_5 `HappyStk`
+ happy_x_4 `HappyStk`
+ happy_x_3 `HappyStk`
+ happy_x_2 `HappyStk`
+ happy_x_1 `HappyStk`
+ happyRest)
+ = case happyOut36 happy_x_2 of { happy_var_2 ->
+ case happyOut36 happy_x_4 of { happy_var_4 ->
+ happyIn36
+ (RP happy_var_2 happy_var_4
+ ) `HappyStk` happyRest}}
+
+happyReduce_48 = happySpecReduce_1 13# happyReduction_48
+happyReduction_48 happy_x_1
+ = happyIn36
+ (TM
+ )
+
+happyReduce_49 = happyReduce 5# 13# happyReduction_49
+happyReduction_49 (happy_x_5 `HappyStk`
+ happy_x_4 `HappyStk`
+ happy_x_3 `HappyStk`
+ happy_x_2 `HappyStk`
+ happy_x_1 `HappyStk`
+ happyRest)
+ = case happyOut26 happy_x_2 of { happy_var_2 ->
+ case happyOut36 happy_x_4 of { happy_var_4 ->
+ happyIn36
+ (L happy_var_2 happy_var_4
+ ) `HappyStk` happyRest}}
+
+happyReduce_50 = happySpecReduce_2 13# happyReduction_50
+happyReduction_50 happy_x_2
+ happy_x_1
+ = case happyOut26 happy_x_2 of { happy_var_2 ->
+ happyIn36
+ (BV happy_var_2
+ )}
+
+happyReduce_51 = happySpecReduce_1 14# happyReduction_51
+happyReduction_51 happy_x_1
+ = case happyOut23 happy_x_1 of { happy_var_1 ->
+ happyIn37
+ (KS happy_var_1
+ )}
+
+happyReduce_52 = happyReduce 7# 14# happyReduction_52
+happyReduction_52 (happy_x_7 `HappyStk`
+ happy_x_6 `HappyStk`
+ happy_x_5 `HappyStk`
+ happy_x_4 `HappyStk`
+ happy_x_3 `HappyStk`
+ happy_x_2 `HappyStk`
+ happy_x_1 `HappyStk`
+ happyRest)
+ = case happyOut45 happy_x_3 of { happy_var_3 ->
+ case happyOut46 happy_x_5 of { happy_var_5 ->
+ happyIn37
+ (KP (reverse happy_var_3) happy_var_5
+ ) `HappyStk` happyRest}}
+
+happyReduce_53 = happySpecReduce_3 15# happyReduction_53
+happyReduction_53 happy_x_3
+ happy_x_2
+ happy_x_1
+ = case happyOut45 happy_x_1 of { happy_var_1 ->
+ case happyOut45 happy_x_3 of { happy_var_3 ->
+ happyIn38
+ (Var (reverse happy_var_1) (reverse happy_var_3)
+ )}}
+
+happyReduce_54 = happySpecReduce_0 16# happyReduction_54
+happyReduction_54 = happyIn39
+ ([]
+ )
+
+happyReduce_55 = happySpecReduce_3 16# happyReduction_55
+happyReduction_55 happy_x_3
+ happy_x_2
+ happy_x_1
+ = case happyOut39 happy_x_1 of { happy_var_1 ->
+ case happyOut30 happy_x_2 of { happy_var_2 ->
+ happyIn39
+ (flip (:) happy_var_1 happy_var_2
+ )}}
+
+happyReduce_56 = happySpecReduce_0 17# happyReduction_56
+happyReduction_56 = happyIn40
+ ([]
+ )
+
+happyReduce_57 = happySpecReduce_3 17# happyReduction_57
+happyReduction_57 happy_x_3
+ happy_x_2
+ happy_x_1
+ = case happyOut40 happy_x_1 of { happy_var_1 ->
+ case happyOut31 happy_x_2 of { happy_var_2 ->
+ happyIn40
+ (flip (:) happy_var_1 happy_var_2
+ )}}
+
+happyReduce_58 = happySpecReduce_0 18# happyReduction_58
+happyReduction_58 = happyIn41
+ ([]
+ )
+
+happyReduce_59 = happySpecReduce_3 18# happyReduction_59
+happyReduction_59 happy_x_3
+ happy_x_2
+ happy_x_1
+ = case happyOut41 happy_x_1 of { happy_var_1 ->
+ case happyOut32 happy_x_2 of { happy_var_2 ->
+ happyIn41
+ (flip (:) happy_var_1 happy_var_2
+ )}}
+
+happyReduce_60 = happySpecReduce_0 19# happyReduction_60
+happyReduction_60 = happyIn42
+ ([]
+ )
+
+happyReduce_61 = happySpecReduce_1 19# happyReduction_61
+happyReduction_61 happy_x_1
+ = case happyOut26 happy_x_1 of { happy_var_1 ->
+ happyIn42
+ ((:[]) happy_var_1
+ )}
+
+happyReduce_62 = happySpecReduce_3 19# happyReduction_62
+happyReduction_62 happy_x_3
+ happy_x_2
+ happy_x_1
+ = case happyOut26 happy_x_1 of { happy_var_1 ->
+ case happyOut42 happy_x_3 of { happy_var_3 ->
+ happyIn42
+ ((:) happy_var_1 happy_var_3
+ )}}
+
+happyReduce_63 = happySpecReduce_0 20# happyReduction_63
+happyReduction_63 = happyIn43
+ ([]
+ )
+
+happyReduce_64 = happySpecReduce_1 20# happyReduction_64
+happyReduction_64 happy_x_1
+ = case happyOut36 happy_x_1 of { happy_var_1 ->
+ happyIn43
+ ((:[]) happy_var_1
+ )}
+
+happyReduce_65 = happySpecReduce_3 20# happyReduction_65
+happyReduction_65 happy_x_3
+ happy_x_2
+ happy_x_1
+ = case happyOut36 happy_x_1 of { happy_var_1 ->
+ case happyOut43 happy_x_3 of { happy_var_3 ->
+ happyIn43
+ ((:) happy_var_1 happy_var_3
+ )}}
+
+happyReduce_66 = happySpecReduce_0 21# happyReduction_66
+happyReduction_66 = happyIn44
+ ([]
+ )
+
+happyReduce_67 = happySpecReduce_2 21# happyReduction_67
+happyReduction_67 happy_x_2
+ happy_x_1
+ = case happyOut44 happy_x_1 of { happy_var_1 ->
+ case happyOut34 happy_x_2 of { happy_var_2 ->
+ happyIn44
+ (flip (:) happy_var_1 happy_var_2
+ )}}
+
+happyReduce_68 = happySpecReduce_0 22# happyReduction_68
+happyReduction_68 = happyIn45
+ ([]
+ )
+
+happyReduce_69 = happySpecReduce_2 22# happyReduction_69
+happyReduction_69 happy_x_2
+ happy_x_1
+ = case happyOut45 happy_x_1 of { happy_var_1 ->
+ case happyOut23 happy_x_2 of { happy_var_2 ->
+ happyIn45
+ (flip (:) happy_var_1 happy_var_2
+ )}}
+
+happyReduce_70 = happySpecReduce_0 23# happyReduction_70
+happyReduction_70 = happyIn46
+ ([]
+ )
+
+happyReduce_71 = happySpecReduce_1 23# happyReduction_71
+happyReduction_71 happy_x_1
+ = case happyOut38 happy_x_1 of { happy_var_1 ->
+ happyIn46
+ ((:[]) happy_var_1
+ )}
+
+happyReduce_72 = happySpecReduce_3 23# happyReduction_72
+happyReduction_72 happy_x_3
+ happy_x_2
+ happy_x_1
+ = case happyOut38 happy_x_1 of { happy_var_1 ->
+ case happyOut46 happy_x_3 of { happy_var_3 ->
+ happyIn46
+ ((:) happy_var_1 happy_var_3
+ )}}
+
+happyNewToken action sts stk [] =
+ happyDoAction 30# notHappyAtAll action sts stk []
+
+happyNewToken action sts stk (tk:tks) =
+ let cont i = happyDoAction i tk action sts stk tks in
+ case tk of {
+ PT _ (TS ";") -> cont 1#;
+ PT _ (TS "(") -> cont 2#;
+ PT _ (TS ")") -> cont 3#;
+ PT _ (TS "{") -> cont 4#;
+ PT _ (TS "}") -> cont 5#;
+ PT _ (TS ":") -> cont 6#;
+ PT _ (TS "=") -> cont 7#;
+ PT _ (TS "->") -> cont 8#;
+ PT _ (TS "?") -> cont 9#;
+ PT _ (TS "[") -> cont 10#;
+ PT _ (TS "]") -> cont 11#;
+ PT _ (TS "!") -> cont 12#;
+ PT _ (TS "$") -> cont 13#;
+ PT _ (TS "[|") -> cont 14#;
+ PT _ (TS "|]") -> cont 15#;
+ PT _ (TS "+") -> cont 16#;
+ PT _ (TS "@") -> cont 17#;
+ PT _ (TS "#") -> cont 18#;
+ PT _ (TS "/") -> cont 19#;
+ PT _ (TS ",") -> cont 20#;
+ PT _ (TS "abstract") -> cont 21#;
+ PT _ (TS "concrete") -> cont 22#;
+ PT _ (TS "grammar") -> cont 23#;
+ PT _ (TS "pre") -> cont 24#;
+ PT _ (TL happy_dollar_dollar) -> cont 25#;
+ PT _ (TI happy_dollar_dollar) -> cont 26#;
+ PT _ (TD happy_dollar_dollar) -> cont 27#;
+ PT _ (T_CId happy_dollar_dollar) -> cont 28#;
+ _ -> cont 29#;
+ _ -> happyError' (tk:tks)
+ }
+
+happyError_ tk tks = happyError' (tk:tks)
+
+happyThen :: () => Err a -> (a -> Err b) -> Err b
+happyThen = (thenM)
+happyReturn :: () => a -> Err a
+happyReturn = (returnM)
+happyThen1 m k tks = (thenM) m (\a -> k a tks)
+happyReturn1 :: () => a -> b -> Err a
+happyReturn1 = \a tks -> (returnM) a
+happyError' :: () => [Token] -> Err a
+happyError' = happyError
+
+pGrammar tks = happySomeParser where
+ happySomeParser = happyThen (happyParse 0# tks) (\x -> happyReturn (happyOut27 x))
+
+pHeader tks = happySomeParser where
+ happySomeParser = happyThen (happyParse 1# tks) (\x -> happyReturn (happyOut28 x))
+
+pAbstract tks = happySomeParser where
+ happySomeParser = happyThen (happyParse 2# tks) (\x -> happyReturn (happyOut29 x))
+
+pConcrete tks = happySomeParser where
+ happySomeParser = happyThen (happyParse 3# tks) (\x -> happyReturn (happyOut30 x))
+
+pAbsDef tks = happySomeParser where
+ happySomeParser = happyThen (happyParse 4# tks) (\x -> happyReturn (happyOut31 x))
+
+pCncDef tks = happySomeParser where
+ happySomeParser = happyThen (happyParse 5# tks) (\x -> happyReturn (happyOut32 x))
+
+pType tks = happySomeParser where
+ happySomeParser = happyThen (happyParse 6# tks) (\x -> happyReturn (happyOut33 x))
+
+pExp tks = happySomeParser where
+ happySomeParser = happyThen (happyParse 7# tks) (\x -> happyReturn (happyOut34 x))
+
+pAtom tks = happySomeParser where
+ happySomeParser = happyThen (happyParse 8# tks) (\x -> happyReturn (happyOut35 x))
+
+pTerm tks = happySomeParser where
+ happySomeParser = happyThen (happyParse 9# tks) (\x -> happyReturn (happyOut36 x))
+
+pTokn tks = happySomeParser where
+ happySomeParser = happyThen (happyParse 10# tks) (\x -> happyReturn (happyOut37 x))
+
+pVariant tks = happySomeParser where
+ happySomeParser = happyThen (happyParse 11# tks) (\x -> happyReturn (happyOut38 x))
+
+pListConcrete tks = happySomeParser where
+ happySomeParser = happyThen (happyParse 12# tks) (\x -> happyReturn (happyOut39 x))
+
+pListAbsDef tks = happySomeParser where
+ happySomeParser = happyThen (happyParse 13# tks) (\x -> happyReturn (happyOut40 x))
+
+pListCncDef tks = happySomeParser where
+ happySomeParser = happyThen (happyParse 14# tks) (\x -> happyReturn (happyOut41 x))
+
+pListCId tks = happySomeParser where
+ happySomeParser = happyThen (happyParse 15# tks) (\x -> happyReturn (happyOut42 x))
+
+pListTerm tks = happySomeParser where
+ happySomeParser = happyThen (happyParse 16# tks) (\x -> happyReturn (happyOut43 x))
+
+pListExp tks = happySomeParser where
+ happySomeParser = happyThen (happyParse 17# tks) (\x -> happyReturn (happyOut44 x))
+
+pListString tks = happySomeParser where
+ happySomeParser = happyThen (happyParse 18# tks) (\x -> happyReturn (happyOut45 x))
+
+pListVariant tks = happySomeParser where
+ happySomeParser = happyThen (happyParse 19# tks) (\x -> happyReturn (happyOut46 x))
+
+happySeq = happyDontSeq
+
+
+returnM :: a -> Err a
+returnM = return
+
+thenM :: Err a -> (a -> Err b) -> Err b
+thenM = (>>=)
+
+happyError :: [Token] -> Err a
+happyError ts =
+ Bad $ "syntax error at " ++ tokenPos ts ++
+ case ts of
+ [] -> []
+ [Err _] -> " due to lexer error"
+ _ -> " before " ++ unwords (map prToken (take 4 ts))
+
+myLexer = tokens
+trA_ a_ = Tr a_ []
+{-# LINE 1 "GenericTemplate.hs" #-}
+{-# LINE 1 "" #-}
+{-# LINE 1 "" #-}
+{-# LINE 1 "GenericTemplate.hs" #-}
+-- Id: GenericTemplate.hs,v 1.26 2005/01/14 14:47:22 simonmar Exp
+
+{-# LINE 28 "GenericTemplate.hs" #-}
+
+
+data Happy_IntList = HappyCons Int# Happy_IntList
+
+
+
+
+
+{-# LINE 49 "GenericTemplate.hs" #-}
+
+{-# LINE 59 "GenericTemplate.hs" #-}
+
+{-# LINE 68 "GenericTemplate.hs" #-}
+
+infixr 9 `HappyStk`
+data HappyStk a = HappyStk a (HappyStk a)
+
+-----------------------------------------------------------------------------
+-- starting the parse
+
+happyParse start_state = happyNewToken start_state notHappyAtAll notHappyAtAll
+
+-----------------------------------------------------------------------------
+-- Accepting the parse
+
+-- If the current token is 0#, it means we've just accepted a partial
+-- parse (a %partial parser). We must ignore the saved token on the top of
+-- the stack in this case.
+happyAccept 0# tk st sts (_ `HappyStk` ans `HappyStk` _) =
+ happyReturn1 ans
+happyAccept j tk st sts (HappyStk ans _) =
+ (happyTcHack j (happyTcHack st)) (happyReturn1 ans)
+
+-----------------------------------------------------------------------------
+-- Arrays only: do the next action
+
+
+
+happyDoAction i tk st
+ = {- nothing -}
+
+
+ case action of
+ 0# -> {- nothing -}
+ happyFail i tk st
+ -1# -> {- nothing -}
+ happyAccept i tk st
+ n | (n <# (0# :: Int#)) -> {- nothing -}
+
+ (happyReduceArr ! rule) i tk st
+ where rule = (I# ((negateInt# ((n +# (1# :: Int#))))))
+ n -> {- nothing -}
+
+
+ happyShift new_state i tk st
+ where new_state = (n -# (1# :: Int#))
+ where off = indexShortOffAddr happyActOffsets st
+ off_i = (off +# i)
+ check = if (off_i >=# (0# :: Int#))
+ then (indexShortOffAddr happyCheck off_i ==# i)
+ else False
+ action | check = indexShortOffAddr happyTable off_i
+ | otherwise = indexShortOffAddr happyDefActions st
+
+{-# LINE 127 "GenericTemplate.hs" #-}
+
+
+indexShortOffAddr (HappyA# arr) off =
+#if __GLASGOW_HASKELL__ > 500
+ narrow16Int# i
+#elif __GLASGOW_HASKELL__ == 500
+ intToInt16# i
+#else
+ (i `iShiftL#` 16#) `iShiftRA#` 16#
+#endif
+ where
+#if __GLASGOW_HASKELL__ >= 503
+ i = word2Int# ((high `uncheckedShiftL#` 8#) `or#` low)
+#else
+ i = word2Int# ((high `shiftL#` 8#) `or#` low)
+#endif
+ high = int2Word# (ord# (indexCharOffAddr# arr (off' +# 1#)))
+ low = int2Word# (ord# (indexCharOffAddr# arr off'))
+ off' = off *# 2#
+
+
+
+
+
+data HappyAddr = HappyA# Addr#
+
+
+
+
+-----------------------------------------------------------------------------
+-- HappyState data type (not arrays)
+
+{-# LINE 170 "GenericTemplate.hs" #-}
+
+-----------------------------------------------------------------------------
+-- Shifting a token
+
+happyShift new_state 0# tk st sts stk@(x `HappyStk` _) =
+ let i = (case unsafeCoerce# x of { (I# (i)) -> i }) in
+-- trace "shifting the error token" $
+ happyDoAction i tk new_state (HappyCons (st) (sts)) (stk)
+
+happyShift new_state i tk st sts stk =
+ happyNewToken new_state (HappyCons (st) (sts)) ((happyInTok (tk))`HappyStk`stk)
+
+-- happyReduce is specialised for the common cases.
+
+happySpecReduce_0 i fn 0# tk st sts stk
+ = happyFail 0# tk st sts stk
+happySpecReduce_0 nt fn j tk st@((action)) sts stk
+ = happyGoto nt j tk st (HappyCons (st) (sts)) (fn `HappyStk` stk)
+
+happySpecReduce_1 i fn 0# tk st sts stk
+ = happyFail 0# tk st sts stk
+happySpecReduce_1 nt fn j tk _ sts@((HappyCons (st@(action)) (_))) (v1`HappyStk`stk')
+ = let r = fn v1 in
+ happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))
+
+happySpecReduce_2 i fn 0# tk st sts stk
+ = happyFail 0# tk st sts stk
+happySpecReduce_2 nt fn j tk _ (HappyCons (_) (sts@((HappyCons (st@(action)) (_))))) (v1`HappyStk`v2`HappyStk`stk')
+ = let r = fn v1 v2 in
+ happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))
+
+happySpecReduce_3 i fn 0# tk st sts stk
+ = happyFail 0# tk st sts stk
+happySpecReduce_3 nt fn j tk _ (HappyCons (_) ((HappyCons (_) (sts@((HappyCons (st@(action)) (_))))))) (v1`HappyStk`v2`HappyStk`v3`HappyStk`stk')
+ = let r = fn v1 v2 v3 in
+ happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))
+
+happyReduce k i fn 0# tk st sts stk
+ = happyFail 0# tk st sts stk
+happyReduce k nt fn j tk st sts stk
+ = case happyDrop (k -# (1# :: Int#)) sts of
+ sts1@((HappyCons (st1@(action)) (_))) ->
+ let r = fn stk in -- it doesn't hurt to always seq here...
+ happyDoSeq r (happyGoto nt j tk st1 sts1 r)
+
+happyMonadReduce k nt fn 0# tk st sts stk
+ = happyFail 0# tk st sts stk
+happyMonadReduce k nt fn j tk st sts stk =
+ happyThen1 (fn stk tk) (\r -> happyGoto nt j tk st1 sts1 (r `HappyStk` drop_stk))
+ where sts1@((HappyCons (st1@(action)) (_))) = happyDrop k (HappyCons (st) (sts))
+ drop_stk = happyDropStk k stk
+
+happyMonad2Reduce k nt fn 0# tk st sts stk
+ = happyFail 0# tk st sts stk
+happyMonad2Reduce k nt fn j tk st sts stk =
+ happyThen1 (fn stk tk) (\r -> happyNewToken new_state sts1 (r `HappyStk` drop_stk))
+ where sts1@((HappyCons (st1@(action)) (_))) = happyDrop k (HappyCons (st) (sts))
+ drop_stk = happyDropStk k stk
+
+ off = indexShortOffAddr happyGotoOffsets st1
+ off_i = (off +# nt)
+ new_state = indexShortOffAddr happyTable off_i
+
+
+
+
+happyDrop 0# l = l
+happyDrop n (HappyCons (_) (t)) = happyDrop (n -# (1# :: Int#)) t
+
+happyDropStk 0# l = l
+happyDropStk n (x `HappyStk` xs) = happyDropStk (n -# (1#::Int#)) xs
+
+-----------------------------------------------------------------------------
+-- Moving to a new state after a reduction
+
+
+happyGoto nt j tk st =
+ {- nothing -}
+ happyDoAction j tk new_state
+ where off = indexShortOffAddr happyGotoOffsets st
+ off_i = (off +# nt)
+ new_state = indexShortOffAddr happyTable off_i
+
+
+
+
+-----------------------------------------------------------------------------
+-- Error recovery (0# is the error token)
+
+-- parse error if we are in recovery and we fail again
+happyFail 0# tk old_st _ stk =
+-- trace "failing" $
+ happyError_ tk
+
+{- We don't need state discarding for our restricted implementation of
+ "error". In fact, it can cause some bogus parses, so I've disabled it
+ for now --SDM
+
+-- discard a state
+happyFail 0# tk old_st (HappyCons ((action)) (sts))
+ (saved_tok `HappyStk` _ `HappyStk` stk) =
+-- trace ("discarding state, depth " ++ show (length stk)) $
+ happyDoAction 0# tk action sts ((saved_tok`HappyStk`stk))
+-}
+
+-- Enter error recovery: generate an error token,
+-- save the old token and carry on.
+happyFail i tk (action) sts stk =
+-- trace "entering error recovery" $
+ happyDoAction 0# tk action sts ( (unsafeCoerce# (I# (i))) `HappyStk` stk)
+
+-- Internal happy errors:
+
+notHappyAtAll = error "Internal Happy error\n"
+
+-----------------------------------------------------------------------------
+-- Hack to get the typechecker to accept our action functions
+
+
+happyTcHack :: Int# -> a -> a
+happyTcHack x y = y
+{-# INLINE happyTcHack #-}
+
+
+-----------------------------------------------------------------------------
+-- Seq-ing. If the --strict flag is given, then Happy emits
+-- happySeq = happyDoSeq
+-- otherwise it emits
+-- happySeq = happyDontSeq
+
+happyDoSeq, happyDontSeq :: a -> b -> b
+happyDoSeq a b = a `seq` b
+happyDontSeq a b = b
+
+-----------------------------------------------------------------------------
+-- Don't inline any functions from the template. GHC has a nasty habit
+-- of deciding to inline happyGoto everywhere, which increases the size of
+-- the generated parser quite a bit.
+
+
+{-# NOINLINE happyDoAction #-}
+{-# NOINLINE happyTable #-}
+{-# NOINLINE happyCheck #-}
+{-# NOINLINE happyActOffsets #-}
+{-# NOINLINE happyGotoOffsets #-}
+{-# NOINLINE happyDefActions #-}
+
+{-# NOINLINE happyShift #-}
+{-# NOINLINE happySpecReduce_0 #-}
+{-# NOINLINE happySpecReduce_1 #-}
+{-# NOINLINE happySpecReduce_2 #-}
+{-# NOINLINE happySpecReduce_3 #-}
+{-# NOINLINE happyReduce #-}
+{-# NOINLINE happyMonadReduce #-}
+{-# NOINLINE happyGoto #-}
+{-# NOINLINE happyFail #-}
+
+-- end of Happy Template.
diff --git a/src/tools/c/GFCC/Par.y b/src/tools/c/GFCC/Par.y
new file mode 100644
index 000000000..fa30981cb
--- /dev/null
+++ b/src/tools/c/GFCC/Par.y
@@ -0,0 +1,204 @@
+-- This Happy file was machine-generated by the BNF converter
+{
+{-# OPTIONS -fno-warn-incomplete-patterns -fno-warn-overlapping-patterns #-}
+module GFCC.Par where
+import GFCC.Abs
+import GFCC.Lex
+import GFCC.ErrM
+}
+
+%name pGrammar Grammar
+%name pHeader Header
+%name pAbstract Abstract
+%name pConcrete Concrete
+%name pAbsDef AbsDef
+%name pCncDef CncDef
+%name pType Type
+%name pExp Exp
+%name pAtom Atom
+%name pTerm Term
+%name pTokn Tokn
+%name pVariant Variant
+%name pListConcrete ListConcrete
+%name pListAbsDef ListAbsDef
+%name pListCncDef ListCncDef
+%name pListCId ListCId
+%name pListTerm ListTerm
+%name pListExp ListExp
+%name pListString ListString
+%name pListVariant ListVariant
+
+-- no lexer declaration
+%monad { Err } { thenM } { returnM }
+%tokentype { Token }
+
+%token
+ ';' { PT _ (TS ";") }
+ '(' { PT _ (TS "(") }
+ ')' { PT _ (TS ")") }
+ '{' { PT _ (TS "{") }
+ '}' { PT _ (TS "}") }
+ ':' { PT _ (TS ":") }
+ '=' { PT _ (TS "=") }
+ '->' { PT _ (TS "->") }
+ '?' { PT _ (TS "?") }
+ '[' { PT _ (TS "[") }
+ ']' { PT _ (TS "]") }
+ '!' { PT _ (TS "!") }
+ '$' { PT _ (TS "$") }
+ '[|' { PT _ (TS "[|") }
+ '|]' { PT _ (TS "|]") }
+ '+' { PT _ (TS "+") }
+ '@' { PT _ (TS "@") }
+ '#' { PT _ (TS "#") }
+ '/' { PT _ (TS "/") }
+ ',' { PT _ (TS ",") }
+ 'abstract' { PT _ (TS "abstract") }
+ 'concrete' { PT _ (TS "concrete") }
+ 'grammar' { PT _ (TS "grammar") }
+ 'pre' { PT _ (TS "pre") }
+
+L_quoted { PT _ (TL $$) }
+L_integ { PT _ (TI $$) }
+L_doubl { PT _ (TD $$) }
+L_CId { PT _ (T_CId $$) }
+L_err { _ }
+
+
+%%
+
+String :: { String } : L_quoted { $1 }
+Integer :: { Integer } : L_integ { (read $1) :: Integer }
+Double :: { Double } : L_doubl { (read $1) :: Double }
+CId :: { CId} : L_CId { CId ($1)}
+
+Grammar :: { Grammar }
+Grammar : Header ';' Abstract ';' ListConcrete { Grm $1 $3 (reverse $5) }
+
+
+Header :: { Header }
+Header : 'grammar' CId '(' ListCId ')' { Hdr $2 $4 }
+
+
+Abstract :: { Abstract }
+Abstract : 'abstract' '{' ListAbsDef '}' { Abs (reverse $3) }
+
+
+Concrete :: { Concrete }
+Concrete : 'concrete' CId '{' ListCncDef '}' { Cnc $2 (reverse $4) }
+
+
+AbsDef :: { AbsDef }
+AbsDef : CId ':' Type '=' Exp { Fun $1 $3 $5 }
+
+
+CncDef :: { CncDef }
+CncDef : CId '=' Term { Lin $1 $3 }
+
+
+Type :: { Type }
+Type : ListCId '->' CId { Typ $1 $3 }
+
+
+Exp :: { Exp }
+Exp : '(' Atom ListExp ')' { Tr $2 (reverse $3) }
+ | Atom { trA_ $1 }
+
+
+Atom :: { Atom }
+Atom : CId { AC $1 }
+ | String { AS $1 }
+ | Integer { AI $1 }
+ | Double { AF $1 }
+ | '?' { AM }
+
+
+Term :: { Term }
+Term : '[' ListTerm ']' { R $2 }
+ | '(' Term '!' Term ')' { P $2 $4 }
+ | '(' ListTerm ')' { S $2 }
+ | Tokn { K $1 }
+ | '$' Integer { V $2 }
+ | Integer { C $1 }
+ | CId { F $1 }
+ | '[|' ListTerm '|]' { FV $2 }
+ | '(' String '+' Term ')' { W $2 $4 }
+ | '(' Term '@' Term ')' { RP $2 $4 }
+ | '?' { TM }
+ | '(' CId '->' Term ')' { L $2 $4 }
+ | '#' CId { BV $2 }
+
+
+Tokn :: { Tokn }
+Tokn : String { KS $1 }
+ | '[' 'pre' ListString '[' ListVariant ']' ']' { KP (reverse $3) $5 }
+
+
+Variant :: { Variant }
+Variant : ListString '/' ListString { Var (reverse $1) (reverse $3) }
+
+
+ListConcrete :: { [Concrete] }
+ListConcrete : {- empty -} { [] }
+ | ListConcrete Concrete ';' { flip (:) $1 $2 }
+
+
+ListAbsDef :: { [AbsDef] }
+ListAbsDef : {- empty -} { [] }
+ | ListAbsDef AbsDef ';' { flip (:) $1 $2 }
+
+
+ListCncDef :: { [CncDef] }
+ListCncDef : {- empty -} { [] }
+ | ListCncDef CncDef ';' { flip (:) $1 $2 }
+
+
+ListCId :: { [CId] }
+ListCId : {- empty -} { [] }
+ | CId { (:[]) $1 }
+ | CId ',' ListCId { (:) $1 $3 }
+
+
+ListTerm :: { [Term] }
+ListTerm : {- empty -} { [] }
+ | Term { (:[]) $1 }
+ | Term ',' ListTerm { (:) $1 $3 }
+
+
+ListExp :: { [Exp] }
+ListExp : {- empty -} { [] }
+ | ListExp Exp { flip (:) $1 $2 }
+
+
+ListString :: { [String] }
+ListString : {- empty -} { [] }
+ | ListString String { flip (:) $1 $2 }
+
+
+ListVariant :: { [Variant] }
+ListVariant : {- empty -} { [] }
+ | Variant { (:[]) $1 }
+ | Variant ',' ListVariant { (:) $1 $3 }
+
+
+
+{
+
+returnM :: a -> Err a
+returnM = return
+
+thenM :: Err a -> (a -> Err b) -> Err b
+thenM = (>>=)
+
+happyError :: [Token] -> Err a
+happyError ts =
+ Bad $ "syntax error at " ++ tokenPos ts ++
+ case ts of
+ [] -> []
+ [Err _] -> " due to lexer error"
+ _ -> " before " ++ unwords (map prToken (take 4 ts))
+
+myLexer = tokens
+trA_ a_ = Tr a_ []
+}
+
diff --git a/src/tools/c/GFCC/Print.hs b/src/tools/c/GFCC/Print.hs
new file mode 100644
index 000000000..3697d8b0f
--- /dev/null
+++ b/src/tools/c/GFCC/Print.hs
@@ -0,0 +1,148 @@
+{-# OPTIONS_GHC -fglasgow-exts #-}
+module GFCC.Print where
+
+-- pretty-printer generated by the BNF converter
+
+import GFCC.Abs
+import Data.Char
+import Data.List (intersperse)
+
+-- the top-level printing method
+printTree :: Print a => a -> String
+printTree = render . prt 0
+
+type Doc = [ShowS] -> [ShowS]
+
+doc :: ShowS -> Doc
+doc = (:)
+
+render :: Doc -> String
+render d = rend 0 (map ($ "") $ d []) "" where
+ rend i ss = case ss of
+ "[" :ts -> showChar '[' . rend i ts
+ "(" :ts -> showChar '(' . rend i ts
+ "{" :ts -> showChar '{' . new (i+1) . rend (i+1) ts
+ "}" : ";":ts -> new (i-1) . space "}" . showChar ';' . new (i-1) . rend (i-1) ts
+ "}" :ts -> new (i-1) . showChar '}' . new (i-1) . rend (i-1) ts
+ ";" :ts -> showChar ';' . new i . rend i ts
+ t : "," :ts -> showString t . space "," . rend i ts
+ t : ")" :ts -> showString t . showChar ')' . rend i ts
+ t : "]" :ts -> showString t . showChar ']' . rend i ts
+ t :ts -> space t . rend i ts
+ _ -> id
+ new i = showChar '\n' . replicateS (2*i) (showChar ' ') . dropWhile isSpace
+ space t = showString t . (\s -> if null s then "" else (' ':s))
+
+parenth :: Doc -> Doc
+parenth ss = doc (showChar '(') . ss . doc (showChar ')')
+
+concatS :: [ShowS] -> ShowS
+concatS = foldr (.) id
+
+concatD :: [Doc] -> Doc
+concatD = foldr (.) id
+
+unwordsD :: [Doc] -> Doc
+unwordsD = concatD . intersperse (doc (showChar ' '))
+
+replicateS :: Int -> ShowS -> ShowS
+replicateS n f = concatS (replicate n f)
+
+-- the printer class does the job
+class Print a where
+ prt :: Int -> a -> Doc
+
+instance Print Char where
+ prt _ s = doc (showChar '\'' . mkEsc '\'' s . showChar '\'')
+
+instance Print String where
+ prt _ s = doc (showChar '"' . concatS (map (mkEsc '"') s) . showChar '"')
+
+mkEsc :: Char -> Char -> ShowS
+mkEsc q s = case s of
+ _ | s == q -> showChar '\\' . showChar s
+ '\\'-> showString "\\\\"
+ '\n' -> showString "\\n"
+ '\t' -> showString "\\t"
+ _ -> showChar s
+
+prPrec :: Int -> Int -> Doc -> Doc
+prPrec i j = if j prPrec _i 0 (concatD [prt 0 header , doc (showString ";") , prt 0 abstract , doc (showString ";") , prt 0 concretes])
+ Hdr cid cids -> prPrec _i 0 (concatD [doc (showString "grammar") , prt 0 cid , doc (showString "(") , prt 0 cids , doc (showString ")")])
+ Abs absdefs -> prPrec _i 0 (concatD [doc (showString "abstract") , doc (showString "{") , prt 0 absdefs , doc (showString "}")])
+ Cnc cid cncdefs -> prPrec _i 0 (concatD [doc (showString "concrete") , prt 0 cid , doc (showString "{") , prt 0 cncdefs , doc (showString "}")])
+ Fun cid type' exp -> prPrec _i 0 (concatD [prt 0 cid , doc (showString ":") , prt 0 type' , doc (showString "=") , prt 0 exp])
+ Lin cid term -> prPrec _i 0 (concatD [prt 0 cid , doc (showString "=") , prt 0 term])
+ Typ cids cid -> prPrec _i 0 (concatD [prt 0 cids , doc (showString "->") , prt 0 cid])
+ Tr atom exps -> prPrec _i 0 (concatD [doc (showString "(") , prt 0 atom , prt 0 exps , doc (showString ")")])
+ AC cid -> prPrec _i 0 (concatD [prt 0 cid])
+ AS str -> prPrec _i 0 (concatD [prt 0 str])
+ AI n -> prPrec _i 0 (concatD [prt 0 n])
+ AF d -> prPrec _i 0 (concatD [prt 0 d])
+ AM -> prPrec _i 0 (concatD [doc (showString "?")])
+ R terms -> prPrec _i 0 (concatD [doc (showString "[") , prt 0 terms , doc (showString "]")])
+ P term0 term1 -> prPrec _i 0 (concatD [doc (showString "(") , prt 0 term0 , doc (showString "!") , prt 0 term1 , doc (showString ")")])
+ S terms -> prPrec _i 0 (concatD [doc (showString "(") , prt 0 terms , doc (showString ")")])
+ K tokn -> prPrec _i 0 (concatD [prt 0 tokn])
+ V n -> prPrec _i 0 (concatD [doc (showString "$") , prt 0 n])
+ C n -> prPrec _i 0 (concatD [prt 0 n])
+ F cid -> prPrec _i 0 (concatD [prt 0 cid])
+ FV terms -> prPrec _i 0 (concatD [doc (showString "[|") , prt 0 terms , doc (showString "|]")])
+ W str term -> prPrec _i 0 (concatD [doc (showString "(") , prt 0 str , doc (showString "+") , prt 0 term , doc (showString ")")])
+ RP term0 term1 -> prPrec _i 0 (concatD [doc (showString "(") , prt 0 term0 , doc (showString "@") , prt 0 term1 , doc (showString ")")])
+ TM -> prPrec _i 0 (concatD [doc (showString "?")])
+ L cid term -> prPrec _i 0 (concatD [doc (showString "(") , prt 0 cid , doc (showString "->") , prt 0 term , doc (showString ")")])
+ BV cid -> prPrec _i 0 (concatD [doc (showString "#") , prt 0 cid])
+ KS str -> prPrec _i 0 (concatD [prt 0 str])
+ KP strs variants -> prPrec _i 0 (concatD [doc (showString "[") , doc (showString "pre") , prt 0 strs , doc (showString "[") , prt 0 variants , doc (showString "]") , doc (showString "]")])
+ Var strs0 strs1 -> prPrec _i 0 (concatD [prt 0 strs0 , doc (showString "/") , prt 0 strs1])
+ CId str -> prPrec _i 0 (doc (showString str))
+
+instance Print [Concrete] where
+ prt _ es = case es of
+ [] -> (concatD [])
+ x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs])
+instance Print [AbsDef] where
+ prt _ es = case es of
+ [] -> (concatD [])
+ x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs])
+instance Print [CncDef] where
+ prt _ es = case es of
+ [] -> (concatD [])
+ x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs])
+instance Print [CId] where
+ prt _ es = case es of
+ [] -> (concatD [])
+ [x] -> (concatD [prt 0 x])
+ x:xs -> (concatD [prt 0 x , doc (showString ",") , prt 0 xs])
+instance Print [Term] where
+ prt _ es = case es of
+ [] -> (concatD [])
+ [x] -> (concatD [prt 0 x])
+ x:xs -> (concatD [prt 0 x , doc (showString ",") , prt 0 xs])
+instance Print [Exp] where
+ prt _ es = case es of
+ [] -> (concatD [])
+ x:xs -> (concatD [prt 0 x , prt 0 xs])
+instance Print [String] where
+ prt _ es = case es of
+ [] -> (concatD [])
+ x:xs -> (concatD [prt 0 x , prt 0 xs])
+instance Print [Variant] where
+ prt _ es = case es of
+ [] -> (concatD [])
+ [x] -> (concatD [prt 0 x])
+ x:xs -> (concatD [prt 0 x , doc (showString ",") , prt 0 xs])
diff --git a/src/tools/c/GFCC/Test.hs b/src/tools/c/GFCC/Test.hs
new file mode 100644
index 000000000..e3c3bcc40
--- /dev/null
+++ b/src/tools/c/GFCC/Test.hs
@@ -0,0 +1,58 @@
+-- automatically generated by BNF Converter
+module Main where
+
+
+import IO ( stdin, hGetContents )
+import System ( getArgs, getProgName )
+
+import GFCC.Lex
+import GFCC.Par
+import GFCC.Skel
+import GFCC.Print
+import GFCC.Abs
+
+
+
+
+import GFCC.ErrM
+
+type ParseFun a = [Token] -> Err a
+
+myLLexer = myLexer
+
+type Verbosity = Int
+
+putStrV :: Verbosity -> String -> IO ()
+putStrV v s = if v > 1 then putStrLn s else return ()
+
+runFile :: (Print a, Show a) => Verbosity -> ParseFun a -> FilePath -> IO ()
+runFile v p f = putStrLn f >> readFile f >>= run v p
+
+run :: (Print a, Show a) => Verbosity -> ParseFun a -> String -> IO ()
+run v p s = let ts = myLLexer s in case p ts of
+ Bad s -> do putStrLn "\nParse Failed...\n"
+ putStrV v "Tokens:"
+ putStrV v $ show ts
+ putStrLn s
+ Ok tree -> do putStrLn "\nParse Successful!"
+ showTree v tree
+
+
+
+showTree :: (Show a, Print a) => Int -> a -> IO ()
+showTree v tree
+ = do
+ putStrV v $ "\n[Abstract Syntax]\n\n" ++ show tree
+ putStrV v $ "\n[Linearized tree]\n\n" ++ printTree tree
+
+main :: IO ()
+main = do args <- getArgs
+ case args of
+ [] -> hGetContents stdin >>= run 2 pGrammar
+ "-s":fs -> mapM_ (runFile 0 pGrammar) fs
+ fs -> mapM_ (runFile 2 pGrammar) fs
+
+
+
+
+
diff --git a/src/tools/c/Makefile b/src/tools/c/Makefile
new file mode 100644
index 000000000..189b224e2
--- /dev/null
+++ b/src/tools/c/Makefile
@@ -0,0 +1,25 @@
+GHC = ghc
+GHCFLAGS =
+
+.PHONY: all gfcc2c clean
+
+all: gfcc2c
+
+gfcc2c:
+ $(GHC) $(GHCFLAGS) --make -o $@ gfcc2c.hs
+
+bnfc:
+ bnfc -gadt -d ../../GF/Canon/GFCC/GFCC.cf
+ -rm -f GFCC/Doc.tex GFCC/Skel.hs
+ happy -gca GFCC/Par.y
+ alex -g GFCC/Lex.x
+
+clean:
+ -rm -f gfcc2c
+ -rm -f *.o *.hi
+ -rm -f GFCC/*.hi GFCC/*.o
+
+bnfcclean: clean
+ -rm -f GFCC/*.bak
+ -rm -f GFCC/Lex.* GFCC/Par.* GFCC/Layout.* GFCC/Skel.* GFCC/Print.* GFCC/Test.* GFCC/Abs.* GFCC/ComposOp.* GFCC/Test GFCC/ErrM.* GFCC/SharedString.*
+ -rmdir -p GFCC/
diff --git a/src/tools/c/examples/bronzeage/Makefile b/src/tools/c/examples/bronzeage/Makefile
new file mode 100644
index 000000000..67367920a
--- /dev/null
+++ b/src/tools/c/examples/bronzeage/Makefile
@@ -0,0 +1,47 @@
+
+GFDIR=../../../../../
+
+LIBGFCC_INCLUDES = $(GFDIR)/lib/c
+LIBGFCC_LIBDIR = $(GFDIR)/lib/c
+
+GFCC2C = $(GFDIR)/bin/gfcc2c
+
+TEST_PROG = bronzeage-test
+
+GRAMMAR_DIR = $(GFDIR)/examples/bronzeage
+
+GRAMMAR_MODULES = Bronzeage BronzeageEng BronzeageSwe
+
+GRAMMAR_H_FILES = $(addsuffix .h, $(GRAMMAR_MODULES))
+GRAMMAR_C_FILES = $(addsuffix .c, $(GRAMMAR_MODULES))
+GRAMMAR_O_FILES = $(addsuffix .o, $(GRAMMAR_MODULES))
+
+CFLAGS += -O2
+CPPFLAGS += -I$(LIBGFCC_INCLUDES)
+
+.PHONY: clean
+
+all: bronzeage.gfcc $(TEST_PROG)
+
+$(TEST_PROG): $(GRAMMAR_O_FILES) $(TEST_PROG).o $(LIBGFCC_LIBDIR)/libgfcc.a
+
+$(TEST_PROG).o: $(GRAMMAR_H_FILES) $(GRAMMAR_O_FILES) $(TEST_PROG).c
+
+$(GRAMMAR_H_FILES) $(GRAMMAR_C_FILES): $(GFCC2C) bronzeage.gfcc
+ $(GFCC2C) bronzeage.gfcc
+
+bronzeage.gfcc:
+ echo "i -optimize=all $(GRAMMAR_DIR)/BronzeageEng.gf" > mkBronzeage.gfs
+ echo "i -optimize=all $(GRAMMAR_DIR)/BronzeageSwe.gf" >> mkBronzeage.gfs
+ echo "s" >> mkBronzeage.gfs
+ echo "pm -printer=gfcc | wf bronzeage.gfcc" >> mkBronzeage.gfs
+ cat mkBronzeage.gfs | gf
+ rm -f mkBronzeage.gfs
+
+clean:
+ -rm -f $(TEST_PROG) *.o
+
+
+distclean: clean
+ -rm -f $(GRAMMAR_H_FILES) $(GRAMMAR_C_FILES)
+ -rm -f bronzeage.gfcc
diff --git a/src/tools/c/examples/bronzeage/bronzeage-test.c b/src/tools/c/examples/bronzeage/bronzeage-test.c
new file mode 100644
index 000000000..c0bee93a2
--- /dev/null
+++ b/src/tools/c/examples/bronzeage/bronzeage-test.c
@@ -0,0 +1,31 @@
+#include "Bronzeage.h"
+
+#include "BronzeageEng.h"
+
+#include
+
+int main() {
+ Tree *tree =
+ mk_PhrPos(
+ mk_SentV(
+ mk_lie_V(),
+ mk_NumCN(
+ mk_two_Num(),
+ mk_UseN(mk_wife_N())
+ )
+ )
+ );
+
+ int i;
+
+ for (i = 0; i < 1000; i++) {
+ Term *term;
+ term = BronzeageEng_lin(tree);
+ term_print(stdout, term);
+ fputs("\n", stdout);
+ }
+
+ tree_free(tree);
+
+ return 0;
+}
diff --git a/src/tools/c/gfcc2c.hs b/src/tools/c/gfcc2c.hs
new file mode 100644
index 000000000..75eb10fb8
--- /dev/null
+++ b/src/tools/c/gfcc2c.hs
@@ -0,0 +1,223 @@
+import GFCC.Abs
+import GFCC.ErrM
+import GFCC.Lex
+import GFCC.Par
+
+import Control.Monad
+import Data.Char
+import Data.List
+import Numeric
+import System.Environment
+import System.Exit
+import System.IO
+
+constrType :: Grammar -> String
+constrType g = unlines $
+ ["typedef enum { "]
+ ++ map (\x -> " " ++ x ++ "," ) ds
+ ++ ["} Fun;"]
+ where fs = [id2c n | (n,_) <- constructors g ]
+ ds = case fs of
+ [] -> []
+ (x:xs) -> (x ++ " = ATOM_FIRST_FUN"):xs
+
+mkFunSigs :: Grammar -> String
+mkFunSigs g = unlines [mkFunSig n ats | (n,(ats,_)) <- constructors g]
+
+mkFunSig :: CId -> [CId] -> String
+mkFunSig n ats =
+ "extern Tree *mk_" ++ id2c n ++ "(" ++ commaSep adecls ++ ");"
+ where
+ adecls = map ("Tree *" ++) args
+ args = [ "x" ++ show x | x <- [0..c-1] ]
+ c = length ats
+
+mkFuns :: Grammar -> String
+mkFuns g = unlines [mkFun n ats | (n,(ats,_)) <- constructors g]
+
+mkFun :: CId -> [CId] -> String
+mkFun n ats = unlines $
+ ["extern Tree *mk_" ++ id2c n ++ "(" ++ commaSep adecls ++ ") {",
+ " Tree *t = tree_fun(" ++ id2c n ++ "," ++ show c ++ ");"]
+ ++ [" tree_set_child(" ++ commaSep ["t",show i, args!!i] ++ ");" | i <- [0..c-1]]
+ ++ [" return t;",
+ "}"]
+ where
+ adecls = map ("Tree *" ++) args
+ args = [ "x" ++ show x | x <- [0..c-1] ]
+ c = length ats
+
+doDie :: String -> [String] -> [String]
+doDie s args = ["fprintf(" ++ commaSep ("stderr":show s':args) ++ ");",
+ "exit(1);"]
+ where s' = "Error: " ++ s ++ "\n"
+
+mkLin :: Grammar -> CId -> String
+mkLin g l = unlines $
+ ["extern Term *" ++ langLinName_ l ++ "(Tree *t) {",
+ " Term **cs = NULL;",
+ " int n = arity(t);",
+ " if (n > 0) {",
+ " int i;",
+ " cs = (Term**)term_alloc(n * sizeof(Term *));", -- FIXME: handle failure
+ " for (i = 0; i < n; i++) {",
+ " cs[i] = " ++ langLinName_ l ++ "(tree_get_child(t,i));",
+ " }",
+ " }",
+ "",
+ " switch (t->type) {",
+ " case ATOM_STRING: return term_str(t->value.string_value);",
+-- " case ATOM_INTEGER: return NULL;", -- FIXME!
+-- " case ATOM_DOUBLE: return NULL;", -- FIXME!
+ " case ATOM_META: return term_meta();"]
+ ++ [" case " ++ id2c n ++ ": return " ++ linFunName n ++ "(cs);"
+ | (n,_) <- constructors g]
+ ++ [" default: "]
+ ++ map (" " ++) (doDie (langLinName_ l ++ " %d") ["t->type"])
+ ++ [" return NULL;",
+ " }",
+ "}",
+ "",
+ "extern Term *" ++ langLinName l ++ "(Tree *t) {",
+ " Term *r;",
+ " term_alloc_pool(1000000);", -- FIXME: size?
+ " r = " ++ langLinName_ l ++ "(t);",
+ " /* term_free_pool(); */", -- FIXME: copy term?
+ " return r;",
+ "}"]
+
+langLinName :: CId -> String
+langLinName n = id2c n ++ "_lin"
+
+langLinName_ :: CId -> String
+langLinName_ n = id2c n ++ "_lin_"
+
+linFunName :: CId -> String
+linFunName n = "lin_" ++ id2c n
+
+
+mkLinFuns :: [CncDef] -> String
+mkLinFuns cs = unlines $ map mkLinFunSig cs ++ [""] ++ map mkLinFun cs
+
+mkLinFunSig :: CncDef -> String
+mkLinFunSig (Lin n t) =
+ "static Term *" ++ linFunName n ++ "(Term **cs);"
+
+mkLinFun :: CncDef -> String
+mkLinFun (Lin (CId n) t) | "__" `isPrefixOf` n = ""
+mkLinFun (Lin n t) = unlines [
+ "static Term *" ++ linFunName n ++ "(Term **cs) {",
+ " return " ++ term2c t ++ ";",
+ "}"
+ ]
+
+term2c :: Tree a -> String
+term2c t = case t of
+ -- terms
+ R terms -> fun "term_array" terms
+ -- an optimization of t!n where n is a constant int
+ P term0 (C n) -> "term_sel_int("++ term2c term0 ++ "," ++ show n ++ ")"
+ P term0 term1 -> "term_sel(" ++ term2c term0 ++ "," ++ term2c term1 ++ ")"
+ S terms -> fun "term_seq" terms
+ K tokn -> term2c tokn
+ V n -> "cs[" ++ show n ++ "]"
+ C n -> "term_int(" ++ show n ++ ")"
+ F cid -> linFunName cid ++ "(cs)"
+ FV terms -> fun "term_variants" terms
+ W str term -> "term_suffix(" ++ string2c str ++ "," ++ term2c term ++ ")"
+ RP term0 term1 -> "term_rp(" ++ term2c term0 ++ "," ++ term2c term1 ++ ")"
+ TM -> "term_meta()"
+ -- tokens
+ KS s -> "term_str(" ++ string2c s ++ ")"
+ KP strs vars -> error $ show t -- FIXME: pre token
+ _ -> error $ show t
+ where fun f ts = f ++ "(" ++ commaSep (show (length ts):map term2c ts) ++ ")"
+
+commaSep = concat . intersperse ","
+
+
+id2c :: CId -> String
+id2c (CId s) = s -- FIXME: convert ticks
+
+string2c :: String -> String
+string2c s = "\"" ++ concatEsc (map esc s) ++ "\""
+ where
+ esc c | isAscii c && isPrint c = [c]
+ esc '\n' = "\\n"
+ esc c = "\\x" ++ map toUpper (showHex (ord c) "")
+ concatEsc [] = ""
+ concatEsc (x:xs) | length x <= 2 = x ++ concatEsc xs
+ | otherwise = x ++ "\" \"" ++ concatEsc xs
+
+lang2file :: CId -> String -> String
+lang2file n ext = id2c n ++ "." ++ ext
+
+constructors :: Grammar -> [(CId, ([CId],CId))]
+constructors (Grm _ (Abs ads) _) = [(n,(ats,rt)) | Fun n (Typ ats rt) _ <- ads]
+
+absHFile :: Grammar -> FilePath
+absHFile (Grm (Hdr a _) _ _) = lang2file a "h"
+
+cncHFile :: Concrete -> FilePath
+cncHFile (Cnc l _) = lang2file l "h"
+
+mkAbsH :: Grammar -> String
+mkAbsH g = unlines ["#include \"gfcc-tree.h\"",
+ "#include \"gfcc-term.h\"",
+ constrType g,
+ "",
+ mkFunSigs g]
+
+mkAbsC :: Grammar -> String
+mkAbsC g = unlines [include (absHFile g),
+ "",
+ mkFuns g]
+
+mkCncH :: Grammar -> Concrete -> String
+mkCncH g (Cnc l _) = unlines
+ [include (absHFile g),
+ "",
+ "extern Term *" ++ langLinName l ++ "(Tree *);"]
+
+mkCncC :: Grammar -> Concrete -> String
+mkCncC g c@(Cnc l cds) = unlines $
+ ["#include ",
+ "#include ",
+ include (cncHFile c),
+ ""]
+ ++ [mkLinFuns cds, mkLin g l]
+
+mkH :: FilePath -> String -> (FilePath, String)
+mkH f c = (f, c')
+ where c' = unlines ["#ifndef " ++ s, "#define " ++ s, "", c, "#endif"]
+ s = [if x=='.' then '_' else toUpper x | x <- f]
+
+include :: FilePath -> String
+include f = "#include " ++ show f
+
+-- returns list of file name, file contents
+gfcc2c :: Grammar -> [(FilePath, String)]
+gfcc2c g@(Grm (Hdr a _) _ cs) =
+ [mkH (absHFile g) (mkAbsH g), (lang2file a "c", mkAbsC g)]
+ ++ concat [[mkH (cncHFile cnc) (mkCncH g cnc),(lang2file c "c", mkCncC g cnc)] | cnc@(Cnc c _) <- cs]
+
+parse :: String -> Err Grammar
+parse = pGrammar . myLexer
+
+die :: String -> IO ()
+die s = do hPutStrLn stderr "Usage: gfcc2c "
+ exitFailure
+
+createFile :: FilePath -> String -> IO ()
+createFile f c = do hPutStrLn stderr $ "Writing " ++ f ++ "..."
+ writeFile f c
+
+main :: IO ()
+main = do args <- getArgs
+ case args of
+ [file] -> do c <- readFile file
+ case parse c of
+ Bad err -> die err
+ Ok g -> do let fs = gfcc2c g
+ mapM_ (uncurry createFile) fs
+ _ -> die "Usage: gfcc2c "