EdkCompatibilityPkg/Other/Maintained/Tools/Pccts/sorcerer/h/astlib.h

   1 #ifndef astlib_h
   2 #define astlib_h
   3
   4 /*
   5  * astlib.h -- C ast_* library header
   6  *
   7  * SOFTWARE RIGHTS
   8  *
   9  * We reserve no LEGAL rights to SORCERER -- SORCERER is in the public
  10  * domain.  An individual or company may do whatever they wish with
  11  * source code distributed with SORCERER or the code generated by
  12  * SORCERER, including the incorporation of SORCERER, or its output, into
  13  * commerical software.
  14  *
  15  * We encourage users to develop software with SORCERER.  However, we do
  16  * ask that credit is given to us for developing SORCERER.  By "credit",
  17  * we mean that if you incorporate our source code into one of your
  18  * programs (commercial product, research project, or otherwise) that you
  19  * acknowledge this fact somewhere in the documentation, research report,
  20  * etc...  If you like SORCERER and have developed a nice tool with the
  21  * output, please mention that you developed it using SORCERER.  In
  22  * addition, we ask that this header remain intact in our source code.
  23  * As long as these guidelines are kept, we expect to continue enhancing
  24  * this system and expect to make other tools available as they are
  25  * completed.
  26  *
  27  * SORCERER 1.00B
  28  * Terence Parr
  29  * AHPCRC, University of Minnesota
  30  * 1992-1994
  31  */
  32 #include <setjmp.h>
  33 #include "sorcerer.h"
  34 #include "sorlist.h"
  35
  36 #define MaxTreeStackDepth  400
  37
  38 #ifdef __USE_PROTOS
  39 extern SORAST *ast_make(SORAST *rt, ...);
  40 extern SORAST *ast_find_all(SORAST *t, SORAST *u, SORAST **cursor);
  41 extern int ast_match(SORAST *t, SORAST *u);
  42 extern void ast_insert_after(SORAST *a, SORAST *b);
  43 extern void ast_append(SORAST *a, SORAST *b);
  44 extern SORAST *ast_tail(SORAST *a);
  45 extern SORAST *ast_bottom(SORAST *a);
  46 extern SORAST *ast_cut_between(SORAST *a, SORAST *b);
  47 extern SList *ast_to_slist(SORAST *t);
  48 extern SORAST *slist_to_ast(SList *list);
  49 extern void ast_free(SORAST *t);
  50 extern int ast_scan(char *template, SORAST *tree, ...);
  51 extern int ast_nsiblings(SORAST *t);
  52 extern SORAST *ast_sibling_index(SORAST *t, int i);
  53 extern int ast_match_partial(SORAST *t, SORAST *u);
  54 #else
  55 extern SORAST *ast_make();
  56 extern SORAST *ast_find_all();
  57 extern int ast_match();
  58 extern void ast_insert_after();
  59 extern void ast_append();
  60 extern SORAST *ast_tail();
  61 extern SORAST *ast_bottom();
  62 extern SORAST *ast_cut_between();
  63 extern SList *ast_to_slist();
  64 extern SORAST *slist_to_ast();
  65 extern void ast_free();
  66 extern int ast_scan();
  67 extern int ast_nsiblings();
  68 extern SORAST *ast_sibling_index();
  69 extern int ast_match_partial();
  70 #endif
  71
  72 #endif