#endif
/* Die Datei ist selber einer Konversion unterzogen worden und entsprechend */
/* lag hier alles auf dem Rcken: ~^°$õ (Lars D:lle) */
/*INTERFACE*/
#define ibmpc_a_uml 132
#define ibmpc_A_uml 142
#define ibmpc_o_uml 148
#define ibmpc_O_uml 153
#define ibmpc_u_uml 129
#define ibmpc_U_uml 154
#define ibmpc_sz 225
/*INTERFACE*/
#define latin_a_uml 228
#define latin_A_uml 196
#define latin_o_uml 246
#define latin_O_uml 214
#define latin_u_uml 252
#define latin_U_uml 220
#define latin_sz 223
/*I---------------------- ( German ) Character types ------------------------ */
bool ger_islower(char c)
/* german islower */
{
switch(c)
{
case ibmpc_a_uml:
case ibmpc_o_uml:
case ibmpc_u_uml:
case ibmpc_sz: return True;
case ibmpc_A_uml:
case ibmpc_O_uml:
case ibmpc_U_uml: return False;
default : return islower(c);
}
}
char ger_tolower(char c)
/* german tolower */
{
switch(c)
{
case ibmpc_a_uml:
case ibmpc_o_uml:
case ibmpc_u_uml:
case ibmpc_sz: return c;
case ibmpc_A_uml: return (char)ibmpc_a_uml;
case ibmpc_O_uml: return (char)ibmpc_o_uml;
case ibmpc_U_uml: return (char)ibmpc_u_uml;
default : return isupper(c)?tolower(c):c;
}
}
bool ger_isupper(char c)
/* german isupper */
{
switch(c)
{
case ibmpc_a_uml:
case ibmpc_o_uml:
case ibmpc_u_uml:
case ibmpc_sz: return False;
case ibmpc_A_uml:
case ibmpc_O_uml:
case ibmpc_U_uml: return True;
default : return isupper(c);
}
}
char ger_toupper(char c)
/* german toupper */
{
switch(c)
{
case ibmpc_sz:
case ibmpc_A_uml:
case ibmpc_O_uml:
case ibmpc_U_uml: return c;
case ibmpc_a_uml: return (char)ibmpc_A_uml;
case ibmpc_o_uml: return (char)ibmpc_O_uml;
case ibmpc_u_uml: return (char)ibmpc_U_uml;
default : return islower(c)?toupper(c):c;
}
}
bool ger_isprint(char c)
/* german isprint */
{
switch(c)
{
case ibmpc_a_uml:
case ibmpc_o_uml:
case ibmpc_u_uml:
case ibmpc_sz:
case ibmpc_A_uml:
case ibmpc_O_uml:
case ibmpc_U_uml: return True;
default :
/* isprint doesn't work */
//if( c <= 126 && c >= 32 ) return True;
if( isascii(c) && isprint(c) ) return True;
else return ! iscntrl(c);
}
}
static bool ger_char(char c)
/* whether 'c' is a special german character */
{
return
(
c == ibmpc_a_uml || c == ibmpc_o_uml ||
c == ibmpc_u_uml || c == ibmpc_sz ||
c == ibmpc_A_uml || c == ibmpc_O_uml || c == ibmpc_U_uml
) ? True : False;
}
int ger_charcmp(char l, char r)
/* l - r ( german ) */
{ bool gl = ger_char(l), gr = ger_char(r);
if( ! gl && ! gr ) return( l - r );
if( ! ( gl && gr ) )
{ char ll, rr; int res = 0;
/* res = -1 --> ll < rr */
if( gl ) { ll = l; rr = r; }
else { ll = r; rr = l; }
switch(ll)
{
case ibmpc_a_uml: res = ( rr <= 'a' ) ? 1 : -1; break;
case ibmpc_o_uml: res = ( rr <= 'o' ) ? 1 : -1; break;
case ibmpc_u_uml: res = ( rr <= 'u' ) ? 1 : -1; break;
case ibmpc_sz: res = ( rr <= 's' ) ? 1 : -1; break;
case ibmpc_A_uml: res = ( rr <= 'A' ) ? 1 : -1; break;
case ibmpc_O_uml: res = ( rr <= 'O' ) ? 1 : -1; break;
case ibmpc_U_uml: res = ( rr <= 'U' ) ? 1 : -1; break;
default : C_BUG;
}
return( ( ll == l ) ? res : res - 2 );
}
else
{ bool ugr;
if( l == r ) return( 0 );
ugr = ( r == ibmpc_A_uml || r == ibmpc_O_uml || r == ibmpc_U_uml );
switch(l)
{
case ibmpc_a_uml: return( ( ugr ) ? 1 : -1 );
case ibmpc_o_uml: return( ( ugr || r == ibmpc_a_uml ) ? 1 : -1 );
case ibmpc_sz:
return( ( ugr || r == ibmpc_a_uml || r == ibmpc_o_uml ) ? 1 : -1 );
case ibmpc_u_uml:
return
(
( ugr || r == ibmpc_a_uml || r == ibmpc_o_uml || r == ibmpc_sz )
? 1 : -1
);
case ibmpc_A_uml: return( -1 );
case ibmpc_O_uml: return( ( r == ibmpc_A_uml ) ? 1 : -1 );
case ibmpc_U_uml:
return( ( r == ibmpc_A_uml || r == ibmpc_O_uml ) ? 1 : -1 );
default : C_BUG;
}
}
return 0; /*dummy*/
}
/*I------------------------- Character conversion --------------------------- */
char umlaut_ascii_to_eascii(char c)
/* us ascii --> extended/OEM ascii */
{
switch(c)
{
case '{' : return (char)ibmpc_a_uml;
case '|' : return (char)ibmpc_o_uml;
case '}' : return (char)ibmpc_u_uml;
case '~' : return (char)ibmpc_sz;
case '[' : return (char)ibmpc_A_uml;
case '\\': return (char)ibmpc_O_uml;
case ']' : return (char)ibmpc_U_uml;
default : return c;
}
}
char umlaut_eascii_to_ascii(char c)
/* extended/OEM ascii --> us ascii */
{
switch(c)
{
case ibmpc_a_uml : return '{';
case ibmpc_o_uml : return '|';
case ibmpc_u_uml : return '}';
case ibmpc_sz : return '~';
case ibmpc_A_uml : return '[';
case ibmpc_O_uml : return '\\';
case ibmpc_U_uml : return ']';
default : return c;
}
}
char umlaut_eascii_to_ansi(char c)
/* extended/OEM ascii --> ansi */
{
#if defined( _WIN32 )
char src[2];
char dst[2];
sprintf(src,"%c",c);
return OemToChar(src,dst) == TRUE ? dst[0] : c;
#else
switch(c)
{
case ibmpc_a_uml : return (char)latin_a_uml;
case ibmpc_o_uml : return (char)latin_o_uml;
case ibmpc_u_uml : return (char)latin_u_uml;
case ibmpc_sz : return (char)latin_sz;
case ibmpc_A_uml : return (char)latin_A_uml;
case ibmpc_O_uml : return (char)latin_O_uml;
case ibmpc_U_uml : return (char)latin_U_uml;
default : return c;
}
#endif
}
char umlaut_ansi_to_eascii(char c)
/* ansi --> extended/OEM ascii */
{
#if defined( _WIN32 )
char src[2];
char dst[2];
sprintf(src,"%c",c);
return CharToOem(src,dst) == TRUE ? dst[0] : c;
#else
switch((unsigned char)c)
{
case latin_a_uml : return (char)ibmpc_a_uml;
case latin_o_uml : return (char)ibmpc_o_uml;
case latin_u_uml : return (char)ibmpc_u_uml;
case latin_sz : return (char)ibmpc_sz;
case latin_A_uml : return (char)ibmpc_A_uml;
case latin_O_uml : return (char)ibmpc_O_uml;
case latin_U_uml : return (char)ibmpc_U_uml;
default : return c;
}
#endif
}
/*I--------------------------- String match --------------------------------- */
bool Str_matches(string str, string pat)
/* whether 'str' matches 'pat'
meta characters: '*', '?'
*/
{
if (STR_EMPTY(pat)) return STR_EMPTY(str);
switch (pat[0])
{
case '*' : { int i;
for (i = 0; True; i++)
{
/* str matches pat+1 */
if (Str_matches(str+i,pat+1)) return True;
/* str does not match pat+1 */
if (STR_EMPTY(str+i)) return False;
}
}
case '?' : if (STR_EMPTY(str)) return False;
return Str_matches(str+1,pat+1);
default : if (STR_EMPTY(str)) return False;
if (pat[0] != str[0]) return False;
return Str_matches(str+1,pat+1);
}
}
styx-2.0.1/libutil/com_get.c 0000666 0001750 0001750 00000006421 07440772216 012707 0000000 0000000 /* ------------------------------------------------------------------------ */
/* */
/* [com_get.c] Comment Line Extraction */
/* */
/* Copyright (c) 1993 by D\olle, Manns */
/* ------------------------------------------------------------------------ */
#include "standard.h"
#if !defined( MSDOS ) && !defined( _WIN32 )
#define O_BINARY 0
#endif
#define MaxComLen 80
static char Com[MaxComLen+1];
#define ScanChars 2000
static char Blk[ScanChars];
static long BlockLoad(string toBlock, long MaxLen, string fromPathName)
{ int Dset; long length;
Dset = open(fromPathName,O_RDONLY | O_BINARY);
if (Dset <= 0)
{ fprintf(STDERR,"File %s couldn't be opened",fromPathName); return 0; }
assert0(MaxLen < 0x10000L,"block too long");
length = read(Dset,toBlock,(unsigned int)MaxLen);
close(Dset);
return length;
}
static bool strnupeq(string A, string B, int Len)
{ int i;
for (i = 0; i < Len; i++)
if (toupper(A[i]) != toupper(B[i]))
return False;
return True;
}
string Com_GetEx(string FileName)
/* [basename]#title of source 'FileName'
format: ['FileName'] ...
| ['FileName'(basename)] ...
( doesn't allocs memory )
*/
{ int blklen, fidlen, i,j, c;
strcpy(Com,"");
blklen = BlockLoad(Blk,ScanChars,FileName);
blklen = MAX(0, MIN(ScanChars,blklen));
fidlen = strlen(FileName);
for (i = fidlen-1; i >= 0; i--)
if (FileName[i] == '\\' || FileName[i] == '/')
{ fidlen -= i+1; FileName += i+1; break; }
for (i = 0; i + fidlen + 1 < blklen; i++)
if (Blk[i] == '['
&& ( Blk[i+fidlen+1] == ']' || Blk[i+fidlen+1] == '(' )
&& strnupeq(Blk+i+1,FileName,fidlen))
goto Found;
goto Done;
Found:
j = i+fidlen+1;
c = 0;
if (Blk[j] == '(')
for( ++j; j < blklen && c < MaxComLen && Blk[j] != ']'; j++)
{
if( Blk[j] != ')' )
{
Com[c] = Blk[j]; ++c;
}
}
if( c < MaxComLen )
{
Com[c] = '#'; ++c;
}
for(j++; j < blklen && Blk[j] == ' '; j++);
for (; j < blklen && c < MaxComLen &&
(Blk[j] > ' ' || (Blk[j] == ' ' && j+1 < blklen && Blk[j+1] > ' '));
j++, c++)
Com[c] = Blk[j];
Com[c] = '\0';
Done:
return Com;
}
string Com_Get(string FileName)
/* title of source 'FileName'
format: ['FileName'] ...
( doesn't allocs memory )
*/
{ int blklen, fidlen, i,j, c;
strcpy(Com,"");
blklen = BlockLoad(Blk,ScanChars,FileName);
blklen = MAX(0, MIN(ScanChars,blklen));
fidlen = strlen(FileName);
for (i = fidlen-1; i >= 0; i--)
if (FileName[i] == '\\' || FileName[i] == '/')
{ fidlen -= i+1; FileName += i+1; break; }
for (i = 0; i + fidlen + 1 < blklen; i++)
if (Blk[i] == '['
&& ( Blk[i+fidlen+1] == ']' || Blk[i+fidlen+1] == '(' )
&& strnupeq(Blk+i+1,FileName,fidlen))
goto Found;
goto Done;
Found:
j = i+fidlen+1;
if (Blk[j] == '(')
for(; j < blklen && Blk[j] != ']'; j++);
for(j++; j < blklen && Blk[j] == ' '; j++);
c = 0;
for (; j < blklen && c < MaxComLen &&
(Blk[j] > ' ' || (Blk[j] == ' ' && j+1 < blklen && Blk[j+1] > ' '));
j++, c++)
Com[c] = Blk[j];
Com[c] = '\0';
Done:
return Com;
}
styx-2.0.1/libutil/Makefile.am 0000664 0001750 0001750 00000000721 07572260505 013154 0000000 0000000 ## Process this file with automake to generate libutil/Makefile.in
INCLUDES = -I$(top_srcdir)/modstd -I$(top_srcdir)/libutil -I$(top_srcdir)/libbase -I$(top_srcdir)/pgm -I$(top_srcdir)/modext -I$(top_srcdir)/inc
vpath %.h @top_srcdir@/modstd @top_srcdir@/libutil @top_srcdir@/libbase @top_srcdir@/pgm @top_srcdir@/modext @top_srcdir@/inc
noinst_LTLIBRARIES = libxstyx.la
libxstyx_la_SOURCES = ctx.c charlib.c dict.c olist.c dicts.c com_get.c hpat.c pgm_base.c
styx-2.0.1/libutil/Makefile.in 0000644 0001750 0001750 00000036646 12116751125 013173 0000000 0000000 # Makefile.in generated by automake 1.11.6 from Makefile.am.
# @configure_input@
# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
# Foundation, Inc.
# This Makefile.in is free software; the Free Software Foundation
# gives unlimited permission to copy and/or distribute it,
# with or without modifications, as long as this notice is preserved.
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
# PARTICULAR PURPOSE.
@SET_MAKE@
VPATH = @srcdir@
am__make_dryrun = \
{ \
am__dry=no; \
case $$MAKEFLAGS in \
*\\[\ \ ]*) \
echo 'am--echo: ; @echo "AM" OK' | $(MAKE) -f - 2>/dev/null \
| grep '^AM OK$$' >/dev/null || am__dry=yes;; \
*) \
for am__flg in $$MAKEFLAGS; do \
case $$am__flg in \
*=*|--*) ;; \
*n*) am__dry=yes; break;; \
esac; \
done;; \
esac; \
test $$am__dry = yes; \
}
pkgdatadir = $(datadir)/@PACKAGE@
pkgincludedir = $(includedir)/@PACKAGE@
pkglibdir = $(libdir)/@PACKAGE@
pkglibexecdir = $(libexecdir)/@PACKAGE@
am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd
install_sh_DATA = $(install_sh) -c -m 644
install_sh_PROGRAM = $(install_sh) -c
install_sh_SCRIPT = $(install_sh) -c
INSTALL_HEADER = $(INSTALL_DATA)
transform = $(program_transform_name)
NORMAL_INSTALL = :
PRE_INSTALL = :
POST_INSTALL = :
NORMAL_UNINSTALL = :
PRE_UNINSTALL = :
POST_UNINSTALL = :
build_triplet = @build@
host_triplet = @host@
subdir = libutil
DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
am__aclocal_m4_deps = $(top_srcdir)/configure.in
am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
$(ACLOCAL_M4)
mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs
CONFIG_HEADER = $(top_builddir)/config.h
CONFIG_CLEAN_FILES =
CONFIG_CLEAN_VPATH_FILES =
LTLIBRARIES = $(noinst_LTLIBRARIES)
libxstyx_la_LIBADD =
am_libxstyx_la_OBJECTS = ctx.lo charlib.lo dict.lo olist.lo dicts.lo \
com_get.lo hpat.lo pgm_base.lo
libxstyx_la_OBJECTS = $(am_libxstyx_la_OBJECTS)
DEFAULT_INCLUDES = -I.@am__isrc@ -I$(top_builddir)
depcomp = $(SHELL) $(top_srcdir)/depcomp
am__depfiles_maybe = depfiles
am__mv = mv -f
COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \
$(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
LTCOMPILE = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \
--mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \
$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
CCLD = $(CC)
LINK = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \
--mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) $(AM_LDFLAGS) \
$(LDFLAGS) -o $@
SOURCES = $(libxstyx_la_SOURCES)
DIST_SOURCES = $(libxstyx_la_SOURCES)
am__can_run_installinfo = \
case $$AM_UPDATE_INFO_DIR in \
n|no|NO) false;; \
*) (install-info --version) >/dev/null 2>&1;; \
esac
ETAGS = etags
CTAGS = ctags
DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
ACLOCAL = @ACLOCAL@
AMTAR = @AMTAR@
AR = @AR@
AUTOCONF = @AUTOCONF@
AUTOHEADER = @AUTOHEADER@
AUTOMAKE = @AUTOMAKE@
AWK = @AWK@
CC = @CC@
CCDEPMODE = @CCDEPMODE@
CFLAGS = @CFLAGS@
CPP = @CPP@
CPPFLAGS = @CPPFLAGS@
CXX = @CXX@
CXXCPP = @CXXCPP@
CXXDEPMODE = @CXXDEPMODE@
CXXFLAGS = @CXXFLAGS@
CYGPATH_W = @CYGPATH_W@
DEFS = @DEFS@
DEPDIR = @DEPDIR@
DLLTOOL = @DLLTOOL@
DSYMUTIL = @DSYMUTIL@
DUMPBIN = @DUMPBIN@
ECHO_C = @ECHO_C@
ECHO_N = @ECHO_N@
ECHO_T = @ECHO_T@
EGREP = @EGREP@
EXEEXT = @EXEEXT@
FGREP = @FGREP@
GREP = @GREP@
INSTALL = @INSTALL@
INSTALL_DATA = @INSTALL_DATA@
INSTALL_PROGRAM = @INSTALL_PROGRAM@
INSTALL_SCRIPT = @INSTALL_SCRIPT@
INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
LD = @LD@
LDFLAGS = @LDFLAGS@
LIBOBJS = @LIBOBJS@
LIBS = @LIBS@
LIBTOOL = @LIBTOOL@
LIPO = @LIPO@
LN_S = @LN_S@
LTLIBOBJS = @LTLIBOBJS@
MAKEINFO = @MAKEINFO@
MANIFEST_TOOL = @MANIFEST_TOOL@
MKDIR_P = @MKDIR_P@
NM = @NM@
NMEDIT = @NMEDIT@
OBJDUMP = @OBJDUMP@
OBJEXT = @OBJEXT@
OTOOL = @OTOOL@
OTOOL64 = @OTOOL64@
PACKAGE = @PACKAGE@
PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
PACKAGE_NAME = @PACKAGE_NAME@
PACKAGE_STRING = @PACKAGE_STRING@
PACKAGE_TARNAME = @PACKAGE_TARNAME@
PACKAGE_URL = @PACKAGE_URL@
PACKAGE_VERSION = @PACKAGE_VERSION@
PATH_SEPARATOR = @PATH_SEPARATOR@
RANLIB = @RANLIB@
SED = @SED@
SET_MAKE = @SET_MAKE@
SHELL = @SHELL@
STRIP = @STRIP@
VERSION = @VERSION@
abs_builddir = @abs_builddir@
abs_srcdir = @abs_srcdir@
abs_top_builddir = @abs_top_builddir@
abs_top_srcdir = @abs_top_srcdir@
ac_ct_AR = @ac_ct_AR@
ac_ct_CC = @ac_ct_CC@
ac_ct_CXX = @ac_ct_CXX@
ac_ct_DUMPBIN = @ac_ct_DUMPBIN@
am__include = @am__include@
am__leading_dot = @am__leading_dot@
am__quote = @am__quote@
am__tar = @am__tar@
am__untar = @am__untar@
bindir = @bindir@
build = @build@
build_alias = @build_alias@
build_cpu = @build_cpu@
build_os = @build_os@
build_vendor = @build_vendor@
builddir = @builddir@
datadir = @datadir@
datarootdir = @datarootdir@
docdir = @docdir@
dvidir = @dvidir@
exec_prefix = @exec_prefix@
host = @host@
host_alias = @host_alias@
host_cpu = @host_cpu@
host_os = @host_os@
host_vendor = @host_vendor@
htmldir = @htmldir@
includedir = @includedir@
infodir = @infodir@
install_sh = @install_sh@
libdir = @libdir@
libexecdir = @libexecdir@
localedir = @localedir@
localstatedir = @localstatedir@
mandir = @mandir@
mkdir_p = @mkdir_p@
oldincludedir = @oldincludedir@
pdfdir = @pdfdir@
prefix = @prefix@
program_transform_name = @program_transform_name@
psdir = @psdir@
sampledir = @sampledir@
sbindir = @sbindir@
sgmldir = @sgmldir@
sharedstatedir = @sharedstatedir@
srcdir = @srcdir@
sysconfdir = @sysconfdir@
target_alias = @target_alias@
top_build_prefix = @top_build_prefix@
top_builddir = @top_builddir@
top_srcdir = @top_srcdir@
INCLUDES = -I$(top_srcdir)/modstd -I$(top_srcdir)/libutil -I$(top_srcdir)/libbase -I$(top_srcdir)/pgm -I$(top_srcdir)/modext -I$(top_srcdir)/inc
noinst_LTLIBRARIES = libxstyx.la
libxstyx_la_SOURCES = ctx.c charlib.c dict.c olist.c dicts.c com_get.c hpat.c pgm_base.c
all: all-am
.SUFFIXES:
.SUFFIXES: .c .lo .o .obj
$(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps)
@for dep in $?; do \
case '$(am__configure_deps)' in \
*$$dep*) \
( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \
&& { if test -f $@; then exit 0; else break; fi; }; \
exit 1;; \
esac; \
done; \
echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign libutil/Makefile'; \
$(am__cd) $(top_srcdir) && \
$(AUTOMAKE) --foreign libutil/Makefile
.PRECIOUS: Makefile
Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status
@case '$?' in \
*config.status*) \
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \
*) \
echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \
cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \
esac;
$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
$(top_srcdir)/configure: $(am__configure_deps)
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
$(ACLOCAL_M4): $(am__aclocal_m4_deps)
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
$(am__aclocal_m4_deps):
clean-noinstLTLIBRARIES:
-test -z "$(noinst_LTLIBRARIES)" || rm -f $(noinst_LTLIBRARIES)
@list='$(noinst_LTLIBRARIES)'; for p in $$list; do \
dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \
test "$$dir" != "$$p" || dir=.; \
echo "rm -f \"$${dir}/so_locations\""; \
rm -f "$${dir}/so_locations"; \
done
libxstyx.la: $(libxstyx_la_OBJECTS) $(libxstyx_la_DEPENDENCIES) $(EXTRA_libxstyx_la_DEPENDENCIES)
$(LINK) $(libxstyx_la_OBJECTS) $(libxstyx_la_LIBADD) $(LIBS)
mostlyclean-compile:
-rm -f *.$(OBJEXT)
distclean-compile:
-rm -f *.tab.c
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/charlib.Plo@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/com_get.Plo@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/ctx.Plo@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/dict.Plo@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/dicts.Plo@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/hpat.Plo@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/olist.Plo@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/pgm_base.Plo@am__quote@
.c.o:
@am__fastdepCC_TRUE@ $(COMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ $<
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
@am__fastdepCC_FALSE@ $(COMPILE) -c $<
.c.obj:
@am__fastdepCC_TRUE@ $(COMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ `$(CYGPATH_W) '$<'`
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
@am__fastdepCC_FALSE@ $(COMPILE) -c `$(CYGPATH_W) '$<'`
.c.lo:
@am__fastdepCC_TRUE@ $(LTCOMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ $<
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Plo
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
@am__fastdepCC_FALSE@ $(LTCOMPILE) -c -o $@ $<
mostlyclean-libtool:
-rm -f *.lo
clean-libtool:
-rm -rf .libs _libs
ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
unique=`for i in $$list; do \
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
done | \
$(AWK) '{ files[$$0] = 1; nonempty = 1; } \
END { if (nonempty) { for (i in files) print i; }; }'`; \
mkid -fID $$unique
tags: TAGS
TAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \
$(TAGS_FILES) $(LISP)
set x; \
here=`pwd`; \
list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
unique=`for i in $$list; do \
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
done | \
$(AWK) '{ files[$$0] = 1; nonempty = 1; } \
END { if (nonempty) { for (i in files) print i; }; }'`; \
shift; \
if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \
test -n "$$unique" || unique=$$empty_fix; \
if test $$# -gt 0; then \
$(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
"$$@" $$unique; \
else \
$(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
$$unique; \
fi; \
fi
ctags: CTAGS
CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \
$(TAGS_FILES) $(LISP)
list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
unique=`for i in $$list; do \
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
done | \
$(AWK) '{ files[$$0] = 1; nonempty = 1; } \
END { if (nonempty) { for (i in files) print i; }; }'`; \
test -z "$(CTAGS_ARGS)$$unique" \
|| $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \
$$unique
GTAGS:
here=`$(am__cd) $(top_builddir) && pwd` \
&& $(am__cd) $(top_srcdir) \
&& gtags -i $(GTAGS_ARGS) "$$here"
distclean-tags:
-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
distdir: $(DISTFILES)
@srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
list='$(DISTFILES)'; \
dist_files=`for file in $$list; do echo $$file; done | \
sed -e "s|^$$srcdirstrip/||;t" \
-e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \
case $$dist_files in \
*/*) $(MKDIR_P) `echo "$$dist_files" | \
sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \
sort -u` ;; \
esac; \
for file in $$dist_files; do \
if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \
if test -d $$d/$$file; then \
dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \
if test -d "$(distdir)/$$file"; then \
find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
fi; \
if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \
cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \
find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
fi; \
cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \
else \
test -f "$(distdir)/$$file" \
|| cp -p $$d/$$file "$(distdir)/$$file" \
|| exit 1; \
fi; \
done
check-am: all-am
check: check-am
all-am: Makefile $(LTLIBRARIES)
installdirs:
install: install-am
install-exec: install-exec-am
install-data: install-data-am
uninstall: uninstall-am
install-am: all-am
@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
installcheck: installcheck-am
install-strip:
if test -z '$(STRIP)'; then \
$(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
install; \
else \
$(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \
fi
mostlyclean-generic:
clean-generic:
distclean-generic:
-test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES)
-test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES)
maintainer-clean-generic:
@echo "This command is intended for maintainers to use"
@echo "it deletes files that may require special tools to rebuild."
clean: clean-am
clean-am: clean-generic clean-libtool clean-noinstLTLIBRARIES \
mostlyclean-am
distclean: distclean-am
-rm -rf ./$(DEPDIR)
-rm -f Makefile
distclean-am: clean-am distclean-compile distclean-generic \
distclean-tags
dvi: dvi-am
dvi-am:
html: html-am
html-am:
info: info-am
info-am:
install-data-am:
install-dvi: install-dvi-am
install-dvi-am:
install-exec-am:
install-html: install-html-am
install-html-am:
install-info: install-info-am
install-info-am:
install-man:
install-pdf: install-pdf-am
install-pdf-am:
install-ps: install-ps-am
install-ps-am:
installcheck-am:
maintainer-clean: maintainer-clean-am
-rm -rf ./$(DEPDIR)
-rm -f Makefile
maintainer-clean-am: distclean-am maintainer-clean-generic
mostlyclean: mostlyclean-am
mostlyclean-am: mostlyclean-compile mostlyclean-generic \
mostlyclean-libtool
pdf: pdf-am
pdf-am:
ps: ps-am
ps-am:
uninstall-am:
.MAKE: install-am install-strip
.PHONY: CTAGS GTAGS all all-am check check-am clean clean-generic \
clean-libtool clean-noinstLTLIBRARIES ctags distclean \
distclean-compile distclean-generic distclean-libtool \
distclean-tags distdir dvi dvi-am html html-am info info-am \
install install-am install-data install-data-am install-dvi \
install-dvi-am install-exec install-exec-am install-html \
install-html-am install-info install-info-am install-man \
install-pdf install-pdf-am install-ps install-ps-am \
install-strip installcheck installcheck-am installdirs \
maintainer-clean maintainer-clean-generic mostlyclean \
mostlyclean-compile mostlyclean-generic mostlyclean-libtool \
pdf pdf-am ps ps-am tags uninstall uninstall-am
vpath %.h @top_srcdir@/modstd @top_srcdir@/libutil @top_srcdir@/libbase @top_srcdir@/pgm @top_srcdir@/modext @top_srcdir@/inc
# Tell versions [3.59,3.63) of GNU make to not export all variables.
# Otherwise a system limit (for SysV at least) may be exceeded.
.NOEXPORT:
styx-2.0.1/libutil/olist.c 0000666 0001750 0001750 00000046765 07605543554 012447 0000000 0000000 /* ------------------------------------------------------------------------ */
/* */
/* [olist.c] Type: Operational List */
/* */
/* Copyright (c) 1993 by D\olle, Manns */
/* ------------------------------------------------------------------------ */
#include "standard.h"
#include "prim.h" /* for primitive types */
/*I------------------------- Types ---------------------------------------- */
/*!!
This module implements an operational, double linked list data type.
In distinction from functional lists operational lists consist of
a header and the double linked elements.
Beside element type information the header contains references to the
first, last and current element.
*/
AbstractType(OL_Lst); /* Abstract operational list type */
AbstractType(OL_Obj); /* Abstract list element type */
typedef StdCPtr OlObj; /* Implementation Type: List Entry */
typedef struct _OLIST {
/* Implementation Type: List Node */
OlObj object;
struct _OLIST* next;
struct _OLIST* prev;
} OLIST;
typedef struct _LHEAD {
/* Implementation Type: Operational List */
OL_Obj (*copy)(OL_Obj obj);
void (*del)(OL_Obj obj);
bool (*equal)(OL_Obj lobj, OL_Obj robj);
OLIST* first;
OLIST* curr;
OLIST* last;
INT cnt;
} LHEAD;
#define OL__IMP(lst) ( (LHEAD*)(lst) )
#define OL__COPY(lst) ( (OL__IMP(lst))->copy )
#define OL__DELETE(lst) ( (OL__IMP(lst))->del )
#define OL__EQUAL(lst) ( (OL__IMP(lst))->equal )
#define OL__CNT(lst) ( (OL__IMP(lst))->cnt )
#define OL__FIRST(lst) ( (OL__IMP(lst))->first )
#define OL__CURR(lst) ( (OL__IMP(lst))->curr )
#define OL__LAST(lst) ( (OL__IMP(lst))->last )
#define OL__OBJECT(node) ( (node)->object )
#define OL__NEXT(node) ( (node)->next )
#define OL__PREV(node) ( (node)->prev )
#define BUG_OL__NILL(lst) BUG_VMIN( OL__CNT(lst), 0 )
#define BUG_OL__ACNT(cnt) BUG_VMIN( (cnt), 2 )
#define BUG_OL__LCNT(lft,rgt) BUG_VEQU( (lft), (rgt) )
#define BUG_OL__LTYP(lft,rgt) BUG_VEQU( OL__COPY(lft), OL__COPY(rgt) ); \
BUG_VEQU( OL__DELETE(lft), OL__DELETE(rgt) ); \
BUG_VEQU( OL__EQUAL(lft), OL__EQUAL(rgt) )
#define BUG_OL__FORM(cls,ind) BUG_VMIN( (cls) + (ind), 1 )
/*I---------------------- Creation and basic access ------------------------- */
static void initLst(OL_Lst objlist)
/* initializes objlist ( Parameter Check: CALL Function ) */
{
OL__CNT(objlist) = 0;
OL__FIRST(objlist) = (OLIST*)NULL;
OL__CURR(objlist) = (OLIST*)NULL;
OL__LAST(objlist) = (OLIST*)NULL;
}
OL_Lst OL_create
( /* function parameter: */
OL_Obj (*copy)(OL_Obj obj), /* copies an element */
void (*del)(OL_Obj obj), /* frees an element */
bool (*equal)(OL_Obj lobj, OL_Obj robj) /* equality on elements */
)
#define OL_CREATE(type,cpy,del,equ) \
OL_create \
( \
(OL_Obj (*)(OL_Obj obj)) cpy, \
(void (*)(OL_Obj obj)) del, \
(bool (*)(OL_Obj lobj, OL_Obj robj)) equ \
)
#define OL_CREATE_ADT(type) OL_CREATE(type,primCopy,primFree,primEqual)
/** creates an operational list */
{ LHEAD* lst;
BUG_NULL(copy); BUG_NULL(del); BUG_NULL(equal);
lst = (LHEAD*)NewMem(sizeof(LHEAD));
OL__COPY(lst) = copy;
OL__DELETE(lst) = del;
OL__EQUAL(lst) = equal;
initLst(lst);
return( lst );
}
void OL_init(OL_Lst objlist)
#define OL_INIT OL_init
/* resets / initializes list 'objlist' */
{
BUG_NULL(objlist);
initLst(objlist);
}
INT OL_cnt(OL_Lst objlist)
#define OL_CNT OL_cnt
/* number of elements in list 'objlist' */
{
BUG_NULL(objlist);
return( OL__CNT(objlist) );
}
/*I--------------------- List copy as reading cursor ------------------------ */
OL_Lst OL_copyL(OL_Lst dst, OL_Lst src)
#define OL_COPY_L OL_copyL
/* copies list 'src';
fills list 'dst' with references to elements in 'src'
*/
{
BUG_NULL(dst); BUG_NULL(src);
OL__COPY(dst) = OL__COPY(src);
OL__DELETE(dst) = OL__DELETE(src);
OL__EQUAL(dst) = OL__EQUAL(src);
OL__CNT(dst) = OL__CNT(src);
OL__FIRST(dst) = OL__FIRST(src);
OL__CURR(dst) = OL__CURR(src);
OL__LAST(dst) = OL__LAST(src);
return( dst );
}
void OL_delC(OL_Lst objlist)
#define OL_DEL_C OL_delC
/* removes list 'objlist' only - without elements */
{
BUG_NULL(objlist);
FreeMem( objlist );
}
/*I--------------------------- Get & Search --------------------------------- */
OL_Obj OL_first(OL_Lst objlist)
#define OL_FIRST(type,lst) ( ABS_CAST(type,OL_first(lst)) )
/* first element of list 'objlist' */
{ OL_Lst lptr = objlist;
BUG_NULL(objlist);
OL__CURR(lptr) = OL__FIRST(lptr);
if( OL__CNT(objlist) ) return( OL__OBJECT(OL__CURR(lptr)) );
return( (OL_Obj)NULL );
}
OL_Obj OL_last(OL_Lst objlist)
#define OL_LAST(type,lst) ( ABS_CAST(type,OL_last(lst)) )
/* last element of list 'objlist' */
{ OL_Lst lptr = objlist;
BUG_NULL(objlist);
OL__CURR(lptr) = OL__LAST(lptr);
if( OL__CNT(objlist) ) return( OL__OBJECT(OL__CURR(lptr)) );
return( (OL_Obj)NULL );
}
OL_Obj OL_next(OL_Lst objlist)
#define OL_NEXT(type,lst) ( ABS_CAST(type,OL_next(lst)) )
/* next element of list 'objlist' */
{ OL_Lst lptr = objlist;
BUG_NULL(objlist);
BUG_OL__NILL(objlist);
return
(
( OL__CURR(lptr) == (OLIST*)NULL )
? OL__OBJECT( OL__CURR(lptr) = OL__FIRST(lptr) )
: ( ( OL__CURR(lptr) = OL__NEXT(OL__CURR(lptr)) ) != (OLIST*)NULL )
? OL__OBJECT(OL__CURR(lptr)) : (OL_Obj)NULL
);
}
OL_Obj OL_prev(OL_Lst objlist)
#define OL_PREV(type,lst) ( ABS_CAST(type,OL_prev(lst)) )
/* previous element of list 'objlist' */
{ OL_Lst lptr = objlist;
BUG_NULL(objlist);
BUG_OL__NILL(objlist);
return
(
( OL__CURR(lptr) == (OLIST*)NULL )
? OL__OBJECT( OL__CURR(lptr) = OL__LAST(lptr) )
: ( ( OL__CURR(lptr) = OL__PREV(OL__CURR(lptr)) ) != (OLIST*)NULL )
? OL__OBJECT(OL__CURR(lptr)) : (OL_Obj)NULL
);
}
OL_Obj OL_curr(OL_Lst objlist)
#define OL_CURR(type,lst) ( ABS_CAST(type,OL_curr(lst)) )
/* current element of list 'objlist' */
{ OL_Lst lptr = objlist;
BUG_NULL(objlist);
return
(
( OL__CURR(lptr) != (OLIST*)NULL )
? OL__OBJECT(OL__CURR(lptr)) : (OL_Obj)NULL
);
}
INT OL_find(OL_Lst objlist, OL_Obj obj, bool (*cmp)(OL_Obj lobj, OL_Obj obj))
#define OL_FIND_EQ(lst,obj) \
OL_find(lst,ABS_CAST(OL_Obj,obj),(bool (*)(OL_Obj lobj, OL_Obj Obj))NULL)
#define OL_FIND(lst,obj,cmp) \
OL_find(lst,ABS_CAST(OL_Obj,obj),(bool (*)(OL_Obj lobj, OL_Obj Obj)) cmp)
/* position of key element 'obj' in list 'objlist' or 0 ( linear search ) */
{ bool (*cfun)(OL_Obj lobj, OL_Obj obj); OL_Obj lstobj; INT i;
BUG_NULL(objlist);
cfun = ( cmp == (bool (*)(OL_Obj lobj,OL_Obj obj))NULL ) ?
OL__EQUAL(objlist) : cmp;
for( i=0; i < OL__CNT(objlist); ++i )
{
lstobj = ( ! i ) ? OL_first(objlist) : OL_next(objlist);
if( (*cfun)(lstobj,obj) ) return( i+1 );
}
return( 0 );
}
/*I--------------------------- Insert & Update ------------------------------ */
static OLIST* createLstNode(OL_Obj newobj)
/* creates list node for newobj */
{ OLIST* nptr;
nptr = (OLIST*)NewMem(sizeof(OLIST));
OL__OBJECT(nptr) = newobj;
return( nptr );
}
static OL_Obj insHeadObj(OL_Lst objlist, OL_Obj newobj)
/* inserts newobj as first entry in objlist */
{ OLIST* nptr;
BUG_NULL(objlist);
nptr = createLstNode(newobj);
OL__NEXT(nptr) = OL__FIRST(objlist);
OL__PREV(nptr) = (OLIST*)NULL;
if( OL__FIRST(objlist) == (OLIST*)NULL ) OL__LAST(objlist) = nptr;
else OL__PREV(OL__FIRST(objlist)) = nptr;
++OL__CNT(objlist);
return( OL__OBJECT( OL__FIRST(objlist) = OL__CURR(objlist) = nptr ) );
}
static OL_Obj insTailObj(OL_Lst objlist, OL_Obj newobj)
/* inserts newobj as last entry in objlist */
{
BUG_NULL(objlist);
if( OL__LAST(objlist) != (OLIST*)NULL )
{ OLIST* nptr = createLstNode(newobj);
OL__NEXT(nptr) = (OLIST*)NULL;
OL__PREV(nptr) = OL__LAST(objlist);
OL__LAST(objlist) = OL__NEXT(OL__LAST(objlist)) = nptr;
++OL__CNT(objlist);
return( OL__OBJECT(OL__CURR(objlist) = nptr) );
}
else
return( insHeadObj(objlist,newobj) );
}
static OL_Obj insCurrObj(OL_Lst objlist, OL_Obj newobj)
/* inserts newobj before current entry in objlist */
/* ( or as last, if OL__CURR(objlist) == NULL ) */
{
BUG_NULL(objlist);
if( OL__CURR(objlist) != (OLIST*)NULL )
{ OLIST* nptr = createLstNode(newobj);
if( ( OL__PREV(nptr) = OL__PREV(OL__CURR(objlist)) ) != (OLIST*)NULL )
OL__NEXT(OL__PREV(nptr)) = nptr;
else
OL__FIRST(objlist) = nptr;
OL__NEXT(nptr) = OL__CURR(objlist);
OL__PREV(OL__CURR(objlist)) = nptr;
++OL__CNT(objlist);
return( OL__OBJECT(OL__CURR(objlist) = nptr) );
}
else
return( insTailObj(objlist,newobj) );
}
static OL_Obj insSortObj
(
OL_Lst objlist, OL_Obj newobj,
bool (*cmpLE)(OL_Obj obj_a,OL_Obj obj_b)
)
/* inserts newobj in objlist ( sorted ) */
/* (*cmpLE)(left,right) = True ==> left <= right */
{
BUG_NULL(objlist); BUG_NULL(cmpLE);
if( OL__FIRST(objlist) != (OLIST*)NULL )
{ OLIST* lptr = ( OL__CURR(objlist) != (OLIST*)NULL &&
(*cmpLE)(OL__OBJECT(OL__CURR(objlist)),newobj) ) ?
OL__CURR(objlist) : OL__FIRST(objlist);
while( lptr != (OLIST*)NULL && (*cmpLE)(OL__OBJECT(lptr),newobj) )
lptr = OL__NEXT(lptr);
if( lptr == (OLIST*)NULL ) return( insTailObj(objlist,newobj) );
else
{ OLIST* nptr = createLstNode(newobj);
if( ( OL__PREV(nptr) = OL__PREV(lptr) ) != (OLIST*)NULL )
OL__NEXT(OL__PREV(nptr)) = nptr;
else
OL__FIRST(objlist) = nptr;
OL__NEXT(nptr) = lptr;
OL__PREV(lptr) = nptr;
++OL__CNT(objlist);
return( OL__OBJECT(OL__CURR(objlist) = nptr) );
}
}
else return( insHeadObj(objlist,newobj) );
}
OL_Obj OL_h_ins(OL_Lst objlist, OL_Obj newobj)
#define OL_H_INS(type,lst,obj) \
( ABS_CAST(type,OL_h_ins(lst,ABS_CAST(OL_Obj,obj))) )
/* inserts 'newobj' as first element in list 'objlist' */
{
return( insHeadObj(objlist,(*OL__COPY(objlist))(newobj)) );
}
OL_Obj OL_t_ins(OL_Lst objlist, OL_Obj newobj)
#define OL_T_INS(type,lst,obj) \
( ABS_CAST(type,OL_t_ins(lst,ABS_CAST(OL_Obj,obj))) )
/* inserts 'newobj' as last element in list 'objlist' */
{
return( insTailObj(objlist,(*OL__COPY(objlist))(newobj)) );
}
OL_Obj OL_c_ins(OL_Lst objlist, OL_Obj newobj)
#define OL_C_INS(type,lst,obj) \
( ABS_CAST(type,OL_c_ins(lst,ABS_CAST(OL_Obj,obj))) )
/* inserts 'newobj' before current element in list 'objlist'
( or as last element, if 'objlist' is empty )
*/
{
return( insCurrObj(objlist,(*OL__COPY(objlist))(newobj)) );
}
OL_Obj OL_s_ins(OL_Lst objlist, OL_Obj newobj,
bool (*cmpLE)(OL_Obj lobj, OL_Obj newobj))
#define OL_S_INS(type,lst,obj,cmpLE) \
( \
ABS_CAST(type,OL_s_ins \
(lst,ABS_CAST(OL_Obj,obj), \
(bool (*)(OL_Obj lobj, OL_Obj newobj))cmpLE)) \
)
/* inserts element 'newobj' in list 'objlist' ( sorted ) */
{
return( insSortObj(objlist,(*OL__COPY(objlist))(newobj),cmpLE) );
}
OL_Obj OL_upd(OL_Lst objlist, OL_Obj newobj)
#define OL_UPD(type,lst,obj) \
( ABS_CAST(type,OL_upd(lst,ABS_CAST(OL_Obj,obj))) )
/* updates current element in list 'objlist' with 'newobj' */
{
BUG_NULL(objlist);
BUG_NULL(OL__CURR(objlist));
(*OL__DELETE(objlist))(OL__OBJECT(OL__CURR(objlist)));
OL__OBJECT(OL__CURR(objlist)) = newobj;
return( newobj );
}
/*I----------------------------- Copy & Append ------------------------------ */
OL_Lst OL_copy(OL_Lst objlist)
#define OL_COPY OL_copy
/* copies list 'objlist' */
{ LHEAD* res; INT i;
BUG_NULL(objlist);
res = (LHEAD*)NewMem(sizeof(LHEAD));
OL__COPY(res) = OL__COPY(objlist);
OL__DELETE(res) = OL__DELETE(objlist);
OL__EQUAL(res) = OL__EQUAL(objlist);
initLst(res);
for( i=0; i < OL__CNT(objlist); ++i )
if( ! i ) insTailObj(res,(*OL__COPY(objlist))(OL_first(objlist)));
else insTailObj(res,(*OL__COPY(objlist))(OL_next(objlist)));
return( res );
}
OL_Lst OL_append(OL_Lst dst, OL_Lst src)
#define OL_APPEND OL_append
/* appends list 'src' to list 'dst'; 'src' won't be removed */
{ INT cnt, i;
BUG_NULL(dst); BUG_NULL(src);
BUG_OL__LTYP(dst,src);
cnt = OL__CNT(src);
for( i=0; i < cnt; ++i )
if( ! i ) insTailObj(dst,(*OL__COPY(src))(OL_first(src)));
else insTailObj(dst,(*OL__COPY(src))(OL_next(src)));
return( dst );
}
/*I------------------------------ Delete ------------------------------------ */
void OL_clear(OL_Lst objlist)
#define OL_CLEAR OL_clear
/* clears list 'objlist'; removes all elements */
{ OLIST* lptr;
BUG_NULL(objlist);
lptr = OL__FIRST(objlist);
while( lptr != (OLIST*)NULL )
{ OLIST* actptr = lptr;
lptr = OL__NEXT(lptr);
(*OL__DELETE(objlist))( OL__OBJECT(actptr) );
FreeMem( actptr );
}
OL_init(objlist);
}
void OL_delL(OL_Lst objlist)
#define OL_DEL_L OL_delL
/* removes list 'objlist */
{
OL_clear(objlist);
FreeMem( objlist );
}
void OL_delE(OL_Lst objlist)
#define OL_DEL_E OL_delE
/* removes current element in list 'objlist' */
{ OLIST* curr;
BUG_NULL(objlist); BUG_NULL(curr = OL__CURR(objlist));
(*OL__DELETE(objlist))( OL__OBJECT(curr) );
if( OL__PREV(curr) != (OLIST*)NULL )
{
OL__NEXT(OL__PREV(curr)) = OL__NEXT(curr);
if( OL__NEXT(curr) != (OLIST*)NULL )
OL__CURR(objlist) = OL__PREV(OL__NEXT(curr)) = OL__PREV(curr);
else OL__LAST(objlist) = OL__CURR(objlist) = OL__PREV(curr);
}
else
{
if( OL__NEXT(curr) != (OLIST*)NULL )
{
OL__PREV(OL__NEXT(curr)) = (OLIST*)NULL;
OL__FIRST(objlist) = OL__CURR(objlist) = OL__NEXT(curr);
}
else OL_init(objlist);
}
FreeMem(curr);
if( OL__CNT(objlist) ) --OL__CNT(objlist);
}
/*I----------------------------- Printing ----------------------------------- */
void OL_print(OL_Lst objlist, void (*pMbr)(OL_Obj obj), int cols, int indent)
#define OL_PRINT(lst,pMbr,cols,ind) \
OL_print(lst,(void (*)(OL_Obj obj)) pMbr,(cols),(ind))
/* prints list 'objlist' to stdout */
{ INT i;
BUG_NULL(objlist); BUG_NULL(pMbr);
BUG_OL__FORM(cols,indent);
for( i=0; i < OL__CNT(objlist); ++i )
{
OL_Obj obj = ( ! i ) ? OL_first(objlist) : OL_next(objlist);
if( ! ( i % cols ) ) NLIND;
(*pMbr)(obj);
if( i < OL__CNT(objlist) - 1 ) fprintf(STDOUT,", ");
}
}
void OL_print_ex
(
OL_Lst objlist,
void (*pMbr)(OL_Obj obj,Any_T any,int nl,c_bool last),
Any_T any, int cols, int indent
)
#define OL_PRINT_EX(lst,pMbr,any,cols,ind) \
OL_print_ex(lst, \
(void (*)(OL_Obj o,Any_T any,int nl,c_bool last))pMbr, \
(any),(cols),(ind))
/* prints list 'objlist' to stdout */
{ INT i;
BUG_NULL(objlist); BUG_NULL(pMbr);
BUG_OL__FORM(cols,indent);
for( i=0; i < OL__CNT(objlist); ++i )
{
OL_Obj obj = ( ! i ) ? OL_first(objlist) : OL_next(objlist);
(*pMbr)(obj,any,(!(i%cols)?indent:0),!(i < OL__CNT(objlist) - 1));
}
}
/*I---------------------- Predicates on lists & Mapping --------------------- */
bool OL_equal(OL_Lst left,OL_Lst right)
#define OL_EQUAL OL_equal
/* left = right ? */
{
BUG_NULL(left); BUG_NULL(right);
BUG_OL__LTYP(left,right);
if( left == right ) return( True );
if( OL__CNT(left) != OL__CNT(right) ) return( False );
else
{ INT i;
for( i=0; i < OL__CNT(left); ++i )
{
OL_Obj l = ( ! i ) ? OL_first(left) : OL_next(left);
OL_Obj r = ( ! i ) ? OL_first(right) : OL_next(right);
if( ! (*OL__EQUAL(left))(l,r) ) return( False );
}
return( True );
}
}
StdCPtr OL_map
( /* function parameter: */
int argcnt, /* number of arguments */
void (*fun)(OL_Obj* objs, StdCPtr any), /* element map function */
StdCPtr any, /* any additional context */
OL_Lst objlist, ... /* operational lists */
)
#define OL_MAP_F OL_map
/** executes 'fun' on each element in all lists */
{ va_list args; StdCPtr* arglst; OL_Obj* objs; INT i, j;
va_start(args,objlist);
arglst = MakeArgLst(args,4,argcnt,fun,any,objlist);
va_end(args);
BUG_OL__ACNT(argcnt);
if( argcnt > 3 ) for( i = 3; i+1 <= argcnt; ++i )
BUG_OL__LCNT(OL__CNT(arglst[i]),OL__CNT(arglst[i+1]));
objs = (OL_Obj*)NewMem(sizeof(OL_Obj)*(argcnt-2));
for( i=0; i < OL__CNT(arglst[3]); ++i )
{
for( j = 3; j <= argcnt; ++j )
objs[j-3] = ( ! i ) ? OL_first(arglst[j]) : OL_next(arglst[j]);
(*fun)(objs,any);
}
FreeMem( objs ); FreeMem(arglst);
return( any );
}
bool OL_forall
( /* function parameter: */
int argcnt, /* number of arguments */
bool (*fun)(OL_Obj* objs, StdCPtr any), /* element map function */
StdCPtr any, /* any additional context */
OL_Lst objlist, ... /* operational lists */
)
#define OL_FORALL_P OL_forall
/** executes 'fun' on each element in all lists;
* on false execution stops
*/
{ va_list args; StdCPtr* arglst; OL_Obj* objs; bool flag = True; INT i, j;
va_start(args,objlist);
arglst = MakeArgLst(args,4,argcnt,fun,any,objlist);
va_end(args);
BUG_OL__ACNT(argcnt);
if( argcnt > 3 ) for( i = 3; i+1 <= argcnt; ++i )
BUG_OL__LCNT(OL__CNT(arglst[i]),OL__CNT(arglst[i+1]));
objs = (OL_Obj*)NewMem(sizeof(OL_Obj)*(argcnt-2));
for( i=0; i < OL__CNT(arglst[3]); ++i )
{
for( j = 3; j <= argcnt; ++j )
objs[j-3] = ( ! i ) ? OL_first(arglst[j]) : OL_next(arglst[j]);
if( ! (*fun)(objs,any) )
{
flag = False; break;
}
}
FreeMem( objs ); FreeMem(arglst);
return( flag );
}
bool OL_exists
( /* function parameter: */
int argcnt, /* number of arguments */
bool (*fun)(OL_Obj* objs, StdCPtr any), /* element map function */
StdCPtr any, /* any additional context */
OL_Lst objlist, ... /* operational lists */
)
#define OL_EXISTS_P OL_exists
/** executes 'fun' on each element in all lists;
* on true execution stops
*/
{ va_list args; StdCPtr* arglst; OL_Obj* objs; bool flag = False; INT i, j;
va_start(args,objlist);
arglst = MakeArgLst(args,4,argcnt,fun,any,objlist);
va_end(args);
BUG_OL__ACNT(argcnt);
if( argcnt > 3 ) for( i = 3; i+1 <= argcnt; ++i )
BUG_OL__LCNT(OL__CNT(arglst[i]),OL__CNT(arglst[i+1]));
objs = (OL_Obj*)NewMem(sizeof(OL_Obj)*(argcnt-2));
for( i=0; i < OL__CNT(arglst[3]); ++i )
{
for( j = 3; j <= argcnt; ++j )
objs[j-3] = ( ! i ) ? OL_first(arglst[j]) : OL_next(arglst[j]);
if( (*fun)(objs,any) )
{
flag = True; break;
}
}
FreeMem( objs ); FreeMem(arglst);
return( flag );
}
styx-2.0.1/libutil/dicts.c 0000666 0001750 0001750 00000014712 07623656275 012413 0000000 0000000 /* ------------------------------------------------------------------------ */
/* */
/* [dicts.c] Type: Dictionary Iterator */
/* */
/* Copyright (c) 1993 by D\olle, Manns */
/* ------------------------------------------------------------------------ */
#include "standard.h"
#include "dict.h"
#include "otab.h"
#include "charlib.h"
/*I---------------------- The Type ----------------------------------------- */
/*!!
The dictionary iterator provides sequentiell, platform-independant access to
a specified part of the file system.
Supported platforms are Unix and Windows.
*/
AbstractType(DII); /* Abstract dictionary iterator type */
ConcreteType(DII_IMP)
{
OT_Tab DirTab;
Dir Directory;
string Pattern;
Dentry Entry;
bool skip;
};
/* ---------------------- Auxiliary Functions ------------------------------ */
static bool lower_matches(string str, string pat)
{
#if defined( MSDOS ) || defined(_WIN32)
StrToLower(str);
#endif
return Str_matches(str,pat);
}
static void nextEntry(DII dii)
/* next dictionary entry ( non recursive ) */
{ DII_IMP d = (DII_IMP) dii;
for
(
d->Entry = Dir_read(d->Directory);
d->Entry != (Dentry)NULL &&
! lower_matches(Dentry_name(d->Entry),d->Pattern);
d->Entry = Dir_read(d->Directory)
);
}
static void nextEntryR(DII dii)
/* next dictionary entry ( recursive ) */
{ DII_IMP d = (DII_IMP) dii; static INT pos = 1; bool found = False;
while( ! found )
{
if( ( d->Entry = Dir_read(d->Directory) ) != (Dentry)NULL )
{
if( strcmp(Dentry_name(d->Entry),"..") &&
strcmp(Dentry_name(d->Entry),".") &&
Dentry_isDir(d->Entry) )
pos = OT_P_INS(d->DirTab,Dentry_path(d->Entry),pos) + 2;
found = lower_matches(Dentry_name(d->Entry),d->Pattern);
}
else
{ Dir directory = (Dir)NULL; string path;
while
(
OT_CNT(d->DirTab) > 0 &&
( directory = Dir_open(path = OT_GET(string,d->DirTab,0)) ) == (Dir)NULL
)
{
OT_DEL_E(d->DirTab,0);
if( ! d->skip )
bug1(False,"directory '%s' couldn't be opended",path);
else
fprintf(STDERR,"directory '%s' couldn't be opended",path);
}
Dir_close(d->Directory);
if( ( d->Directory = directory ) != (Dir)NULL )
{
OT_DEL_E(d->DirTab,0); pos = 1;
}
else found = True;
}
}
}
/*I--------------------------- Create & Drop -------------------------------- */
DII DII_make
(
string PathName, string Pattern,
bool recursive, bool skipErr
)
/* creates a ['recursive'] dictionary iterator for
directory 'PathName' and file 'Pattern'
'skipErr' --> error message on open failure, otherwise the program aborts
*/
{ DII_IMP dii = (DII_IMP)NULL; Dir directory = Dir_open(PathName);
if( directory != (Dir)NULL )
{
dii = New(DII_IMP);
dii->Directory = directory;
dii->Entry = (Dentry)NULL;
dii->Pattern = StrCopy(Pattern);
dii->skip = skipErr;
if( recursive )
{
dii->DirTab = OT_CREATE(string,primCopy,FreeMem,strEqual);
nextEntryR((DII) dii);
}
else
{
dii->DirTab = (OT_Tab)NULL;
nextEntry((DII) dii);
}
}
else
{
if( ! skipErr )
bug1(False,"directory '%s' couldn't be opended",PathName);
else
fprintf(STDERR,"directory '%s' couldn't be opended",PathName);
}
return (DII) dii;
}
void DII_drop(DII dii)
/* drops dictionary iterator 'dii' */
{ DII_IMP d = (DII_IMP) dii;
if( d != (DII_IMP)NULL )
{
if( d->Directory != (Dir)NULL ) Dir_close(d->Directory);
FreeMem(d->Pattern);
if( d->DirTab != (OT_Tab)NULL ) OT_DEL_T(d->DirTab);
FreeMem(d);
}
}
/*I------------------------- Dictionary iterator access -------------------- */
bool DII_empty(DII dii)
/* empty dictionary iterator ? */
{ DII_IMP d = (DII_IMP) dii;
return
(
d == (DII_IMP)NULL || d->Directory == (Dir)NULL ||
( d->Entry == (Dentry)NULL &&
( d->DirTab == (OT_Tab)NULL || ! OT_CNT(d->DirTab) ) )
);
}
void DII_next(DII dii)
/* next dictionary entry */
{ DII_IMP d = (DII_IMP) dii;
if( d->DirTab != (OT_Tab)NULL ) nextEntryR(dii);
else nextEntry(dii);
}
bool DII_isFile(DII dii)
/* dictionary entry = file ? */
{
return( Dentry_isFile(((DII_IMP)dii)->Entry) );
}
bool DII_isDir(DII dii)
/* dictionary entry = directory ? */
{
return( Dentry_isDir(((DII_IMP)dii)->Entry) );
}
bool DII_isCDev(DII dii)
/* dictionary entry = character device ? */
{
return( Dentry_isCDev(((DII_IMP)dii)->Entry) );
}
bool DII_isBDev(DII dii)
/* dictionary entry = block device ? */
{
return( Dentry_isBDev(((DII_IMP)dii)->Entry) );
}
bool DII_isFifo(DII dii)
/* dictionary entry = FIFO ? */
{
return( Dentry_isFifo(((DII_IMP)dii)->Entry) );
}
string DII_get_file(DII dii)
/* filename of dictionary entry; allocs memory */
{
return StrCopy(Dentry_name(((DII_IMP)dii)->Entry));
}
string DII_get_base(DII dii)
/* basename of dictionary entry; allocs memory */
{ int i;
string s = Dentry_name(((DII_IMP)dii)->Entry);
int len = strlen(s);
for (i = len-1; i >= 0 && s[i] != '.'; i--);
return SubStrCopy(s,s[i]=='.'?i:len);
}
string DII_get_ext(DII dii)
/* extension of dictionary entry; allocs memory */
{ int i;
string s = Dentry_name(((DII_IMP)dii)->Entry);
int len = strlen(s);
for (i = len-1; i >= 0 && s[i] != '.'; i--);
return SubStrCopy(s+i,s[i]=='.'?len-i:0);
}
string DII_get_path(DII dii)
/* path of dictionary entry; allocs memory */
{
return StrCopy(Dir_name(((DII_IMP)dii)->Directory));
}
/*I---------------------- Convenient iterator macros ----------------------- */
/*DOC_INTERFACE_COPY_ON*/
#define DII_FORALL(dii,Path,Pattern) \
for (dii = DII_make(Path,Pattern,False,False); \
DII_empty(dii)?DII_drop(dii),False:True; DII_next(dii))
#define DII_FORALL_R(dii,Path,Pattern) \
for (dii = DII_make(Path,Pattern,True,False); \
DII_empty(dii)?DII_drop(dii),False:True; DII_next(dii))
#define DII_SFORALL(dii,Path,Pattern) \
for (dii = DII_make(Path,Pattern,False,True); \
DII_empty(dii)?DII_drop(dii),False:True; DII_next(dii))
#define DII_SFORALL_R(dii,Path,Pattern) \
for (dii = DII_make(Path,Pattern,True,True); \
DII_empty(dii)?DII_drop(dii),False:True; DII_next(dii))
/*DOC_INTERFACE_COPY_OFF*/
styx-2.0.1/pgm/ 0000755 0001750 0001750 00000000000 12116751137 010311 5 0000000 0000000 styx-2.0.1/pgm/ptm_img.c 0000666 0001750 0001750 00000006317 10161654730 012043 0000000 0000000 /* ------------------------------------------------------------------------ */
/* */
/* [ptm_img.c] Put&Get Term */
/* */
/* Copyright (c) 1993 by D\olle, Manns */
/* ------------------------------------------------------------------------ */
#include "stdosx.h"
#include "binimg.h"
#include "pgm_base.h"
#include "pgm_sopt.h"
#include "pgm_popt.h"
#include "ptm__cim.h"
#define img CTX_EVAL(string,"Img")
#define language CTX_EVAL(string,"Language")
#define filename CTX_EVAL(string,"FileName")
#define binmode CTX_EVAL(bool,"binmode")
#define binpath CTX_EVAL(string,"BINSTYX")
int main(int argc, string argv[])
{ PLR_Tab PTab; PT_Term PTree = (PT_Term)NULL;
ROW(PT_Term) trees = OT_CREATE(PT_Term,primCopy,PT_delT,primEqual);
/* init module */
PGM_init(argc,argv,CTX_init_ptm_img);
/* create & init parse table */
PTab = PLR_getTab_env(binpath,language);
if( strlen(filename) ) // parse and put source file
{ string s = Str_printf("[%s] Binary %s Derivation Tree",img,language);
Scn_T Scn; Scn_Stream cStream; PT_Cfg PCfg;
/* init pre-processing */
PGM_initPreprocessing(prepar,premac,cset);
/* create & init scan table */
Scn_get_env(binpath,language,&Scn);
/* create & init scan stream */
cStream = PGM_initScanStream
(
Scn,filename,prepar,prefun,binmode,cset,
skipset,CTX_EVAL(bool,"lookahead"),False
);
/* init parse configuration */
PCfg = PGM_initParsing(cStream,PTab);
/* parse, put and release tree */
/* early --> parse, put and release partial trees */
PTree = PGM_parse(PCfg,start,shiftfun,reducefun,early,xaron);
if( PTree != (PT_Term)NULL )
{
putBgn("",img,"");
putHeader(s,"ptmimg",2,0);
if( early )
{
while( PTree != (PT_Term)NULL )
{
OT_PUSH(PTree,trees);
putReference(PTree,PT_putT);
PTree = PGM_parse(PCfg,start,shiftfun,reducefun,early,xaron);
putByte((byte)(PTree != (PT_Term)NULL));
}
}
else
if( PTree != (PT_Term)NULL )
{
OT_PUSH(PTree,trees);
putReference(PTree,PT_putT);
putByte((byte)0);
}
putEnd();
}
/* quit parse configuration */
PT_quit(PCfg);
/* release scan stream & scan table */
PGM_quitScanStream(cStream);
Scn_free(Scn);
/* quit preprocessing */
PGM_quitPreprocessing(prepar);
FreeMem(s);
}
else // get image file and print tree(s)
{ byte b;
getBgn("",img,"");
getHeader("ptmimg",2,0);
getReference(&PTree,PT_getT);
OT_PUSH(PTree,trees);
PGM_printTree(PTree,cset,wprint);
getByte(&b);
while( b == (byte)1 ) // fetch and print tree
{
getReference(&PTree,PT_getT);
OT_PUSH(PTree,trees);
PGM_printTree(PTree,cset,wprint);
getByte(&b);
}
getEnd();
}
/* release derivation tree(s) */
OT_DEL_T(trees);
/* release parse table */
PLR_delTab(PTab);
/* quit module */
PGM_quit();
BUG_CORE;
return(0);
}
styx-2.0.1/pgm/pgm_sopt.inc 0000666 0001750 0001750 00000001266 10154036775 012571 0000000 0000000 charset : string = "" -- source file character set ( UTF-8, UCS4, ... )
skipset : string = "" -- ( ascii ) characters to be skipped
lookahead : flag = false -- enable n character lookahead
#ifndef EXCLUDE_OPTION_BINMODE
binmode : flag = false -- scan source file in binary mode ( not with charset-option )
#end
wprint : flag = false -- unicode / UTF-8 output ( on non-default character set )
prepar : string = "" -- standard preprocessing: yes or list index~value , ...
premac : string = "" -- standard preprocessing: pre-defined macro , ...
prefun : string = "" -- user-defined preprocessing: Function@Library ( not with prepar-option )
styx-2.0.1/pgm/pim_test.cmd 0000666 0001750 0001750 00000001466 10373405111 012544 0000000 0000000 # [pim_test.cmd] command description for pim_test.c
Program pim_test -- Parser test program
doc
'pim_test' parses the given source file and lists the derivation tree on stdout.
The source file must be conform with the language parameter. It uses the image files
of the parser and scanner tables, [Language.lim] and [Language.pim].
In case you specify a start symbol the parsing process starts from this nonterminal,
provided it is defined in [Language.sty].
By default the parser takes the first start nonterminal.
cod
Arguments
#include pgm_arg.inc
Options
#include pgm_sopt.inc
#include pgm_popt.inc
tree : flag = true -- create a derivation tree
#include pgm_odoc.inc
Environment
BINSTYX : path = "PATH" -- search environment for [Language.pim] and [Language.lim]
styx-2.0.1/pgm/pgm_odoc.inc 0000666 0001750 0001750 00000002234 07600567367 012534 0000000 0000000
doc
The options 'prepar' and 'premac' are only useful with styx-like preprocessing.
If your language uses the same preprocessing directives as specified in [styx.sty],
but differnt macro token identifiers and keywords, the option 'prepar' can be used to
enable preprocessing and specify the differences as a comma separated list:
- 0~name of identifier token
- 1~name of macro definition token
- 2~name of argument separator token
- 3~name of include token
- 4~name of conditional token
- 5~name of undefine token
- 6~#macro keyword
- 7~#end keyword
- 8~#ifdef keyword
- 9~#ifndef keyword
- 10~#else keyword
- 11~#include keyword
- 12~#undefine keyword
- 13~environment variable or path list as search path for include files
- 14~include file character set ( default: charset-option )
The option 'premac' supports pre-defined macros in connection with
styx-like preprocessing.
Dynamic library support is a prerequisite for the user-defined callback handler.
cod
styx-2.0.1/pgm/lim_test.cmd 0000666 0001750 0001750 00000001304 10373405111 012527 0000000 0000000 # [lim_test.cmd] command description for lim_test.c
Program lim_test -- Scanner test program
doc
'lim_test' scans the given source file and lists the tokens on stdout.
The source file must be conform with the language parameter. It uses the image file
of the scanner table [Language.lim].
The current version doesn't support the embedded language facility.
cod
Arguments
#include pgm_arg.inc
Options
#include pgm_sopt.inc
tokens : flag = true -- create list of all scanned tokens
symbols : flag = false -- create list of all symbols in the internal symbol table
#include pgm_odoc.inc
Environment
BINSTYX : path = "PATH" -- search environment for [Language.lim]
styx-2.0.1/pgm/stydoc.cmd 0000666 0001750 0001750 00000002355 10373405111 012223 0000000 0000000 # [stydoc.cmd] command description for stydoc.c
Program stydoc -- STYX Documentation Generator
doc
'stydoc' produces a HTML-like reference documentation for a STYX grammar [.sty].
Comments not starting with ';;' will also be included.
cod
Arguments
InFile : path -- path of the STYX grammar [.sty]
Template : path -- path of the template file (eg. tstydoc_us.htm)
doc
The target file 'OutFile' should contain the language name so that
embedded languages can be referenced, too.
cod
Options
OutFile : path = "" -- path of the target file (default: stdout)
StyxPath : path = "." -- path of STYX grammar include files
RefAlias : string = "&" -- alias for the first character of a pattern reference
recursiv : flag = false -- recursive pattern evaluation
prodcom : flag = false -- print production comments
keepNTs : string = "" -- NTs which shouldn't be expanded ( NT ; ... )
noClass : string = "" -- split NT Classes ( NT ; ... )
exProds : string = "" -- hide NT Productions ( NT . Prod ; ... )
ignRRef : string = "" -- ignore recursive references ( NT ; ... )
Environment
BINSTYX : path = "PATH" -- search environment for the parse table image [.pim]
styx-2.0.1/pgm/pim_test.c 0000666 0001750 0001750 00000004213 10161654703 012224 0000000 0000000 /* ------------------------------------------------------------------------ */
/* */
/* [pim_test.c] Parser Test */
/* */
/* Copyright (c) 1993 by D\olle, Manns */
/* ------------------------------------------------------------------------ */
#include "stdosx.h"
#include "pgm_base.h"
#include "pgm_sopt.h"
#include "pgm_popt.h"
#include "pim__cim.h"
#define language CTX_EVAL(string,"Language")
#define filename CTX_EVAL(string,"FileName")
#define binmode CTX_EVAL(bool,"binmode")
#define tree CTX_EVAL(bool,"tree")
#define binpath CTX_EVAL(string,"BINSTYX")
int main(int argc, string argv[])
{ PLR_Tab PTab; Scn_T Scn; Scn_Stream cStream;
PT_Cfg PCfg; PT_Term PTree;
/* init module */
PGM_init(argc,argv,CTX_init_pim_test);
/* init pre-processing */
PGM_initPreprocessing(prepar,premac,cset);
/* create & init scan & parse tables */
PGM_initTables(binpath,language,&PTab,&Scn);
/* create & init scan stream */
cStream = PGM_initScanStream
(
Scn,filename,prepar,prefun,binmode,cset,
skipset,CTX_EVAL(bool,"lookahead"),False
);
/* init parse configuration */
PCfg = PGM_initParsing(cStream,PTab);
/* parse and construct tree */
/* early --> print tree */
PTree = PGM_parse(PCfg,start,shiftfun,reducefun,early,xaron);
if( early )
{
while( PTree != (PT_Term)NULL )
{
if( tree ) PGM_printTree(PTree,cset,wprint);
PT_delT(PTree);
PTree = PGM_parse(PCfg,start,shiftfun,reducefun,early,xaron);
}
}
/* quit parse configuration */
PT_quit(PCfg);
/* print derivation tree */
if( tree ) PGM_printTree(PTree,cset,wprint);
/* release derivation tree */
if( PTree != (PT_Term)NULL ) PT_delT(PTree);
/* release scan stream, scan & parse tables */
PGM_quitScanStream(cStream);
PGM_quitTables(PTab,Scn);
/* quit preprocessing */
PGM_quitPreprocessing(prepar);
/* quit module */
PGM_quit();
BUG_CORE;
return(0);
}
styx-2.0.1/pgm/styx.cmd 0000666 0001750 0001750 00000006135 10373405111 011725 0000000 0000000 # [styx.cmd] command description for [styx.c]
Program styx -- A combined parser and scanner generator
doc
'styx' translates the token and syntax description for a language in [$SPESTYX/Language.sty]
into scanner and parser tables and a functional interface to the abstract derivation tree.
The generated tables have to be applied to the actual scanner and parser function which are part of the
styx library. The result of the parser function will be a derivation tree which can be accessed through
the above mentioned interface.
cod
Arguments
Language : name -- language name
Options
diagnose : flag = false -- additional diagnose and information
verbose : flag = false -- progress information
conflicts : flag = true -- prevent parse table generation in case of conflicts
makeIMG : flag = false -- create binary table images
makeINT : flag = false -- create interface c source
makeANT : flag = false -- create abstract interface c source
makeC : flag = false -- create table c sources
export : flag = false -- export table definitions
exportTMPL: string = "" -- export template file
shortform : flag = false -- use short form of language name
doc
Dependant on the given options different source and image files will be created:
- -makeIMG
For an interpretative execution you may only need the binary
[$BINSTYX/Language.pim] and [$BINSTYX/Language.lim] image files which
contain the parser and scanner tables.
- -makeINT
To process the derivation tree within your c/c++ program it's useful to
create the interface c source [$GENSTYX/Language(1,4)_int.c].
- -makeANT
To process a derivation tree variant optimized wrt. memory usage it's useful
to create the special interface c source [$GENSTYX/Language(1,4)_ant.c].
- -makeC
Instead of using the table image files you can include the c sources
[$GENSTYX/Language(1,4)_pim.c] and [$GENSTYX/Language(1,4)_lim.c].
This option implies '-makeINT'.
- -export
In order to use the C++ scanner and parser classes you may only need the
file [$BINSTYX/Language.ltbl] which contains the scanner table definition and.
[$BINSTYX/Language.ptbl] which contains the parse table definition.
- -exportTMPL=template file
The given template file will be used for the export of the scanner and parse table
as constant string definitions in the format of the preferred programming language.
The placeholder @TABLE@ will be replaced by the concatenation of table type and
language ID.
The line containing the placeholder @LINE@ will be replicated for each
line of the current definition. Before substituting a quoted placeholder @LINE@
the actual definition line will be converted applying C-style quoting rules.
cod
Environment
BINSTYX : path = "." -- [.pim], [.lim] and [.ltbl] target directory
GENSTYX : path = "." -- [.c] target directory
SPESTYX : path = "." -- [.sty] source directory
styx-2.0.1/pgm/stypp.c 0000666 0001750 0001750 00000007222 10161654767 011574 0000000 0000000 /* ------------------------------------------------------------------------ */
/* */
/* [stypp.c] Pretty Printer */
/* */
/* Copyright (c) 1993 by D\olle, Manns */
/* ------------------------------------------------------------------------ */
#include "stdosx.h"
#include "ptm_pp.h"
#include "glo_tab.h"
#include "pgm_base.h"
#include "pgm_sopt.h" /* after ptm_pp.h becourse of naming conflicts */
#include "pgm_popt.h"
#include "styp_cim.h"
#define srclang CTX_EVAL(string,"srclang")
#define dstlang CTX_EVAL(string,"dstlang")
#define filename CTX_EVAL(string,"filename")
#define ppfun CTX_EVAL(string,"ppfun")
#define binpath CTX_EVAL(string,"BINSTYX")
int main(int argc, string argv[])
{ PLR_Tab PTabS, PTabD; Scn_T Scn;
Scn_Stream cStream; PT_Cfg PCfg; PTP_T ctx;
PT_Term PTreeS = (PT_Term)NULL, PTreeD = (PT_Term)NULL;
c_string pplib, s;
symbol (*fun)(symbol t_id, symbol t_src) = NULL;
/* init module */
PGM_init(argc,argv,CTX_init_stypp);
/* init user-defined pp token conversion handler */
if( strlen(ppfun) > 0 )
{
assert0
(
(s=strstr(ppfun,"@")) != (c_string)NULL, "missing ppfun-library"
);
pplib = s+1; *s = '\0';
fun = (symbol (*)(symbol tok, symbol val))Glo_load
(
stringToSymbol(pplib),stringToSymbol(ppfun),True
);
*s = '@';
}
/* init pre-processing */
PGM_initPreprocessing(prepar,premac,cset);
/* create & init scan & parse tables */
PTabS = PLR_getTab_env(binpath,srclang);
PTabD = PLR_getTab_env(binpath,dstlang);
Scn_get_env(binpath,srclang,&Scn);
/* create & init scan stream */
cStream = PGM_initScanStream
(
Scn,filename,prepar,prefun,False,cset,
skipset,CTX_EVAL(bool,"lookahead"),False
);
/* init parse configuration */
PCfg = PT_init(PTabS,cStream);
/* parse, transform and pp tree */
/* early --> parse, transform and pp partial trees */
PTreeS = PGM_parse(PCfg,start,shiftfun,reducefun,early,xaron);
PT_setErrorCnt(PT_synErrorCnt(PCfg));
if( early )
{
while( PTreeS != (PT_Term)NULL && PT_errorCnt() == 0 )
{
/* transform and pp partial source tree */
ctx = PTP_init_reentrant(PTabD);
if( fun != NULL ) PTP_tok_conv_reentrant(ctx,(symbol)NULL,fun);
PTreeD = PTP_transform_reentrant(ctx,PTreeS);
PTP_pp_reentrant(ctx,PTreeD,STDOUT);
PTP_quit_reentrant(ctx);
/* release partial source and target tree */
if( PTreeD != (PT_Term)NULL ) PT_delT(PTreeD);
PT_delT(PTreeS);
/* parse next partial source tree */
PTreeS = PGM_parse(PCfg,start,shiftfun,reducefun,early,xaron);
PT_setErrorCnt(PT_synErrorCnt(PCfg));
}
}
if( PTreeS != (PT_Term)NULL && PT_errorCnt() == 0 )
{
/* transform and pp source tree */
ctx = PTP_init_reentrant(PTabD);
if( fun != NULL ) PTP_tok_conv_reentrant(ctx,(symbol)NULL,fun);
PTreeD = PTP_transform_reentrant(ctx,PTreeS);
PTP_pp_reentrant(ctx,PTreeD,STDOUT);
PTP_quit_reentrant(ctx);
/* release target tree */
if( PTreeD != (PT_Term)NULL ) PT_delT(PTreeD);
}
/* quit parse configuration */
PT_quit(PCfg);
/* release source tree */
if( PTreeS != (PT_Term)NULL ) PT_delT(PTreeS);
/* release scan stream, scan & parse tables */
PGM_quitScanStream(cStream);
PLR_delTab(PTabD);
PLR_delTab(PTabS);
Scn_free(Scn);
/* quit preprocessing */
PGM_quitPreprocessing(prepar);
/* quit module */
PGM_quit();
BUG_CORE;
return(0);
}
styx-2.0.1/pgm/pim2dot.c 0000666 0001750 0001750 00000017125 10136506720 011761 0000000 0000000 /* ------------------------------------------------------------------------ */
/* */
/* [pim2dot.c] Parse table visualisation ( pim -> dot ) */
/* */
/* Copyright (c) 2004 by D\olle, Manns */
/* ------------------------------------------------------------------------ */
#include "stdosx.h"
#include "prs.h"
#include "hset.h"
#include "literal.h"
#include "pgm_base.h"
#include "gstream.h"
#include "line_scn.h"
#include "pathes.h"
#include "sink.h"
#include "pim2dot_cim.h"
#define imgfile CTX_EVAL(string,"Img")
#define tmplfile CTX_EVAL(string,"Template")
#define outfile CTX_EVAL(string,"OutFile")
#define diatype CTX_EVAL(string,"DiaType")
static FILE* SysOut = NULL;
static void evalTemplate()
{
if( strlen(tmplfile) > 0 )
{ FILE* fp = OpnFile(tmplfile,"rb");
string line = Line_get(fp);
fprintf(SysOut,"\n");
while( line != NULL )
{
fprintf(SysOut,"%s\n",line);
FreeMem(line);
line = Line_get(fp);
}
fprintf(SysOut,"\n");
}
}
static MAP(long,long) collectTNodes(PLR_Tab ptab)
{ MAP(long,long) states = MAP_newPrimMap();
long i;
for( i=0; i < PLR_stateCnt(ptab); ++i )
{
MAP_dfndom(states,i,-1);
}
return states;
}
static string dotLiteral(string s, string q)
{ Sink res = Sink_open();
for (; *s != 0; s += 1)
switch(*s)
{
case '\"' :
case '\\' : Sink_putc(res,'\\'); Sink_putc(res, *s); break;
case '\r' : Sink_putc(res,'\\'); Sink_putc(res,'r'); break;
case '\n' : Sink_putc(res,'\\'); Sink_putc(res,'n'); break;
case '\f' : Sink_putc(res,'\\'); Sink_putc(res,'f'); break;
case '\t' : Sink_putc(res,'\\'); Sink_putc(res,'t'); break;
default : if( strchr(q,(*s)) != NULL )
{
Sink_putc(res,'\\'); Sink_putc(res,(*s));
}
else
if (!isspace(*s) && isprint(*s))
Sink_putc(res,*s);
else Sink_printf(res,"0x%02x",(*s)&0xff);
};
return Sink_close(res);
}
static void printRNode(PLR_Tab ptab, long nt)
{ c_bool start = C_False;
long i;
for( i=0; i < PLR_startCnt(ptab); ++i )
{
if( PLR_startSymbol(ptab,i) == nt )
{
start = C_True; break;
}
}
fprintf(SysOut,"\n node%ld [",nt);
fprintf(SysOut," label=\"%s\"",PLR_symName(ptab,nt));
if( start )
fprintf(SysOut," shape=box");
fprintf(SysOut,"]");
}
static void printTNode(PLR_Tab ptab, MAP(long,long) states, long state)
{ ROW(long) vaction = PLR_actionValues(ptab,state);
long l, p, s, t, i; c_string sym; c_bool reduce = C_False;
s = MAP_apply(long,states,state);
fprintf(SysOut,"\n node%ld [",state);
fprintf(SysOut," label=\"{%ld",state);
if( s >= 0 )
{
if( CFG_WCKEY(PLR_symType(ptab,s)) || CFG_KEY(PLR_symType(ptab,s)) )
{ string lbl = dotLiteral(PLR_symName(ptab,s),"<>{}|");
fprintf(SysOut,"|%s",lbl);
FreeMem(lbl);
}
else
{
fprintf(SysOut,"|%s",PLR_symName(ptab,s));
}
}
else
{
fprintf(SysOut,"|");
}
for( i=0; i < OT_CNT(vaction); i+=2 )
{
p = OT_GET(long,vaction,i);
t = OT_GET(long,vaction,i+1);
if( p >= -1 )
{
reduce = C_True;
if( p >= 0 )
{
l = PLR_prodSymCnt(ptab,p);
sym = PLR_symName(ptab,PLR_prodNonTerm(ptab,p));
fprintf(SysOut,"|%ld-%s.%s",l,sym,PLR_prodName(ptab,p));
}
else
if( t >= PLR_tokenCnt(ptab) )
{
s = t - PLR_tokenCnt(ptab);
sym = PLR_symName(ptab,PLR_startSymbol(ptab,s));
fprintf(SysOut,"|%s",sym);
}
}
}
fprintf(SysOut,"}\"");
fprintf(SysOut," shape=record");
if( reduce )
fprintf(SysOut," style=filled");
fprintf(SysOut,"]");
OT_DEL_T(vaction);
}
static void pim2tdot(PLR_Tab ptab)
{ MAP(long,long) edges = MAP_newPrimMap(),
states = collectTNodes(ptab);
MAPIT itr; long i, j, k, s1, s2, t, s;
fprintf(SysOut,"\ndigraph t_%s",PLR_language(ptab));
fprintf(SysOut,"\n{");
evalTemplate();
for( i=0; i < PLR_stateCnt(ptab); ++i )
{ ROW(int) vshift = PLR_shiftValues(ptab,i);
MAP_rmvall(edges);
for( k=0; k < OT_CNT(vshift); k+=2 )
{
s1 = OT_GET(long,vshift,k+1);
t = OT_GET(long,vshift,k);
MAP_ovrdom(edges,s1,i);
s = MAP_apply(long,states,s1);
assert0( s < 0 || s == t, "shift symbol mismatch");
MAP_ovrdom(states,s1,t); // t = 0..tokenCnt-1
}
MAP_forItrAsg(j,k,itr,edges)
{
fprintf(SysOut,"\n node%ld -> node%ld ",i,j);
}
OT_DEL_T(vshift);
}
for( i=0; i < PLR_nontermCnt(ptab); ++i )
{ ROW(int) vgoto = PLR_gotoValues(ptab,i);
MAP_rmvall(edges);
for( j=0; j < OT_CNT(vgoto); j+=2 )
{
s1 = OT_GET(long,vgoto,j+1);
s2 = OT_GET(long,vgoto,j);
s = MAP_apply(long,states,s2);
assert0( s < 0 || s == PLR_NTI_TO_NTS(ptab,i), "goto symbol mismatch");
MAP_ovrdom(states,s2,PLR_NTI_TO_NTS(ptab,i));
fprintf(SysOut,"\n node%ld -> node%ld ",s1,s2);
}
OT_DEL_T(vgoto);
}
for( i=0; i < PLR_stateCnt(ptab); ++i )
{
printTNode(ptab,states,i);
}
fprintf(SysOut,"\n}\n");
MAP_freeMap(edges);
MAP_freeMap(states);
}
static void pim2rdot(PLR_Tab ptab)
{ MAP(long,SET(long)) products = MAP_newPrimMap();
MAP(long,long) edges = MAP_newPrimMap();
SET(long) ntset, pset; long nt, p, s, i, j;
if( !strcmp(diatype,"R") )
fprintf(SysOut,"\ndigraph r_%s",PLR_language(ptab));
else
fprintf(SysOut,"\ndigraph a_%s",PLR_language(ptab));
fprintf(SysOut,"\n{");
evalTemplate();
for( i=0; i < PLR_nontermCnt(ptab); ++i )
{
s = PLR_NTI_TO_NTS(ptab,i);
if( !strcmp(diatype,"A") )
s = PLR_NTS_TO_NTC(ptab,s);
if( !MAP_defined(products,s) )
{
pset = HS_CREATE_ADTSET(long);
MAP_dfndom(products,s,pset);
printRNode(ptab,s);
}
}
for( i=0; i < PLR_prodCnt(ptab); ++i )
{
nt = PLR_prodNonTerm(ptab,i);
if( nt < PLR_tokenCnt(ptab) + PLR_nontermCnt(ptab) )
{
if( !strcmp(diatype,"A") )
nt = PLR_NTS_TO_NTC(ptab,nt);
pset = MAP_apply(SET(long),products,nt);
HS_SET_ELM(i,pset);
}
}
for( i=0; i < PLR_nontermCnt(ptab); ++i )
{ HS_Itr itr;
nt = PLR_NTI_TO_NTS(ptab,i);
if( !strcmp(diatype,"A") )
nt = PLR_NTS_TO_NTC(ptab,nt);
pset = MAP_apply(SET(long),products,nt);
if( pset != NULL )
{
ntset = HS_CREATE_ADTSET(long);
HS_FORALL(p,itr,pset)
{
for( j=0; j < PLR_prodSymCnt(ptab,p); ++j )
{
s = PLR_prodSymbol(ptab,p,j);
if( CFG_NTM(PLR_symType(ptab,s)) )
{
if( !strcmp(diatype,"A") )
s = PLR_NTS_TO_NTC(ptab,s);
HS_SET_ELM(s,ntset);
}
}
}
HS_FORALL(s,itr,ntset)
{
fprintf(SysOut,"\n node%ld -> node%ld ",nt,s);
}
HS_DROP_SET(ntset);
HS_DROP_SET(pset);
if( !strcmp(diatype,"A") )
MAP_ovrdom(products,nt,NULL);
}
}
fprintf(SysOut,"\n}\n");
MAP_freeMap(edges);
MAP_freeMap(products);
}
int main(int argc, string argv[])
{ PLR_Tab ptab;
/* init module */
PGM_init(argc,argv,CTX_init_pim2dot);
/* get the parse table */
ptab = PLR_getTab_file(imgfile);
/* produce the dot file */
if( strlen(outfile) > 0 )
SysOut = OpnFile(outfile,"wt");
else SysOut = stdout;
if( !strcmp(diatype,"T") ) pim2tdot(ptab);
else pim2rdot(ptab);
/* free the parse table */
PLR_delTab(ptab);
/* quit module */
PGM_quit();
BUG_CORE;
return(0);
}
styx-2.0.1/pgm/ctoh.c 0000666 0001750 0001750 00000127634 11230631142 011340 0000000 0000000 /* ------------------------------------------------------------------------ */
/* */
/* [ctoh.c] Creates an Interface File from a C-Source */
/* */
/* Copyright (c) 1994 by D\olle, Manns */
/* ------------------------------------------------------------------------ */
/* [*.h] files should now look like */
/* */
/* Header ... */
/* */
/* #ifndef __MODNAME */
/* #define __MODNAME */
/* */
/* Includes ... */
/* */
/*+++ #ifdef __cplusplus */
/*+++ extern "C" { */
/*+++ #endif */
/* */
/* Signature ... */
/* */
/*+++ #ifdef __cplusplus */
/*+++ } */
/*+++ #endif */
/* #endif __MODNAME */
#include "stdosx.h"
#include "pathes.h"
#include "sink.h"
#include "dicts.h"
#include "line_scn.h"
#include "com_get.h"
#include "hmap.h"
#include "hset.h"
#include "symbols.h"
#include "ctoh_cim.h"
#include "binimg.h"
#include "scn_base.h"
#include "ccnv_lim.h"
static long pgmtim; /* the start time of this program */
static string null_line = "";
static string scan_line = (string)NULL;
static string line = (string)NULL;
static symbol ccls = (symbol)NULL;
static string cfid = (string)NULL;
static string lnam = (string)NULL;
static string hnam = (string)NULL;
static string cnam = (string)NULL;
static string enam = (string)NULL;
static FILE *SysIn = (FILE*)NULL;
static FILE *SysOut = (FILE*)NULL;
static FILE *SysExp = (FILE*)NULL;
static FILE *SysDoc = (FILE*)NULL;
static long lineno = 0; /* current line number */
static bool Patched = False; /* c/h patched in header comment */
static bool IncludeSeen = False; /* passed any includes */
static bool Shift = False; /* between '{' ... '}' */
static bool OnOff = True; /* 'INTERFACE_ON/OFF' */
static bool mainSeen = False; /* 'main' seen */
#define GenExp CTX_EVAL(string ,"exp")
#define GenApi CTX_EVAL(string ,"api")
static symbol ApiSym = (symbol)NULL;
#define CTypConv CTX_EVAL(bool,"ct")
static Scn_T pScn = (Scn_T)NULL;
#define DROOT CTX_EVAL(string ,"DROOT")
#define GET_REFERENCE(a,b) (getReference((void**)(a),(void (*)(void**))(b)))
#define PUT_REFERENCE(a,b) (putReference((void*)(a),(void (*)(void*))(b)))
#define LineLength 78
#define CommentMargin 40
#define HTML_DOCTYPE \
""
bool beginswith(string key)
{
return strncmp(line,key,strlen(key)) == 0;
}
bool endswith(string key)
{ int len = strlen(line), klen = strlen(key);
if( len < klen ) return False;
return strncmp(line+len-klen,key,klen) == 0;
}
void patchhead(void)
{ int fidlen = strlen(cfid), i, len = strlen(line);
for (i = 0; i < len; i++)
{
if (line[i] == '[' && strncmp(cfid,line+i+1,fidlen) == 0)
{ int j, k;
for( j=fidlen-1; j > 0; --j )
if( line[i+j] == '.' )
{
line[i+j+1] = 'h'; Patched = True; break;
}
k = i + fidlen + 1;
if( line[k] == '(' )
{ string s; int clslen = 0;
for( k=k+1; k < len; ++k )
if( line[k] == ')' )
{ ++k; break; }
else
{
if( isalpha(line[k]) || line[k] == '_' ) ++clslen;
else
{
fprintf(STDERR,"Warnung: %s bad module name.\n",cfid);
return;
}
}
s = SubStrCopy(line+i+fidlen+2,clslen);
ccls = stringToSymbol(s);
FreeMem(s);
}
if( line[k] != ']' )
{
fprintf(STDERR,"Warnung: %s missing closing bracket.\n",cfid);
return;
}
}
}
}
bool c_getline(void)
{
if( scan_line != NULL ) FreeMem(scan_line);
if ((scan_line = Line_get(SysIn)) == NULL)
{
line = null_line; return False;
}
else line = scan_line;
lineno += 1;
if (!Patched) patchhead();
if (line[0] == '{') Shift = True;
if (line[0] == '}') Shift = False;
mainSeen |= beginswith("main") || beginswith("int main");
return True;
}
static string convBlock(string szBlock)
/* C-Header-Block-Filter */
{ string szResult, szTxt;
Sink pSnk;
Scn_Stream pStream;
if (strstr(szBlock,"/*NOCONVERSION*/"))
return StrCopy(szBlock);
pSnk = Sink_open();
pStream = Stream_string(pScn, szBlock);
Stream_defEofId(pStream, -1);
Stream_defErrId(pStream, 0);
Stream_defTokId(pStream, "Ide", 1);
Stream_defTokId(pStream, "Inc", 2);
Stream_defTokId(pStream, "Com", 3);
Stream_defTokId(pStream, "Other", 4);
for(Stream_next(pStream); Stream_ctid(pStream) >= 0; Stream_next(pStream))
{
szTxt = symbolToString(Stream_csym(pStream));
if (Stream_ctid(pStream) == 1)
{
if( !strcmp(szTxt,"byte") ) Sink_printf(pSnk,"c_byte");
else
if( !strcmp(szTxt,"word") ) Sink_printf(pSnk,"c_word");
else
if( !strcmp(szTxt,"string") ) Sink_printf(pSnk,"c_string");
else
if( !strcmp(szTxt,"bool") ) Sink_printf(pSnk,"c_bool");
else
if( !strcmp(szTxt,"False") ) Sink_printf(pSnk,"C_False");
else
if( !strcmp(szTxt,"True") ) Sink_printf(pSnk,"C_True");
else Sink_printf(pSnk,"%s",szTxt);
}
else Sink_printf(pSnk,"%s",szTxt);
}
szResult = Sink_close(pSnk);
Stream_close(pStream);
Stream_free(pStream);
return szResult;
}
static bool Funpossible;
bool CppFunDef(void)
/* ob 'line' eine Methodendefinition einleitet */
{ int len = strlen(line), i;
/* assumes isLetter(line[0]) */
for( i=1; i < len-1; ++i )
{
if( line[i] == ':' && line[i+1] == ':' ) return( True );
if( ! ( islower(line[i]) ||
isupper(line[i]) ||
isdigit(line[i]) ||
line[i] == '*' ||
line[i] == '&' ||
line[i] == '_' ||
line[i] == ' ' ) ) return( False );
}
return( False );
}
bool BlockStart(void)
/* whether 'line' starts an interface block */
{
Funpossible = False;
if (Shift) return False;
if (!OnOff) return False;
if (beginswith("ExternalType"))
{
strncpy(line,"Abstract",8);
return True;
}
if (beginswith("ExternalDecl"))
{
strncpy(line,"AbstractType",12);
return True;
}
//18.10.98 _DLL_EXPORT_ startet einen Interface-Block !
if( beginswith("_DLL_EXPORT_") ||
(
( islower(line[0]) || isupper(line[0]) )
&& !beginswith("ConcreteType")
&& !beginswith("ConcreteImp")
&& !beginswith("static")
&& !beginswith("struct")
&& !beginswith("union")
&& !beginswith("typedef")
/* C++ - Rules */
&& !beginswith("class")
&& !beginswith("template")
&& !beginswith("inline")
&& !beginswith("namespace")
&& !beginswith("using")
&& !CppFunDef()
)
)
{
//Funpossible = (line[strlen(line)-1] == ')');
Funpossible = True;
return True;
}
if (beginswith("#include") && !IncludeSeen)
{ IncludeSeen = True; return True; }
if (beginswith("/*I-") || beginswith("/*I="))
{ line[2] = ' '; return True; }
return False;
}
static string replaceDocBlock(string block)
{ MAP(symbol,symbol) m = MAP_newPrimMap();
string res = (string)NULL;
MAP_dfndom(m,stringToSymbol("<"),stringToSymbol("<"));
MAP_dfndom(m,stringToSymbol(">"),stringToSymbol(">"));
MAP_dfndom(m,stringToSymbol("/*NOCONVERSION*/"),stringToSymbol(""));
res = Line_replace(block,m);
MAP_freeMap(m);
return res;
}
void writeDocFun
(
FILE* fp_doc, long idx, string funtyp, string funhdr, string funcom
)
/* writes a function declaration to the current document file */
/*
idx = -1 ==> multi line function definition in 'funhdr' or
end of single line function definitions
idx >= 0 ==> single line function definition [idx] in
'funtyp', 'funhdr', 'funcom'
*/
{ string dfuntyp, dfunhdr, dfuncom, t, t1, t2, t3;
if( idx == 0 || ( idx == -1 && funhdr != (string)NULL ) )
{
//if( idx == 0 ) fprintf(fp_doc,"
\n");
fprintf(fp_doc,"\n");
}
if( funhdr != (string)NULL )
{
dfunhdr = replaceDocBlock(funhdr);
fprintf(fp_doc,"\n");
fprintf(fp_doc,"");
if( funtyp != (string)NULL )
{
dfuntyp = replaceDocBlock(funtyp);
fprintf(fp_doc,"%s ",dfuntyp);
FreeMem(dfuntyp);
}
else
fprintf(fp_doc,"");
t1 = Line_withoutCCom(dfunhdr);
t = Line_clip(t1);
if( t1 != dfunhdr ) FreeMem(t1);
t1 = strstr(t,"#define ");
if( t1 != (string)NULL ) *t1 = '\0';
t2 = Line_getCFunNam(t);
if( t1 != (string)NULL ) *t1 = '#';
t1 = t;
if( t2 != (string)NULL )
{
t3 = strstr(t1,t2);
while( t < t3 )
{
fprintf(fp_doc,"%c",*t); t += 1;
}
fprintf(fp_doc,"%s",t2);
fprintf(fp_doc,"%s\n",t3+strlen(t2));
}
else
{
fprintf(fp_doc,"%s\n",t1);
}
FreeMem(t1);
if( t2 != (string)NULL ) FreeMem(t2);
fprintf(fp_doc," | ");
if( funcom != (string)NULL )
{
dfuncom = replaceDocBlock(funcom);
fprintf ( fp_doc,"%s\n",dfuncom);
FreeMem(dfuncom);
}
else
{
t1 = Line_withCComText(dfunhdr);
if( t1 != (string)NULL )
{ Sink snk; PIT itr;
snk = Sink_open();
itr = PIT_make(t1); PIT_sep(itr,"\n");
while( ( t = PIT_read(itr) ) != NULL )
{
if( *t == '*' )
fprintf(fp_doc,"%s
\n",t+1);
else
Sink_printf(snk,"%s
\n",t);
}
t2 = Sink_close(snk);
fprintf(fp_doc,"%s",t2);
PIT_drop(itr);
FreeMem(t1);
FreeMem(t2);
}
else fprintf(fp_doc," ");
}
FreeMem(dfunhdr);
}
if( idx == -1 )
{
fprintf(fp_doc,"\n");
fprintf(fp_doc," |
\n");
}
}
void writeDocBlock(FILE* fp_doc, string block, bool forcedDocBlock)
/* writes 'block' to the current document file */
{ string dblock, t1, t2, t3, t;
bool flag = False;
PIT itr;
if ( strstr(block,"AbstractType") == block ||
strstr(block,"AbstractHugeType") == block )
{
dblock = replaceDocBlock(block);
fprintf(fp_doc,"
\n");
fprintf(fp_doc,"\n");
itr = PIT_make(dblock); PIT_sep(itr,"\n");
while( ( t = PIT_read(itr) ) != NULL )
{
t1 = strstr(t,"("),
t2 = strrchr(t,')');
if( t1 != (string)NULL && t2 != (string)NULL && t1 < t2 )
{
fprintf(fp_doc,"\n");
fprintf(fp_doc,"| ");
while( ( t1 += 1 ) < t2 )
{
fprintf(fp_doc,"%c",*t1);
}
fprintf(fp_doc,"\n");
fprintf(fp_doc," | ");
t1 = Line_withCComText(t);
fprintf(fp_doc,"%s\n",t1==(string)NULL?"abstract type":t1);
if( t1 != (string)NULL ) FreeMem(t1);
fprintf(fp_doc,"\n");
}
}
PIT_drop(itr);
fprintf(fp_doc," |
\n");
FreeMem(dblock);
}
else
if (strstr(block,"#include") == block)
{
dblock = replaceDocBlock(block);
t1 = Line_withoutCCom(dblock);
itr = PIT_make(t1); PIT_sep(itr,"\n");
while( ( t = PIT_read(itr) ) != NULL )
{
t2 = strstr(t,"#include");
if( t2 != (string)NULL )
{
t2 = strstr(t2,"\"");
if( t2 != (string)NULL )
{ Sink snk = Sink_open();
fprintf(fp_doc,"
#include \"%s.h\"\n",t3,t3);
FreeMem(t3);
}
else
{
fprintf(fp_doc,"
%s\n",t);
}
}
else
{
fprintf(fp_doc,"
%s\n",t);
}
}
PIT_drop(itr);
fprintf(fp_doc,"
\n");
if( t1 != dblock ) FreeMem(t1);
FreeMem(dblock);
}
else
if (strstr(block,"/* -") == block ||
(flag=(strstr(block,"/* =") == block)))
{
fprintf
(
fp_doc,
"
%s",
"%", flag?"4":"2", flag?"":""
);
t1 = block + 3;
while( *t1 != '\0' && ( *t1 == '-' || *t1 == '=' ) )
t1 += 1;
t2 = t1 + strlen(t1);
while( t2 > t1 && *t2 != '/' )
t2 -= 1;
t2 -= 3;
while( t2 > t1 && ( *t2 == '-' || *t2 == '=' ) )
t2 -= 1;
while( t1 <= t2 )
{
if( *t1 == '<' )
fprintf(fp_doc,"<");
else
if( *t1 == '>' )
fprintf(fp_doc,">");
else
fprintf(fp_doc,"%c",*t1);
t1 += 1;
}
fprintf(fp_doc,"%s
\n",flag?"":"");
}
else
{
if( forcedDocBlock )
{
dblock = replaceDocBlock(block);
fprintf(fp_doc,"
%s
\n",dblock);
FreeMem(dblock);
}
}
}
#define MaxFuncs 100
static struct
{
string typ;
string fun;
string com;
bool ext;
int ltyp;
int lfun;
int lcom;
}
Func[MaxFuncs];
static int topFunc = 0;
static int ltyp = 0;
static int lfun = 0;
static int lcom = 0;
void flushFuncs(void)
{ int i, xltyp, xlfun, xlcom;
if (topFunc == 0) return;
for (i = 0; i < topFunc; i++)
{
xltyp = (Func[i].ltyp==-1)?ltyp:Func[i].ltyp;
xlfun = (Func[i].lfun==-1)?lfun:Func[i].lfun;
xlcom = (Func[i].lcom==-1)?lcom:Func[i].lcom;
xlcom = MAX(xlcom,MIN(LineLength-CommentMargin+1,LineLength-xltyp-1-xlfun-2)-6);
if( Func[i].ext == False )
fprintf
(
SysOut, "%s%*s %s;%*s/* %s%*s */\n",
Func[i].typ, (int)(xltyp-strlen(Func[i].typ)),"",
Func[i].fun, (int)(xlfun-strlen(Func[i].fun)+
LineLength-xltyp-1-xlfun-1-xlcom-6),"",
Func[i].com, (int)(xlcom-strlen(Func[i].com)),""
);
else
fprintf
(
SysOut,"%s%s;\n\n",
( i>0&&Func[i-1].ext==False ) ? "\n" : "", Func[i].fun
);
if( SysDoc != (FILE*)NULL )
{
writeDocFun(SysDoc,i,Func[i].typ,Func[i].fun,Func[i].com);
}
if( Func[i].typ != (string)NULL ) FreeMem(Func[i].typ); FreeMem(Func[i].fun);
if( Func[i].com != (string)NULL ) FreeMem(Func[i].com);
}
fprintf(SysOut,"\n");
if( SysDoc != (FILE*)NULL )
{
writeDocFun(SysDoc,-1,(string)NULL,(string)NULL,(string)NULL);
}
topFunc = 0;
ltyp = 0;
lfun = 0;
lcom = 0;
}
void genFunExport(string CDecl)
{ string nam, t;
if( strstr(CDecl,"_NO_DLL_EXPORT_") == CDecl )
return;
t = strstr(CDecl,"#define");
if( t != (string)NULL ) *t = '\0';
nam = Line_getCFunNam(CDecl);
if( t != (string)NULL ) *t = '#';
if( nam != (string)NULL )
{
fprintf(SysExp,"/EXPORT:%s\n",nam);
FreeMem(nam);
}
}
void pushFuncLine(string h, string c)
{ int i, xltyp, xlfun, xlcom;
string typ, fun;
if(topFunc >= MaxFuncs) flushFuncs();
if( GenExp ) genFunExport(h);
for (i = 0; h[i] != 0 && h[i] != ' ' && h[i] != '('; i++);
if (h[i] != 0 && h[i] != '(')
{ h[i] = 0; typ = StrCopy(h); i+=1; }
else
{ i = 0; typ = StrCopy(""); }
while(h[i]==' ') i+=1;
fun = StrCopy(h+i);
FreeMem(h);
xltyp = strlen(typ);
xlfun = strlen(fun);
xlcom = strlen(c);
if (MAX(xltyp,ltyp)+1 + MAX(xlfun,lfun)+2 + MAX(xlcom,lcom)+6 > LineLength)
{
//flushFuncs();
for( i=topFunc-1; i >= 0; --i )
{
if( Func[i].ltyp == -1 )
{
Func[i].ltyp = ltyp;
Func[i].lfun = lfun;
Func[i].lcom = lcom;
}
}
ltyp = 0;
lfun = 0;
lcom = 0;
}
ltyp = MAX(xltyp,ltyp);
lfun = MAX(xlfun,lfun);
lcom = MAX(xlcom,lcom);
Func[topFunc].ltyp = -1;
Func[topFunc].lfun = -1;
Func[topFunc].lcom = -1;
Func[topFunc].typ = typ;
Func[topFunc].fun = fun;
Func[topFunc].com = c;
Func[topFunc].ext = False;
topFunc += 1;
}
void pushExtFuncLine(string fun)
{
if(topFunc >= MaxFuncs) flushFuncs();
Func[topFunc].ltyp = -1;
Func[topFunc].lfun = -1;
Func[topFunc].lcom = -1;
Func[topFunc].typ = (string)NULL;
Func[topFunc].fun = StrCopy(fun);
Func[topFunc].com = (string)NULL;
Func[topFunc].ext = True;
topFunc += 1;
}
void copyBlock(bool skipFirst, bool DocBlock, bool forcedDocBlock)
{ Sink snk = (Sink)NULL, ext = (Sink)NULL;
string temp = (string)NULL, s = (string)NULL, t;
bool expflg = ( !skipFirst && beginswith("_DLL_EXPORT_") ),
extflg = False;
if (Funpossible && !skipFirst && (line[strlen(line)-1] == ')'))
/* a simple function definition? */
{ int lft, rgh;
if( strlen(symbolToString(ApiSym)) > 0 && expflg )
{
s = line + strlen("_DLL_EXPORT_");
temp = Str_printf("_DLL_API_%s %s",symbolToString(ApiSym),s);
}
else temp = Str_printf("%s",line);
if( CTypConv )
{
t = convBlock(temp); FreeMem(temp); temp = t;
}
if( c_getline() && CTypConv )
{
t = convBlock(line); FreeMem(line); scan_line = line = t;
}
if
(
strstr(temp,"//") != (string)NULL ||
!(
line[0] == '{' ||
(beginswith("/*") && strcmp(line+strlen(line)-2,"*/") == 0)
) ||
( line[0] != '{' && strlen(temp) + strlen(line) + 2 > LineLength )
)
{
goto Ordinary;
}
if(line[0] == '{')
pushFuncLine(temp,StrCopy(""));
else
{
for (lft = 2; line[lft] == ' '; lft+=1);
for (rgh = strlen(line)-3; line[rgh] == ' '; rgh-=1);
if (rgh < lft)
rgh = lft-1;
line[rgh+1] = 0;
pushFuncLine(temp,StrCopy(line+lft));
}
while( line[0] != 0 && line[0] != '{') c_getline();
return;
Ordinary:
if( GenExp && line[0] != 0 )
{
if( line[0] == '{' ) genFunExport(temp);
else
{
ext = Sink_open();
Sink_printf(ext,"%s\n",temp);
}
}
if (line[0] == 0 || line[0] == '{')
{
t = Str_printf("%s\n",temp);
if( line[0] == '{' )
{
pushExtFuncLine(t);
}
else
{
flushFuncs();
fprintf(SysOut,"%s",t);
if( DocBlock )
writeDocBlock(SysDoc,t,forcedDocBlock);
}
FreeMem(temp); FreeMem(t);
return;
}
}
/* multiline function headers, macro definitions, ... */
snk = Sink_open();
if( temp != (string)NULL )
{
Sink_printf(snk,"%s\n",temp);
FreeMem(temp);
}
if (!skipFirst) Sink_printf(snk,"%s\n",line);
if( GenExp && Funpossible && !skipFirst &&
!beginswith("/*") && !beginswith("//") && !beginswith("#") )
{
extflg = True;
if( ext == (Sink)NULL )
ext = Sink_open();
Sink_printf(ext,"%s\n",line);
}
while(c_getline() && line[0] != 0 && line[0] != '{' )
{
if( extflg &=
( !beginswith("/*") && !beginswith("//") && !beginswith("#") ))
Sink_printf(ext,"%s\n",line);
if (beginswith("ExternalType"))
{
strncpy(line,"Abstract",8);
}
else
if (beginswith("ExternalDecl"))
{
strncpy(line,"AbstractType",12);
}
Sink_printf(snk,"%s\n",line);
}
temp = Sink_close(snk);
if( GenExp && Funpossible && !skipFirst )
{
t = Sink_close(ext);
if( line[0] == '{' ) genFunExport(t);
FreeMem(t);
}
if( CTypConv )
{
t = convBlock(temp); FreeMem(temp); temp = t;
}
if( strlen(symbolToString(ApiSym)) > 0 && expflg && s == (string)NULL )
{
t = Str_printf
(
"_DLL_API_%s %s%s",
symbolToString(ApiSym),temp + strlen("_DLL_EXPORT_"),
( line[0] == '{' ) ? "" : "\n"
);
}
else
t = Str_printf("%s%s",temp,( line[0] == '{' ) ? "" : "\n");
if( line[0] == '{' )
{
if( Funpossible && !skipFirst )
pushExtFuncLine(t);
else
{
flushFuncs();
fprintf(SysOut,"%s;\n\n",t);
if( DocBlock )
writeDocBlock(SysDoc,t,forcedDocBlock);
}
}
else
{
flushFuncs();
fprintf(SysOut,"%s",t);
if( DocBlock )
writeDocBlock(SysDoc,t,forcedDocBlock);
}
FreeMem(temp); FreeMem(t);
}
void skipDoc(void)
{
while(c_getline() && strcmp(line,"#endif") != 0) /* skip */;
}
void copyDoc
(
string szStartTagOri, string szStartTagNew, string szEndTag
)
{ string dline, t1, t2;
bool pretag = ( strstr(szStartTagOri,"!!") != (string)NULL );
if( SysDoc != (FILE*)NULL )
{
fprintf(SysDoc,"
");
if( pretag ) fprintf(SysDoc,"");
}
if( !strcmp(szStartTagOri,szStartTagNew) )
{
fprintf(SysOut,"%s\n",line);
}
else
{
fprintf(SysOut,"%s",szStartTagNew);
fprintf(SysOut,"%s\n",line+strlen(szStartTagOri));
}
t2 = strstr(line,szEndTag);
if( SysDoc != (FILE*)NULL )
{
dline = pretag?replaceDocBlock(line):StrCopy(line);
t2 = strstr(dline,szEndTag);
if( t2 != (string)NULL)
{
t1 = dline+strlen(szStartTagOri);
while( t1 < t2 )
{
fprintf(SysDoc,"%c",*t1); t1 += 1;
}
fprintf(SysDoc,"\n");
}
else
fprintf(SysDoc,"%s\n",dline+strlen(szStartTagOri));
FreeMem(dline);
}
if( t2 == (string)NULL)
{
while(c_getline() )
{
fprintf(SysOut,"%s\n",line);
if( (t2=strstr(line,szEndTag)) != (string)NULL)
{
if( SysDoc != (FILE*)NULL )
{
dline = pretag?replaceDocBlock(line):StrCopy(line);
t1 = dline;
t2 = strstr(dline,szEndTag);
while( t1 < t2 )
{
fprintf(SysDoc,"%c",*t1); t1 += 1;
}
fprintf(SysDoc,"\n");
FreeMem(dline);
}
break;
}
else
if( SysDoc != (FILE*)NULL )
{
dline = pretag?replaceDocBlock(line):StrCopy(line);
fprintf(SysDoc,"%s\n",dline);
FreeMem(dline);
}
}
}
fprintf(SysOut,"\n");
if( SysDoc != (FILE*)NULL )
{
if( pretag ) fprintf(SysDoc,"");
fprintf(SysDoc,"\n");
}
}
void copyToI(string szEndTag, bool forcedDocBlock)
{ Sink pSnk = (Sink)NULL;
string dline, szIBlock, szCnvIBlock;
if( CTypConv ) pSnk = Sink_open();
if( forcedDocBlock )
fprintf(SysDoc,"
\n");
while(c_getline() && strcmp(line,szEndTag) != 0)
{
if( CTypConv ) Sink_printf(pSnk,"%s\n",line);
else
{
fprintf(SysOut,"%s\n",line);
if( forcedDocBlock )
{
dline = replaceDocBlock(line);
fprintf(SysDoc,"%s\n",dline);
FreeMem(dline);
}
}
}
if( CTypConv )
{
szIBlock = Sink_close(pSnk);
szCnvIBlock = convBlock(szIBlock);
fprintf(SysOut,"%s\n",szCnvIBlock);
if( forcedDocBlock )
{
dline = replaceDocBlock(szCnvIBlock);
fprintf(SysDoc,"%s\n",dline);
FreeMem(dline);
}
FreeMem(szIBlock); FreeMem(szCnvIBlock);
}
else fprintf(SysOut,"\n");
if( forcedDocBlock )
fprintf(SysDoc,"\n");
}
void printCLinkageOn(void)
{
fprintf(SysOut,"\n");
fprintf(SysOut,"#ifdef __cplusplus\n");
fprintf(SysOut,"extern \"C\" {\n");
fprintf(SysOut,"#endif\n");
fprintf(SysOut,"\n\n");
}
void convertText(void)
{ bool CLinkageFlag = False;
Patched = False;
lineno = 0;
IncludeSeen = False;
Funpossible = False;
Shift = False;
OnOff = True; /* INTERFACE_ON ! */
mainSeen = False;
if (c_getline()) copyBlock(False,False,False);
if (!Patched) fprintf(STDERR,"Warning: %s missing header comment.\n",cfid);
Patched = True;
fprintf(SysOut,"/* File generated by 'ctoh'. Don't change manually. */\n");
fprintf(SysOut,"\n");
fprintf(SysOut,"#ifndef %s_INCL\n",symbolToString(ccls));
fprintf(SysOut,"#define %s_INCL\n",symbolToString(ccls));
fprintf(SysOut,"\n\n");
if( strlen(symbolToString(ApiSym)) > 0 )
{
fprintf(SysOut,"#ifndef _DLL_API_%s\n",symbolToString(ApiSym));
fprintf(SysOut,"#ifdef _DLL_DFN_%s\n",symbolToString(ApiSym));
fprintf
(
SysOut,"#define _DLL_API_%s _DLL_EXPORT_DECL_\n",symbolToString(ApiSym)
);
fprintf(SysOut,"#else\n");
fprintf(SysOut,"#ifndef _NO_DLL_%s\n",symbolToString(ApiSym));
fprintf(SysOut,"#define _DLL_API_%s _DLL_IMPORT_\n",symbolToString(ApiSym));
fprintf(SysOut,"#endif\n");
fprintf(SysOut,"#endif\n");
fprintf(SysOut,"#endif\n");
fprintf(SysOut,"\n");
}
while (c_getline())
{
if( CLinkageFlag == False && IncludeSeen == True )
{
printCLinkageOn(); CLinkageFlag = True;
}
if(BlockStart())
{
if( CLinkageFlag == False && Funpossible == True )
{
printCLinkageOn(); CLinkageFlag = True;
}
copyBlock(False,(SysDoc!=(FILE*)NULL),False);
}
else
if(beginswith("/*!!"))
{
flushFuncs();
copyDoc("/*!!","/* ","*/");
}
else
if(beginswith("/*!"))
{
flushFuncs();
copyDoc("/*!","/* ","*/");
}
else
if(strcmp(line,"/*INTERFACE*/") == 0)
copyBlock(True,(SysDoc!=(FILE*)NULL),False);
else
if(strcmp(line,"/*DOC_INTERFACE*/") == 0)
{
copyBlock(True,(SysDoc!=(FILE*)NULL),True);
}
else
if(strcmp(line,"/*INTERFACE_OFF*/") == 0)
{
OnOff = False;
}
else
if(strcmp(line,"/*INTERFACE_ON*/") == 0)
{
OnOff = True;
}
else
if(strcmp(line,"/*INTERFACE_GROUP*/") == 0)
{
flushFuncs();
}
else
if(strcmp(line,"#ifdef INTERFACE") == 0)
{
flushFuncs();
copyToI("#endif",False);
}
else
if(strcmp(line,"#ifdef DOC_INTERFACE") == 0)
{
flushFuncs();
copyToI("#endif",(SysDoc!=(FILE*)NULL));
}
else
if(strcmp(line,"/*INTERFACE_COPY_ON*/") == 0)
{
flushFuncs();
copyToI("/*INTERFACE_COPY_OFF*/",False);
}
else
if(strcmp(line,"/*DOC_INTERFACE_COPY_ON*/") == 0)
{
flushFuncs();
copyToI("/*DOC_INTERFACE_COPY_OFF*/",(SysDoc!=(FILE*)NULL));
}
else
if(strcmp(line,"#ifdef DOCUMENT") == 0)
{
skipDoc();
}
else
if( CLinkageFlag == False && strcmp(line,"/*INTERFACE_LINKAGE_ON*/") == 0 )
{
flushFuncs();
printCLinkageOn(); CLinkageFlag = True;
}
}
flushFuncs();
fprintf(SysOut,"\n");
if( CLinkageFlag == True )
{
fprintf(SysOut,"#ifdef __cplusplus\n");
fprintf(SysOut,"}\n");
fprintf(SysOut,"#endif\n\n");
}
fprintf(SysOut,"#endif\n");
}
#define tnam "____ctoh.___"
ConcreteType( ModuleInfo )
{
symbol Path; /* only in 'newmap' ( C-Path; Base is dom ) */
symbol hext;
symbol scls;
long Ctim;
long Htim;
short prog; /* mainflag */
};
ModuleInfo mi_Copy(ModuleInfo mi)
{ ModuleInfo res = New(ModuleInfo);
res->Path = mi->Path;
res->hext = mi->hext;
res->scls = mi->scls;
res->Ctim = mi->Ctim;
res->Htim = mi->Htim;
res->prog = mi->prog;
return res;
}
void mi_Free(ModuleInfo mi)
{
FreeMem(mi);
}
MAPTY glotyp;
MAPTY clstyp;
MAP(symbol, ModuleInfo) newmap;
MAP(symbol, ModuleInfo) oldmap;
MAP(symbol, HS_Set) clsmap;
MAP(symbol, long ) oldtim;
MAP(symbol, long ) newtim;
int errcnt;
bool validModule(symbol Cpath, symbol BaseSy, long Ctime, long Htime)
{ bool res = False;
if (MAP_defined(oldmap,BaseSy))
{ ModuleInfo mi = MAP_apply(ModuleInfo,oldmap,BaseSy);
res = (mi->Path == Cpath && mi->Ctim == Ctime && mi->Htim == Htime);
if (res)
{
ccls = mi->scls; mainSeen = mi->prog;
}
mi_Free(mi);
}
return res;
}
void addModule(symbol ModSy, ModuleInfo mi)
{
if (MAP_defined(newmap,ModSy))
{ ModuleInfo mo = MAP_apply(ModuleInfo,newmap,ModSy);
fprintf
(
STDERR,"Module [%s.c(xx)] both in dictionary '%s' and in '%s'.\n",
symbolToString(ModSy),
symbolToString(mi->Path),
symbolToString(mo->Path)
);
mi_Free(mo);
errcnt += 1;
MAP_upddom(newmap,ModSy,mi);
}
else MAP_dfndom(newmap,ModSy,mi);
}
void PutMi(void)
/* put module info to [$PRJ/ctoh.cth] */
{ symbol fsy; MAPIT itr;
putBgn("PRJ","ctoh.cth","");
putHeader("[ctoh.cth] Binary image for 'ctoh'\n","cth",3,0);
putWord((short)MAP_count(newmap));
MAP_forItr(fsy,itr,newmap)
{ ModuleInfo mi = MAP_apply(ModuleInfo,newmap,fsy);
putSymbol(fsy);
PUT_REFERENCE(mi->Path,putSymbol);
PUT_REFERENCE(mi->hext,putSymbol);
PUT_REFERENCE(mi->scls,putSymbol);
putLong(mi->Ctim);
putLong(mi->Htim);
putWord(mi->prog);
mi_Free(mi);
}
putWord((short)MAP_count(newtim));
MAP_forItr(fsy,itr,newtim)
{ long tim = MAP_apply(long,newtim,fsy);
putSymbol(fsy);
putLong(tim);
}
putEnd();
}
void GetMi(void)
/* get module info from [$PRJ/ctoh.cth] */
{ short i,size;
{ string tmp = MkPath("PRJ","ctoh.cth","",'p');
if (!IsPath(tmp)) { FreeMem(tmp); return; } else FreeMem(tmp);
}
getBgn("PRJ","ctoh.cth","");
getHeader("cth",3,0);
getWord(&size);
for (i = 0; i < size; i++)
{ symbol fsy; ConcreteImp(ModuleInfo) mi;
getSymbol(&fsy);
GET_REFERENCE(&mi.Path,getSymbol);
GET_REFERENCE(&mi.hext,getSymbol);
GET_REFERENCE(&mi.scls,getSymbol);
getLong(&mi.Ctim);
getLong(&mi.Htim);
getWord(&mi.prog);
MAP_dfndom(oldmap,fsy,&mi);
}
getWord(&size);
for (i = 0; i < size; i++)
{ symbol fsy; long tim;
getSymbol(&fsy);
getLong(&tim);
MAP_dfndom(oldtim,fsy,tim);
}
getEnd();
}
bool FileEqual(string fna, string fnb)
/* whether files 'fna' and 'fnb' are binary equal */
{ FILE* fa = OpnFile(fna,"rb");
FILE* fb = OpnFile(fnb,"rb");
int ca, cb;
for
(
ca = fgetc(fa), cb = fgetc(fb);
ca != EOF && cb != EOF && ca == cb;
ca = fgetc(fa), cb = fgetc(fb)
);
fclose(fa); fclose(fb);
return ca == cb;
}
/* ----------------- Handling Multiple Implementations --------------------- */
string normalize_header_line(string line, string cfid, bool *hl)
/* returns a line, normalizing header line if '*hl == True' */
{
if (!*hl || line == NULL) return line;
{ int i,j,k,m, len = strlen(line), blen = strlen(cfid); string ext;
for (i = 0; i < len; i++)
{
if (strncmp(cfid,line+i,blen) == 0)
{
if (line[i+blen] != '(') return line;
for( j=blen-1; j > 0 && line[i+j] != '.' ; --j );
ext = SubStrCopy(line+i+j,blen-j);
for( j=0; line[i+blen+1+j] != 0 && line[i+blen+1+j] != ')'; ++j )
line[i+j] = line[i+blen+1+j];
for( k=0; k < strlen(ext); k++)
line[i+j+k] = ext[k];
line[i+j+k] = ']';
for(m = 1; m < j+2; m++)
line[i+j+k+m] = ' ';
FreeMem(ext);
*hl = False;
return line;
}
}
}
return line;
}
string Line_get_normal(FILE* f, string cfid, bool *hl)
{
return normalize_header_line(Line_get(f), cfid, hl);
}
bool FileNormalEqual(string fna, string cna, string fnb, string cnb)
/* whether files 'fna' and 'fnb' are binary equal */
{ FILE* fa = OpnFile(fna,"rt");
FILE* fb = OpnFile(fnb,"rt");
string sa, sb; bool ha = True, hb = True; long lna=1,lnb=1;
bool res;
for
(
sa = Line_get_normal(fa,cna,&ha), sb = Line_get_normal(fb,cnb,&hb);
sa != NULL && sb != NULL && strcmp(sa,sb) == 0;
sa = Line_get_normal(fa,cna,&ha), sb = Line_get_normal(fb,cnb,&hb)
)
{
FreeMem(sa); FreeMem(sb); lna+=1; lnb+=1;
};
fclose(fa); fclose(fb);
res = ((sa == sb) || strcmp(sa,sb) == 0);
if (sa != NULL) FreeMem(sa);
if (sb != NULL) FreeMem(sb);
if (!res)
{
fprintf(STDERR,"files %s(%ld), %s(%ld) differ.\n",fna,lna,fnb,lnb);
errcnt += 1;
}
return res;
}
void FileNormalize(string fna, string cna, string fnb)
/* normalizes header of file 'fna' */
{ FILE* fa; FILE* fb;
string sa; bool ha = True;
if (strcmp(fna,fnb) == 0) return;
fa = OpnFile(fna,"rt");
fb = OpnFile(tnam,"wt");
for
(
sa = Line_get_normal(fa,cna,&ha);
sa != NULL;
sa = Line_get_normal(fa,cna,&ha)
)
{
fprintf(fb,"%s\n",sa);
FreeMem(sa);
};
fclose(fa); fclose(fb);
if (IsPath(fnb) && FileEqual(fnb,tnam))
remove(tnam);
else
{
remove(fnb); rename(tnam,fnb);
fprintf(STDOUT,"-> %s\n",fnb);
}
}
void editClass(symbol sclass, symbol BaseSy)
/* adds/updates current class 'sclass' */
{ HS_Set cset;
if( ! MAP_defined(clsmap,sclass) )
{
cset = HS_CREATE_ADTSET(symbol);
MAP_dfndom(clsmap,sclass,cset);
MAP_dfndom
(
newtim,
sclass,
MAP_defined(oldtim,sclass)?MAP_apply(long,oldtim,sclass):0L
);
}
else cset = MAP_apply(HS_Set,clsmap,sclass);
HS_SET_ELM(BaseSy,cset);
}
void multipleH(bool Force)
/* handles multiple Implementations */
{ MAPIT itr; symbol dom; HMP_Rng rng;
MAP_forItrAsg(dom,rng,itr,clsmap)
{ HS_Itr hit; symbol elm; long youngest = 0L; bool ok = True;
symbol hext = (symbol)NULL; symbol firstH = (symbol)NULL; string s1;
HS_FORALL(elm,hit,rng)
{ ModuleInfo mi = MAP_apply(ModuleInfo,newmap,elm);
youngest = MAX(youngest,mi->Htim);
if( hext == (symbol)NULL ) hext = mi->hext;
else
{
if( hext != mi->hext )
{
fprintf
(
STDERR,"different Header Types for Class '%s'.\n",
symbolToString(dom)
);
errcnt += 1;
}
}
if( firstH == (symbol)NULL ) firstH = (symbol)elm;
FreeMem(mi);
}
s1 = MkPath("HPATH",symbolToString(dom),symbolToString(hext),'e');
if
(
Force ||
pgmtim <= youngest ||
!IsPath(s1) ||
PathMTime(s1) != MAP_apply(long,newtim,dom)
)
{ string s3=Str_printf("%s%s",symbolToString(firstH),symbolToString(hext));
string s4=Str_printf("%s%s",symbolToString(dom),symbolToString(hext));
string s2 = MkPath
(
"HPATH",symbolToString(firstH),symbolToString(hext),'e'
);
FileNormalize(s2,s3,s1);
HS_FORALL(elm,hit,rng)
{ string s5 = MkPath
(
"HPATH",symbolToString(elm),symbolToString(hext),'e'
);
string s6 = Str_printf("%s%s",symbolToString(elm),symbolToString(hext));
ok &= FileNormalEqual(s1,s4,s5,s6);
FreeMem(s5); FreeMem(s6);
}
FreeMem(s2); FreeMem(s3); FreeMem(s4);
}
MAP_upddom(newtim,dom,ok?PathMTime(s1):-1L);
FreeMem(s1);
}
}
FILE* BeginDocFile(string Dpath, string BaseName, string Ext)
{ FILE* fp_doc = (FILE*)NULL;
if( *Dpath != '\0' )
{ string dnam, title, tmp;
title = Com_GetEx(cnam);
tmp = strstr(title,"#");
if( tmp == (string)NULL )
{
dnam = MkPath(Dpath,BaseName,".htm",'d');
fp_doc = OpnFile(dnam,"w");
if( fp_doc != (FILE*)NULL )
{
fprintf(fp_doc,"%s\n",HTML_DOCTYPE);
fprintf
(
fp_doc,
"\n\n[%s.h] %s\n\n\n",
BaseName,title
);
fprintf
(
fp_doc, "[%s.h] %s
\n",
BaseName,title
);
}
FreeMem(dnam);
}
else
{
*tmp = '\0';
if( strlen(title) == 0 )
title = BaseName;
dnam = MkPath(Dpath,title,".htm",'d');
fp_doc = OpnFile(dnam,"w");
if( fp_doc != (FILE*)NULL )
{
fprintf(fp_doc,"%s\n",HTML_DOCTYPE);
fprintf
(
fp_doc,
"\n\n[%s.h] %s\n",
title,tmp+1
);
fprintf(fp_doc,"\n");
fprintf(fp_doc,"\n");
fprintf(fp_doc,"\n");
fprintf
(
fp_doc, "[%s.h] %s
\n",
title,tmp+1
);
if( strlen(DROOT) > 0 )
fprintf
(
fp_doc,
"
\n",
DROOT
);
}
FreeMem(dnam);
}
}
return fp_doc;
}
void EndDocFile(FILE* fp_doc)
{
if( fp_doc != (FILE*)NULL )
{
fprintf(fp_doc,"\n\n\n");
fclose(fp_doc);
}
}
void htod
(
symbol HpathSy, string BaseName, string Ext, string Dpath
)
{
string Hpath = symbolToString(HpathSy), dline, t, t1;
bool header = True,
comblk = False,
pretag = False;
Sink snk = (Sink)NULL;
long lineno = 0;
cnam = MkPath(Hpath,BaseName,Ext,'d');
SysIn = OpnFile(cnam,"r");
SysDoc = BeginDocFile(Dpath,BaseName,Ext);
while ((line = Line_get(SysIn)) != (string)NULL)
{
if( header )
{
if( line[0] == '\0' ) header = False;
}
else
if( comblk )
{
dline = pretag?replaceDocBlock(line):StrCopy(line);
if( (t1=strstr(dline,"*/")) != (string)NULL )
{
t = dline;
while ( t < t1 )
{
Sink_printf(snk,"%c",*t); ++t;
}
Sink_printf(snk,"\n");
t1 = Sink_close(snk);
fprintf(SysDoc,"%s",t1);
if( pretag ) fprintf(SysDoc,"");
FreeMem(t1);
comblk = False;
}
else Sink_printf(snk,"%s\n",dline);
FreeMem(dline);
}
else
{
if( beginswith("/*!") )
{
pretag = ( beginswith("/*!!") );
dline = pretag?replaceDocBlock(line):StrCopy(line);
if( (t1=strstr(dline,"*/")) != (string)NULL )
{
fprintf(SysDoc,"");
t = dline + 3 + pretag;
while ( t < t1 )
{
fprintf(SysDoc,"%c",*t); ++t;
}
}
else
{
snk = Sink_open();
if( pretag )
Sink_printf(snk,"
%s\n",dline+4);
else
Sink_printf(snk,"%s\n",dline+3);
comblk = True;
}
FreeMem(dline);
}
else
if( beginswith("#ifndef") && strstr(line,"_INCL") != (string)NULL )
/* skip */;
else
if( beginswith("#define") && strstr(line,"_INCL") != (string)NULL )
/* skip */;
else
if( strstr(line,"/*_INCL*/") != (string)NULL ||
strstr(line,"//_INCL") != (string)NULL )
/* skip */;
else
if( beginswith("/* -") || beginswith("/* =") ||
beginswith("#include") || beginswith("AbstractType") )
{
dline = replaceDocBlock(line);
writeDocBlock(SysDoc, dline, True);
FreeMem(dline);
}
else
{
dline = replaceDocBlock(line);
fprintf(SysDoc,"
%s
",dline);
FreeMem(dline);
}
}
++lineno;
FreeMem(line);
}
EndDocFile(SysDoc);
fclose(SysIn);
FreeMem(cnam);
}
void ctoh
(
symbol CpathSy, string Hpath, string BaseName, string Ext,
bool Force, string Dpath
)
{ string Cpath = symbolToString(CpathSy); string HExt = StrCopy(Ext);
symbol BaseSy = stringToSymbol(BaseName);
long Ctime, Htime; ConcreteImp(ModuleInfo) mi;
ccls = BaseSy;
cnam = MkPath(Cpath,BaseName,Ext,'d');
HExt[1] = 'h';
hnam = MkPath(Hpath,BaseName,HExt,'d');
cfid = Str_printf("%s%s",BaseName,Ext);
lnam = StrToUpper(StrCopy(BaseName));
Ctime = PathMTime(cnam);
Htime = IsPath(hnam) ? PathMTime(hnam) : 0L;
if (validModule(CpathSy,BaseSy,Ctime,Htime) && !Force) goto Done;
SysDoc = BeginDocFile(Dpath,BaseName,Ext);
SysIn = OpnFile(cnam,"r");
SysOut = OpnFile(tnam,"w");
if( GenExp )
{
enam = MkPath(Hpath,BaseName,".exp",'d');
SysExp = OpnFile(enam,"w");
}
convertText();
if( GenExp )
{
fclose(SysExp);
FreeMem(enam);
}
fclose(SysOut);
fclose(SysIn);
EndDocFile(SysDoc);
if (mainSeen)
{
if( ccls != BaseSy )
{
fprintf(STDERR,"Program [%s.c(xx)] with multiple Headers.\n",BaseName);
errcnt += 1;
}
remove(tnam);
}
else
{
if (!Force && Htime != 0 && FileEqual(hnam,tnam)) remove(tnam);
else
{
remove(hnam); rename(tnam,hnam);
Htime = PathMTime(hnam);
fprintf(STDOUT,"-> %s%s\n",BaseName,HExt);
}
}
Done:
mi.Path = CpathSy; mi.hext = stringToSymbol(HExt); mi.scls = ccls;
mi.Ctim = Ctime; mi.Htim = Htime; mi.prog = mainSeen;
addModule(BaseSy,&mi);
if( !mainSeen ) editClass(ccls,BaseSy);
FreeMem(cnam); FreeMem(hnam); FreeMem(cfid); FreeMem(lnam); FreeMem(HExt);
}
void RemoveOldH(void)
/* removes all H-files in [$HPATH] no occuring in [ctoh.cth] */
{
DII dii; PIT pit; string srcpath;
pit = PIT_make(CTX_EVAL(string,"HPATH"));
while( ( srcpath = PIT_read(pit) ) != NULL )
{
DII_FORALL(dii,srcpath,"*.h")
{ string base = DII_get_base(dii);
if( !MAP_defined(newmap,stringToSymbol(base)) &&
!MAP_defined(clsmap,stringToSymbol(base)) )
{ string tmp = Str_printf("%s/%s.h",srcpath,base);
printf("-- %s.h\n",base);
remove(tmp); FreeMem(tmp);
}
FreeMem(base);
}
DII_FORALL(dii,srcpath,"*.hxx")
{ string base = DII_get_base(dii);
if( !MAP_defined(newmap,stringToSymbol(base)) &&
!MAP_defined(clsmap,stringToSymbol(base)) )
{ string tmp = Str_printf("%s/%s.hxx",srcpath,base);
printf("-- %s.hxx\n",base);
remove(tmp); FreeMem(tmp);
}
FreeMem(base);
}
}
PIT_drop(pit);
}
int main(int argc, string argv[])
{ DII dii; PIT pit;
string srcpath, srclib, tmp;
MAPIT itr; HMP_Dom dom; HMP_Rng rng;
CTX_init_ctoh(argc,argv);
bug0(strcmp(CTX_EVAL(string,"PRJ"),""),"Variable PRJ undefiniert");
initSymbols();
MAP_init();
pgmtim = time(NULL);
errcnt = 0;
glotyp = MAP_newTyp(primCopy,primFree,primEqual,primHash, mi_Copy,mi_Free);
clstyp = MAP_newTyp(primCopy,primFree,primEqual,primHash, primCopy,primFree);
newmap = MAP_newMap( glotyp );
oldmap = MAP_newMap( glotyp );
clsmap = MAP_newMap( clstyp );
oldtim = MAP_newMap( clstyp );
newtim = MAP_newMap( clstyp );
GetMi();
if( CTypConv ) Scn_get_ccnv(&pScn);
pit = PIT_make(CTX_EVAL(string,"CPATH"));
while( ( srcpath = PIT_read(pit) ) != NULL )
{ symbol psy;
ApiSym = stringToSymbol(GenApi);
tmp = strstr(srcpath,"~");
if( tmp != (string)NULL )
{
srclib = srcpath;
srcpath = tmp + 1;
*tmp = '\0';
ApiSym = stringToSymbol(srclib);
}
psy = stringToSymbol(srcpath);
DII_FORALL(dii,srcpath,"*.c")
{ string base = DII_get_base(dii);
ctoh
(
psy,
CTX_EVAL(string,"HPATH"),
base,
".c",
CTX_EVAL(bool ,"force"),
CTX_EVAL(string,"DPATH")
);
FreeMem(base);
}
DII_FORALL(dii,srcpath,"*.cxx")
{ string base = DII_get_base(dii);
ctoh
(
psy,
CTX_EVAL(string,"HPATH"),
base,
".cxx",
CTX_EVAL(bool ,"force"),
CTX_EVAL(string,"DPATH")
);
FreeMem(base);
}
DII_FORALL(dii,srcpath,"*.cpp")
{ string base = DII_get_base(dii);
ctoh
(
psy,
CTX_EVAL(string,"HPATH"),
base,
".cpp",
CTX_EVAL(bool ,"force"),
CTX_EVAL(string,"DPATH")
);
FreeMem(base);
}
if( *(CTX_EVAL(string,"DPATH")) != '\0' )
{
DII_FORALL(dii,srcpath,"*.h")
{ string base = DII_get_base(dii);
htod
(
psy, base, ".h", CTX_EVAL(string,"DPATH")
);
FreeMem(base);
}
}
}
PIT_drop(pit);
multipleH(CTX_EVAL(bool,"force"));
PutMi();
if( CTypConv ) Scn_free(pScn);
RemoveOldH();
MAP_freeMap(newmap);
MAP_freeMap(oldmap);
MAP_forItrAsg(dom,rng,itr,clsmap) HS_DROP_SET(rng);
MAP_freeMap(clsmap);
MAP_freeMap(oldtim);
MAP_freeMap(newtim);
MAP_freeTyp(glotyp);
MAP_freeTyp(clstyp);
MAP_quit();
freeSymbols();
CTX_quit();
if (errcnt > 0)
{
fprintf(STDERR,"total %d error(s).\n",errcnt);
STD_ERREXIT;
}
BUG_CORE;
return(0);
}
styx-2.0.1/pgm/styx.c 0000666 0001750 0001750 00000005606 10315553112 011407 0000000 0000000 /* ------------------------------------------------------------------------- */
/* */
/* [styx.c] STYX Compiler */
/* - realizes an abstract syntax tree - */
/* */
/* Copyright (c) 1993 by D\olle, Manns. */
/* ------------------------------------------------------------------------- */
#include "stdosx.h"
#include "pathes.h"
#include "styx_gen.h"
#include "styx_cim.h"
#define language CTX_EVAL(string,"Language")
#define verbose CTX_EVAL(bool,"verbose")
#define diagnose CTX_EVAL(bool,"diagnose")
#define makeIMG CTX_EVAL(bool,"makeIMG")
#define makeINT CTX_EVAL(bool,"makeINT")
#define makeANT CTX_EVAL(bool,"makeANT")
#define makeC CTX_EVAL(bool,"makeC")
#define export CTX_EVAL(bool,"export")
#define exportTMPL CTX_EVAL(string,"exportTMPL")
#define shortform CTX_EVAL(bool,"shortform")
#define conflicts CTX_EVAL(bool,"conflicts")
static void generate(Styx_T styctx)
{ PLR_Tab PTab = (PLR_Tab)NULL;
if( shortform ) STYX_set_shortform(styctx,shortform);
if( makeIMG ) STYX_createTabIMG(styctx,"BINSTYX");
if( makeC ) STYX_createTabC(styctx,"GENSTYX");
if( export ) STYX_exportTab(styctx,"BINSTYX",exportTMPL);
STYX_get_tables(styctx,&PTab,_);
if( PTab != (PLR_Tab)NULL )
{
STYX_createABS(styctx,"GENSTYX");
if( makeC || makeINT )
{
STYX_createIntC(styctx,"GENSTYX");
}
if( makeANT )
{
STYX_createAntC(styctx,"GENSTYX");
}
}
if( !makeIMG && !makeINT && !makeC && !export )
fprintf(STDERR,"Note: No file created.\n");
}
int main(int argc, string argv[])
{ StyxApp_T styapp; Styx_T styctx, rng;
MAP(symbol,Styx_T) embed = (MAP(_,_))NULL;
MAPIT itr; symbol dom; int rc;
CTX_init_styx(argc,argv);
if (verbose)
{
fprintf(STDERR,"Welcome to Styx %s as of '%s'\n",VERSION,__DATE__);
}
styapp = STYX_app_init();
if( styapp != (StyxApp_T)NULL )
{
styctx = STYX_init(styapp,language,NULL,verbose,diagnose);
if( styctx != (Styx_T)NULL )
{ c_string filename = MkPath("SPESTYX",language,".sty",'p');
STYX_set_conflict_policy(styctx,conflicts);
rc = STYX_compile_file(styctx,filename,"SPESTYX");
FreeMem(filename);
if( rc == 0 )
{
generate(styctx);
embed = STYX_get_embed(styctx);
if( embed != (MAP(_,_))NULL )
{
MAP_forItrAsg(dom,rng,itr,embed)
{
generate(rng);
}
MAP_freeMap(embed);
}
}
STYX_quit(styctx);
}
else fprintf(STDERR,"'%s' compilation init failed.\n",language);
}
else fprintf(STDERR,"Styx application init failed.\n");
STYX_app_quit(styapp);
CTX_quit();
BUG_CORE;
return 0;
}
styx-2.0.1/pgm/ctoh.cmd 0000666 0001750 0001750 00000014360 10373405111 011652 0000000 0000000 # [ctoh.cmd] command description for [ctoh.c]
Program ctoh -- C header file generation
doc
Overview
'ctoh' creates the corresponding header files for all given c source files
which represent modules, i.e. don't contain the function 'main'.
The lines below show the general structure of the generated header files:
| Header ...
| #ifndef _INCL
| #define _INCL
| Includes ...
| #ifdef __cplusplus
| extern "C" {
| #endif
| Signature ...
| #ifdef __cplusplus
| }
| #endif
| #endif
The header file will only be produced if there are differences to the previous one.
Rules
Within each c modul there may be certain groups of lines, called blocks,
which belong to the interface. If nothing else is mentioned each interface block starts
with a word and is followed either by an empty line or the curly bracket '{' at line position 0
which both marks the end of the block. In the interface copy the curly bracket '{' is replaced
by a semicolon ';'. The body within the curly brackets and the curly bracket '}' will be skipped.
Function definition block
The basic idea is that a function definition block starts with a word that
is not marked as non-function or non-interface related, i.e. the result type name.
The header definition ends with the first empty line or the curly bracket '{' at
line position 0. The latter will be replaced with a semicolon ';' in the copy for the interface.
The function body will be skipped.
Non-interface related block
Blocks whose first Line start with on of the following words don't belong to the interface
and will be skipped:
'static', 'ConcreteType', 'ConcreteImp', 'struct', 'union' und 'typedef', 'inline',
'class', 'template'
Beside that a member function definition block, recognized by the pattern 'name::name'
will be skipped.
C source file header block
The first block will allways be copied. Within this block the suffix of the file name
will be patched from '.c' to '.h'.
Include block
The first block whose lines starts with an #include-directive will be copied. In order
to copy the necessary #include-directives they must be places first in the c source file,
separated by an empty line from the rest.
Comment block
Comment lines starting with '/*I-' or '/*I=' are interface-related and thus copied. The
Character 'I' will be replaced with a space character. Further comment blocks starting with '/*!'
will be copied.
Explicit interface block ( 1 )
In order to force the copy of certain c source lines to the interface the first line of such
a block must only contain the comment '/*INTERFACE*/'. This line will be skipped and not copied.
'/*DOC_INTERFACE*/' is a second variant which in addition copies the block to the [.htm]
documentation file if the option 'DPATH' is given.
Explicit interface block ( 2 )
In addition to the previous method the following uses an explicit start and end tag to provide
more flexibility.
| /*INTERFACE_COPY_ON*/
| ...
| /*INTERFACE_COPY_OFF*/
The first and last line won't be copied.
Alternative '/*DOC_INTERFACE_COPY_ON*/' and '/*DOC_INTERFACE_COPY_OFF*/' can be used for
additional documentation purposes.
Explicit interface-only block
The following mechanismn applies to text which should be placed in the interface but is not
visible in the c source file for the c/c++ compiler. This is done via the below mentioned
conditional preprocessor directive. As a consequence the macro name 'INTERFACE' can't be
defined.
| #ifdef INTERFACE
| ...
| #endif
The first and last line won't be copied.
Documentation block
A documentation block is non-interface related and will be skipped.
Therefore the macro name
can't be defined in another context.
| #ifdef DOCUMENT
| ...
| #endif
Interface layout
Blocks where the first line starts with a letter and ends with ')'
and the second line starts with '/*' or '{' will be recognized as function
definitions and layouted in one line.
The comment line '/*INTERFACE_GROUP*/' produces an empty line.
Starting point of the Signature
Generall the signature starts after the first include-block or before
the first function definition. The comment line '/*INTERFACE_LINKAGE_ON*/
forces the creation of the opening linkage block.
cod
Arguments
Options
CPATH : path = "." -- [DLL basename~]C source directory ; ... [*.c]
HPATH : path = "." -- H target directory [*.h]
PRJ : path = "." -- directory for project image file [ctoh.cth]
force : flag = false -- force the creation of the header files
ct : flag = false -- prefix type identifier string,bool,byte,word with 'c_'
exp : flag = false -- generate ms linker export directives / modul
DPATH : path = "" -- document target directory [*.htm]
DROOT : path = "index.html" -- root document file
api : string = ""
-- DLL basename for ms DLL-based ex/import directives, applied to functions prefixed with '_DLL_EXPORT_'
doc
The options '-exp' and '-api' are not used in a linux environment.
cod
Environment
styx-2.0.1/pgm/stydoc.c 0000666 0001750 0001750 00000173301 12116733136 011712 0000000 0000000 /* ------------------------------------------------------------------------ */
/* */
/* [stydoc.c] STYX Documentation Generator */
/* */
/* Copyright (c) 1999 by D\olle, Manns, Steffen */
/* ------------------------------------------------------------------------ */
#include "stdosx.h"
#include "scn_base.h"
#include "scn_pre.h"
#include "prs.h"
#include "ptm.h"
#include "ptm_gen.h"
#include "cfg_abs.h"
#include "symbols.h"
#include "hmap.h"
#include "hset.h"
#include "sink.h"
#include "line_scn.h"
#include "pathes.h"
#include "hpat.h"
#include "styx_int.h"
#include "styx_lim.h"
#include "styx_pim.h"
#include "styd_cim.h"
/* ------------------------- Macros, Types & Globals ---------------------- */
#define infile CTX_EVAL(c_string,"InFile")
#define outfile CTX_EVAL(c_string,"OutFile")
#define styxpath CTX_EVAL(c_string,"StyxPath")
#define template CTX_EVAL(c_string,"Template")
#define refalias CTX_EVAL(c_string,"RefAlias")
#define recursiv CTX_EVAL(c_bool,"recursiv")
#define prodcom CTX_EVAL(c_bool,"prodcom")
#define nts_to_keep CTX_EVAL(c_string,"keepNTs")
#define cls_to_split CTX_EVAL(c_string,"noClass")
#define excl_prods CTX_EVAL(c_string,"exProds")
#define ign_rref CTX_EVAL(c_string,"ignRRef")
#define binpath CTX_EVAL(string,"BINSTYX")
/* STYX Documentation Pattern */
#define SD_PAT_CFGDFN stringToSymbol("cfgdfn")
#define SD_PAT_COMSEC stringToSymbol("comsec")
#define SD_PAT_TKMSEC stringToSymbol("tkmsec")
#define SD_PAT_NTMSEC stringToSymbol("ntmsec")
#define SD_PAT_PRDSEC stringToSymbol("prdsec")
#define SD_PAT_MBRSEC stringToSymbol("mbrsec")
#define SD_PAT_CFGID stringToSymbol("cfgid")
#define SD_PAT_DFNID stringToSymbol("dfnid")
#define SD_PAT_DFNREF stringToSymbol("dfnref")
#define SD_PAT_LANREF stringToSymbol("lanref")
#define SD_PAT_DFNCAT stringToSymbol("dfncat")
#define SD_PAT_DFNOPT stringToSymbol("dfnopt")
#define SD_PAT_MBRID stringToSymbol("mbrid")
#define SD_PAT_DFNCOM stringToSymbol("dfncom")
#define SD_PAT_GRPCOM stringToSymbol("grpcom")
#define SD_PAT_BOTCOM stringToSymbol("botcom")
#define SD_PAT_OPTCOM stringToSymbol("optgrpcom")
#define SD_PAT_NEWLINE stringToSymbol("nl")
ConcreteType(StyDoc_T)
{
PT_Term pTree; // STYX derivation tree of 'infile'
MAP(symbol,ROW(PT_Term)) pDfnCom; // comments of token, nonterminal
// and production definitions
MAP(symbol,ROW(PT_Term)) pGrpCom; // post definition --> group comments
PLR_Tab pTab; // language parse table
int* aPol; // nonterminal/class types
SET(int)* aNtm; // nonterminal partition
SET(int)* aPrd; // nonterminal productions
MAP(symbol,styxQlxDfn) pGMap; // group symbol |--> definition
MAP(symbol,styxQlxDfn) pTMap; // token symbol |--> definition
MAP(symbol,long) pNTMap; // nonterminal symbol |--> index
MAP(symbol,symbol) pClsMap; // nonterminal symbol |--> class symbol
SET(symbol) pLSet; // embedded languages
ROW(_) pDocBase; // language documentation base:
// ROW( T/NT symbol,
// ROW(ROW(T/NTGroup/Value symbol)) )
HPat_T pHPat; // template pattern
// generation context
FILE* pSysOut; // output fp
long lDocIdx; // 0 .. pDocBase.Count/2-1 oder -1
long lMbrIdx; // 0 .. pDocBase.pCurRow.Count-1 or -1
long lComIdx; // current start index into comment row
ROW(symbol) pCurRow; // 0 .. pDocBase.lDocIdx.Count-1 or -1
};
static SET(symbol) pNTsToKeep;
static SET(symbol) pClsToSplit;
static SET(symbol) pIgnRecRef;
static MAP(symbol,SET(symbol)) pExcludedProds;
static c_bool bConcreteCfg = C_False;
/* ------------------------- Auxiliary ------------------------------------ */
static c_string SD_com_string
(
ROW(PT_Term) pComments, long* lIdx
)
/* comment token --> string */
{ c_string szResult = (string)NULL;
long lCnt = OT_CNT(pComments), lDiff, lI = *lIdx;
Sink pSnk = Sink_open();
for( ; *lIdx < lCnt; ++(*lIdx) )
{ PT_Term t = OT_GET(PT_Term,pComments,*lIdx), p;
if( !PT_isComment(t) )
{
++(*lIdx); break;
}
else
{
if( *lIdx > lI )
{
p = OT_GET(PT_Term,pComments,(*lIdx)-1);
lDiff = PT_row(t) - PT_row(p);
if( lDiff >= 2 )
Sink_printf(pSnk,"\n\n");
else
if( lDiff == 1 )
Sink_printf(pSnk,"\n");
}
Sink_printf(pSnk,"\n%s",GLS_Tok_string(t)+1);
}
}
szResult = Sink_close(pSnk);
return szResult;
}
static long SD_getIgnNTIdx(long lPrdIdx, StyDoc_T pStyDoc)
{ long lMbrCnt, lSym, lTyp, lI;
lMbrCnt = PLR_prodSymCnt(pStyDoc->pTab,lPrdIdx);
for( lI=0; lI < lMbrCnt; ++lI )
{
lSym = PLR_prodSymbol(pStyDoc->pTab,lPrdIdx,lI);
lTyp = PLR_symType(pStyDoc->pTab,lSym);
if( CFG_NTM(lTyp) ) return lSym - PLR_tokenCnt(pStyDoc->pTab);
}
C_BUG; return -1;
}
static c_bool SD_IsLLProd(long lPrdIdx, StyDoc_T pStyDoc)
{ long lTCnt = PLR_tokenCnt(pStyDoc->pTab),
lNTIdx = PLR_prodNonTerm(pStyDoc->pTab,lPrdIdx);
return( lNTIdx == PLR_prodSymbol(pStyDoc->pTab,lPrdIdx,0) - lTCnt );
}
static c_bool SD_IsNTUnion(ROW(symbol) pNTLine)
{ long lCnt = OT_CNT(pNTLine), lI;
for( lI=0; lI < lCnt; ++lI )
{ c_string szSymbol = symbolToString(OT_GET(symbol,pNTLine,lI));
if( ! strcmp(szSymbol,"\"|\"") ) return C_True;
}
return C_False;
}
static bool SD_IsNTRecRef(long lNTIdx, StyDoc_T pStyDoc)
{ long lClsIdx = PLR_ntClassId(pStyDoc->pTab,lNTIdx),
lSym = lNTIdx + PLR_tokenCnt(pStyDoc->pTab),
lClsSym = lClsIdx + PLR_tokenCnt(pStyDoc->pTab);
c_string szSym = PLR_symName(pStyDoc->pTab,lSym),
szClsSym = PLR_symName(pStyDoc->pTab,lClsSym);
symbol pSym = stringToSymbol(szSym),
pClsSym = stringToSymbol(szClsSym);
return ACFG_HAS_NTTYP(pStyDoc->aPol[lNTIdx],ACFG_NTTYP_RECREF) &&
! HS_MBR_ELM(pSym,pIgnRecRef) &&
! HS_MBR_ELM(pClsSym,pIgnRecRef);
}
static c_bool SD_IsNTSequence(ROW(symbol) pNTLine)
{ long lCnt = OT_CNT(pNTLine);
if( lCnt > 1 )
{ c_string szSymbol = symbolToString(OT_GET(symbol,pNTLine,0));
if( ( ! strncmp(szSymbol,"\"(\"",3) ||
! strncmp(szSymbol,"\"{\"",3) ||
! strncmp(szSymbol,"\"[\"",3) ) &&
( atol(szSymbol+3) + 2 == lCnt ||
( atol(szSymbol+3) + 2 == lCnt - 1 &&
!strcmp(symbolToString(OT_GET(symbol,pNTLine,lCnt-1)),"\"+\"") ) ) )
return C_True;
else
if( lCnt == 2 &&
! strcmp(symbolToString(OT_GET(symbol,pNTLine,1)),"\"+\"") )
return C_True;
return C_False;
}
else return C_True;
}
static ROW(symbol) SD_rowToNTSeq
(
c_bool bCond, c_string szSeq,
ROW(symbol) pDstRow, ROW(symbol) pSrcRow
)
{ ROW(symbol) pResRow = pDstRow;
if( bCond )
{ c_string szSym;
if( pDstRow == pSrcRow ) pResRow = OT_CREATE_ADT(symbol);
szSym = Str_printf("\"%c\"%ld",szSeq[0],OT_CNT(pSrcRow));
OT_PUSH(stringToSymbol(szSym),pResRow);
FreeMem(szSym);
OT_APPEND(pResRow,pSrcRow);
szSym = Str_printf("\"%c\"",szSeq[1]);
OT_PUSH(stringToSymbol(szSym),pResRow);
FreeMem(szSym);
if( pDstRow == pSrcRow ) OT_DEL_T(pDstRow);
}
else
if( pDstRow != pSrcRow ) OT_APPEND(pResRow,pSrcRow);
return pResRow;
}
static ROW(symbol) SD_symbolToNTSeq
(
c_bool bCond, c_string szSeq,
ROW(symbol) pDstRow, symbol pSrcSym
)
{
if( bCond )
{ c_string szSym = Str_printf("\"%c\"1",szSeq[0]);
OT_PUSH(stringToSymbol(szSym),pDstRow);
FreeMem(szSym);
OT_PUSH(pSrcSym,pDstRow);
szSym = Str_printf("\"%c\"",szSeq[1]);
OT_PUSH(stringToSymbol(szSym),pDstRow);
FreeMem(szSym);
}
else OT_PUSH(pSrcSym,pDstRow);
return pDstRow;
}
static c_bool SD_IsNTMetaSym(symbol pNTSym, symbol* ppMetaSym)
{ c_string szNTSym = symbolToString(pNTSym),
szS = szNTSym;
if( *szS == '"' )
{ char szBuffer[STD_BUFFLEN+1];
int nI = 0;
for( szS++; *szS != '"' && *szS != '\0'; ++nI, ++szS )
szBuffer[nI] = *szS;
szBuffer[nI] = '\0';
if( ppMetaSym != (symbol*)NULL )
*ppMetaSym = stringToSymbol(szBuffer);
return C_True;
}
else return C_False;
}
static c_bool SD_IsTMetaSym(symbol pTSym)
// Meta-Symbols: ()|+{}[]<>-/, and ..
{ c_string szMetaSet = "(){}[]<>|+-/,",
szTSym = symbolToString(pTSym);
if( strlen(szTSym) == 1 )
return strstr(szMetaSet,szTSym) != (c_string)NULL;
if( strlen(szTSym) == 2 )
return !strcmp(szTSym,"..") ||
!strcmp(szTSym,">=") ||
!strcmp(szTSym,"<=") ||
!strcmp(szTSym," 0 )
{
pItr = PIT_make(cls_to_split);
while( ( szS = PIT_read(pItr) ) != NULL )
HS_SET_ELM(stringToSymbol(szS),pClsToSplit);
PIT_drop(pItr);
}
pNTsToKeep = HS_CREATE_ADTSET(symbol);
if( !bConcreteCfg && strlen(nts_to_keep) > 0 )
{
pItr = PIT_make(nts_to_keep);
while( ( szS = PIT_read(pItr) ) != NULL )
HS_SET_ELM(stringToSymbol(szS),pNTsToKeep);
PIT_drop(pItr);
}
pIgnRecRef = HS_CREATE_ADTSET(symbol);
if( !bConcreteCfg && strlen(ign_rref) > 0 )
{
pItr = PIT_make(ign_rref);
while( ( szS = PIT_read(pItr) ) != NULL )
HS_SET_ELM(stringToSymbol(szS),pIgnRecRef);
PIT_drop(pItr);
}
pExcludedProds = MAP_newPrimMap();
if( strlen(excl_prods) > 0 )
{
pItr = PIT_make(excl_prods);
while( ( szS = PIT_read(pItr) ) != NULL )
{
szT = strstr(szS,".");
if( szT != (c_string)NULL )
{ symbol pNTSym, pProdSym;
SET(symbol) pProdSet;
*szT = '\0';
pNTSym = stringToSymbol(szS);
pProdSym = stringToSymbol(szT+1);
*szT = '.';
if( MAP_defined(pExcludedProds,pNTSym) )
pProdSet = MAP_apply(SET(symbol),pExcludedProds,pNTSym);
else
{
pProdSet = HS_CREATE_ADTSET(symbol);
MAP_dfndom(pExcludedProds,pNTSym,pProdSet);
}
HS_SET_ELM(pProdSym,pProdSet);
}
}
PIT_drop(pItr);
}
}
static void SD_quit(void)
/* quit STYX documentation generation */
{ MAPIT pItr;
SET(symbol) pProdSet;
symbol pNTSym;
MAP_forItrAsg(pNTSym,pProdSet,pItr,pExcludedProds)
HS_DROP_SET(pProdSet);
MAP_freeMap(pExcludedProds);
HS_DROP_SET(pNTsToKeep);
HS_DROP_SET(pClsToSplit);
HS_DROP_SET(pIgnRecRef);
HP_quit();
styx_quitSymbols();
MAP_quit();
freeSymbols();
CTX_quit();
}
static StyDoc_T SD_init_base(void)
/* init documentation base */
{ StyDoc_T pStyDoc = New(StyDoc_T);
pStyDoc->pDfnCom = MAP_newPrimMap();
pStyDoc->pGrpCom = MAP_newPrimMap();
pStyDoc->pTree = (PT_Term)NULL;
pStyDoc->pTab = (PLR_Tab)NULL;
pStyDoc->aPol = (int*)NULL;
pStyDoc->aNtm = (SET(int)*)NULL;
pStyDoc->aPrd = (SET(int)*)NULL;
pStyDoc->pGMap = MAP_newPrimMap();
pStyDoc->pTMap = MAP_newPrimMap();
pStyDoc->pNTMap = MAP_newPrimMap();
pStyDoc->pClsMap = MAP_newPrimMap();
pStyDoc->pLSet = HS_CREATE_ADTSET(symbol);
pStyDoc->pDocBase = OT_CREATE_ADT(_);
pStyDoc->pHPat = (HPat_T)NULL;
pStyDoc->pSysOut = (FILE*)NULL;
pStyDoc->lDocIdx = -1;
pStyDoc->lComIdx = -1;
pStyDoc->lMbrIdx = -1;
pStyDoc->pCurRow = (ROW(symbol))NULL;
return pStyDoc;
}
/* ------------------------- Output Generation ---------------------------- */
static void SD_gendoc_raw(StyDoc_T pStyDoc)
/* generate raw documentation - without template */
{ long lCnt = OT_CNT(pStyDoc->pDocBase)/2, lI, lJ, lK;
fprintf(pStyDoc->pSysOut,"\n%s - CFG Section\n",PLR_language(pStyDoc->pTab));
for( lI=0; lI < lCnt; ++lI )
{ ROW(ROW(symbol)) pLines = OT_GET
(
ROW(ROW(symbol)),
pStyDoc->pDocBase,pStyDoc->lDocIdx*2+1
);
symbol pSym = OT_GET
(
symbol,pStyDoc->pDocBase,pStyDoc->lDocIdx*2
),
pMbrSym;
if( lI >= MAP_count(pStyDoc->pTMap) &&
MAP_defined(pStyDoc->pClsMap,pSym) )
pSym = MAP_apply(symbol,pStyDoc->pClsMap,pSym);
if( lI == 0 )
fprintf(pStyDoc->pSysOut,"\nToken Section\n");
else
if( lI == MAP_count(pStyDoc->pTMap) )
fprintf(pStyDoc->pSysOut,"\nNonterminal Section\n");
fprintf(pStyDoc->pSysOut,"\n");
for( lJ=0; lJ < OT_CNT(pLines); ++lJ )
{ ROW(symbol) pCurRow = OT_GET(ROW(symbol),pLines,lJ);
fprintf(pStyDoc->pSysOut,"\n\t%s ::",symbolToString(pSym));
for( lK=0; lK < OT_CNT(pCurRow); ++lK )
{
pMbrSym = OT_GET(symbol,pCurRow,lK);
if( lI >= MAP_count(pStyDoc->pTMap) &&
MAP_defined(pStyDoc->pClsMap,pMbrSym) )
pMbrSym = MAP_apply(symbol,pStyDoc->pClsMap,pMbrSym);
fprintf(pStyDoc->pSysOut," %s",symbolToString(pMbrSym));
}
}
}
}
static void SD_gendoc_txt(HPat_T pHPat, c_string szTxt)
/* generate documentation according template */
{ StyDoc_T pStyDoc = (StyDoc_T)HP_getContext(pHPat);
fprintf(pStyDoc->pSysOut,"%s",szTxt);
}
static c_bool SD_gendoc_dref(HPat_T pHPat)
/* generate definition reference according template */
{ StyDoc_T pStyDoc = (StyDoc_T)HP_getContext(pHPat);
pStyDoc->lComIdx = 0;
if( pStyDoc->lDocIdx >= 0 && pStyDoc->lDocIdx < OT_CNT(pStyDoc->pDocBase)/2 )
{ symbol pSym = OT_GET(symbol,pStyDoc->pDocBase,pStyDoc->lDocIdx*2);
if( pStyDoc->lDocIdx >= MAP_count(pStyDoc->pTMap) )
{
if( MAP_defined(pStyDoc->pClsMap,pSym) )
pSym = MAP_apply(symbol,pStyDoc->pClsMap,pSym);
}
fprintf(pStyDoc->pSysOut,"%s",symbolToString(pSym));
return C_True;
}
return C_False;
}
static c_bool SD_gendoc_did(HPat_T pHPat)
/* generate definition id according template */
{ StyDoc_T pStyDoc = (StyDoc_T)HP_getContext(pHPat);
pStyDoc->lComIdx = 0;
if( pStyDoc->lDocIdx >= 0 && pStyDoc->lDocIdx < OT_CNT(pStyDoc->pDocBase)/2 )
{ symbol pSym = OT_GET(symbol,pStyDoc->pDocBase,pStyDoc->lDocIdx*2);
if( pStyDoc->lDocIdx < MAP_count(pStyDoc->pTMap) )
{ styxQlxDfn pQDfn = MAP_apply(styxQlxDfn,pStyDoc->pTMap,pSym);
styxQlxGrp pSGrp, pDGrp; GLS_Tok pSId, pDId;
assert0( styxQlxDfn_defn(pQDfn,_,_,&pSGrp,_,&pDGrp,_), "" );
if( styxQlxGrp_non(pSGrp) && styxQlxGrp_non(pDGrp) )
fprintf(pStyDoc->pSysOut,"%s",symbolToString(pSym));
else
{ Sink pSnk = Sink_open(); c_string szID;
if( styxQlxGrp_grp(pSGrp,&pSId) )
{
Sink_printf(pSnk,"%s:",GLS_Tok_string(pSId));
}
Sink_printf(pSnk,"%s",symbolToString(pSym));
if( styxQlxGrp_grp(pDGrp,&pDId) )
{
Sink_printf(pSnk,":%s",GLS_Tok_string(pDId));
}
else
if( styxQlxGrp_igrp(pDGrp) )
{
Sink_printf(pSnk,":[initial]");
}
else
if( styxQlxGrp_pgrp(pDGrp,&pDId) )
{
Sink_printf(pSnk,":[push], %s",GLS_Tok_string(pDId));
}
else
if( styxQlxGrp_pigrp(pDGrp) )
{
Sink_printf(pSnk,":[push], [initial]");
}
else
if( styxQlxGrp_pop(pDGrp) )
{
Sink_printf(pSnk,":[pop]");
}
szID = Sink_close(pSnk);
fprintf(pStyDoc->pSysOut,"%s",szID);
FreeMem(szID);
}
}
else
{
if( MAP_defined(pStyDoc->pClsMap,pSym) )
pSym = MAP_apply(symbol,pStyDoc->pClsMap,pSym);
fprintf(pStyDoc->pSysOut,"%s",symbolToString(pSym));
}
return C_True;
}
return C_False;
}
static c_bool SD_gendoc_lref(HPat_T pHPat)
/* generate embedded language reference according template */
{ StyDoc_T pStyDoc = (StyDoc_T)HP_getContext(pHPat);
if( pStyDoc->lDocIdx >= 0 &&
pStyDoc->lDocIdx < OT_CNT(pStyDoc->pDocBase)/2 &&
pStyDoc->pCurRow != (ROW(symbol))NULL &&
pStyDoc->lMbrIdx >= 0 &&
pStyDoc->lMbrIdx < OT_CNT(pStyDoc->pCurRow) )
{ symbol pMbrSym = OT_GET(symbol,pStyDoc->pCurRow,pStyDoc->lMbrIdx);
if( strlen(outfile) > 0 )
{ MAP(symbol,symbol) pReplaceMap = MAP_newPrimMap();
c_string szPath = FilePrefix(outfile), szFile;
MAP_dfndom
(
pReplaceMap,stringToSymbol(PLR_language(pStyDoc->pTab)),pMbrSym
);
szFile = Line_replace(outfile+strlen(szPath),pReplaceMap);
fprintf(pStyDoc->pSysOut,"%s%s",szPath,szFile);
MAP_freeMap(pReplaceMap);
FreeMem(szPath); FreeMem(szFile);
}
else
fprintf(pStyDoc->pSysOut,"#%s",symbolToString(pMbrSym));
return C_True;
}
return C_False;
}
static c_bool SD_gendoc_dcom(HPat_T pHPat)
/* generate definition comment according template */
{ StyDoc_T pStyDoc = (StyDoc_T)HP_getContext(pHPat);
if( pStyDoc->lDocIdx >= 0 && pStyDoc->lDocIdx < OT_CNT(pStyDoc->pDocBase)/2 )
{ symbol pSym = OT_GET(symbol,pStyDoc->pDocBase,pStyDoc->lDocIdx*2);
if( MAP_defined(pStyDoc->pDfnCom,pSym) &&
( pStyDoc->lComIdx == 0 || prodcom ) )
{ ROW(PT_Term) pComments = MAP_apply(ROW(PT_Term),pStyDoc->pDfnCom,pSym);
string szCom = SD_com_string(pComments,&pStyDoc->lComIdx);
if( szCom && HP_fun_defined(pHPat,SD_PAT_DFNCOM) )
{ c_string szRCom = HP_fun_apply(pHPat,SD_PAT_DFNCOM,szCom);
if( szCom != szRCom )
{
FreeMem(szCom); szCom = szRCom;
}
}
HP_gendoc_pat(pHPat,SD_PAT_NEWLINE);
fprintf(pStyDoc->pSysOut,"%s",szCom);
if( szCom != (string)NULL ) FreeMem(szCom);
}
else fprintf(pStyDoc->pSysOut," ");
return C_True;
}
return C_False;
}
static c_bool SD_gendoc_ocom(HPat_T pHPat)
/* generate group comment section according template or "" */
{ StyDoc_T pStyDoc = (StyDoc_T)HP_getContext(pHPat);
pStyDoc->lComIdx = 0;
if( pStyDoc->lDocIdx >= 0 && pStyDoc->lDocIdx < OT_CNT(pStyDoc->pDocBase)/2 )
{ symbol pSym = OT_GET(symbol,pStyDoc->pDocBase,pStyDoc->lDocIdx*2);
if( MAP_defined(pStyDoc->pGrpCom,pSym) )
{
HP_gendoc_pat(pHPat,SD_PAT_COMSEC);
}
return C_True;
}
return C_False;
}
static c_bool SD_gendoc_gcom(HPat_T pHPat)
/* generate group comment according template */
{ StyDoc_T pStyDoc = (StyDoc_T)HP_getContext(pHPat);
pStyDoc->lComIdx = 0;
if( pStyDoc->lDocIdx >= 0 && pStyDoc->lDocIdx < OT_CNT(pStyDoc->pDocBase)/2 )
{ symbol pSym = OT_GET(symbol,pStyDoc->pDocBase,pStyDoc->lDocIdx*2);
if( MAP_defined(pStyDoc->pGrpCom,pSym) )
{ ROW(PT_Term) pComments = MAP_apply(ROW(PT_Term),pStyDoc->pGrpCom,pSym);
string szCom = SD_com_string(pComments,&pStyDoc->lComIdx);
if( szCom && HP_fun_defined(pHPat,SD_PAT_GRPCOM) )
{ c_string szRCom = HP_fun_apply(pHPat,SD_PAT_GRPCOM,szCom);
if( szCom != szRCom )
{
FreeMem(szCom); szCom = szRCom;
}
}
fprintf(pStyDoc->pSysOut,"%s",szCom);
if( szCom != (string)NULL ) FreeMem(szCom);
}
else fprintf(pStyDoc->pSysOut," ");
return C_True;
}
return C_False;
}
static c_bool SD_gendoc_bcom(HPat_T pHPat)
/* generate last group comment according template */
{ StyDoc_T pStyDoc = (StyDoc_T)HP_getContext(pHPat);
pStyDoc->lComIdx = 0;
if( MAP_defined(pStyDoc->pGrpCom,NULL) )
{ ROW(PT_Term) pComments = MAP_apply(ROW(PT_Term),pStyDoc->pGrpCom,NULL);
string szCom = SD_com_string(pComments,&pStyDoc->lComIdx);
if( szCom && HP_fun_defined(pHPat,SD_PAT_BOTCOM) )
{ c_string szRCom = HP_fun_apply(pHPat,SD_PAT_BOTCOM,szCom);
if( szCom != szRCom )
{
FreeMem(szCom); szCom = szRCom;
}
}
fprintf(pStyDoc->pSysOut,"%s",szCom);
if( szCom != (string)NULL ) FreeMem(szCom);
}
else fprintf(pStyDoc->pSysOut," ");
return C_True;
}
static c_bool SD_gendoc_dcat(HPat_T pHPat)
/* generate definition category according template */
{ StyDoc_T pStyDoc = (StyDoc_T)HP_getContext(pHPat);
if( pStyDoc->lDocIdx >= 0 && pStyDoc->lDocIdx < OT_CNT(pStyDoc->pDocBase)/2 )
{ symbol pSym = OT_GET(symbol,pStyDoc->pDocBase,pStyDoc->lDocIdx*2);
if( pStyDoc->lDocIdx < MAP_count(pStyDoc->pTMap) )
{ styxQlxDfn pQDfn = MAP_apply(styxQlxDfn,pStyDoc->pTMap,pSym);
styxQlxCat pQCat;
assert0( styxQlxDfn_defn(pQDfn,&pQCat,_,_,_,_,_), "" );
if( styxQlxCat_letC(pQCat) ) fprintf(pStyDoc->pSysOut,"let");
else
if( styxQlxCat_comC(pQCat) ) fprintf(pStyDoc->pSysOut,"com");
else
if( styxQlxCat_ignC(pQCat) ) fprintf(pStyDoc->pSysOut,"ign");
else
if( styxQlxCat_tokC(pQCat) ) fprintf(pStyDoc->pSysOut,"tok");
else
if( styxQlxCat_lanC(pQCat) ) fprintf(pStyDoc->pSysOut,"lan");
else
if( styxQlxCat_indC(pQCat) ) fprintf(pStyDoc->pSysOut,"ind");
}
else
{ long lNTIdx = MAP_apply(long,pStyDoc->pNTMap,pSym);
if( ACFG_HAS_NTTYP(pStyDoc->aPol[lNTIdx],ACFG_NTTYP_START) )
fprintf(pStyDoc->pSysOut,"start");
else fprintf(pStyDoc->pSysOut,"let");
}
return C_True;
}
return C_False;
}
static c_bool SD_gendoc_dopt(HPat_T pHPat)
/* generate definition option according template */
{ StyDoc_T pStyDoc = (StyDoc_T)HP_getContext(pHPat);
if( pStyDoc->lDocIdx >= 0 && pStyDoc->lDocIdx < OT_CNT(pStyDoc->pDocBase)/2 )
{ symbol pSym = OT_GET(symbol,pStyDoc->pDocBase,pStyDoc->lDocIdx*2);
if( pStyDoc->lDocIdx < MAP_count(pStyDoc->pTMap) )
{ styxQlxDfn pQDfn = MAP_apply(styxQlxDfn,pStyDoc->pTMap,pSym);
styxQlxCat pQOpt;
assert0( styxQlxDfn_defn(pQDfn,_,&pQOpt,_,_,_,_), "" );
if( styxQlxOpt_ignca(pQOpt) ) fprintf(pStyDoc->pSysOut,"[I]");
}
else
{ long lNTIdx = MAP_apply(long,pStyDoc->pNTMap,pSym);
if( PLR_isErrorNt(pStyDoc->pTab,lNTIdx) )
fprintf(pStyDoc->pSysOut,"[E]");
}
return C_True;
}
return C_False;
}
static c_bool SD_gendoc_mid(HPat_T pHPat)
/* generate member id according template */
{ StyDoc_T pStyDoc = (StyDoc_T)HP_getContext(pHPat);
if( pStyDoc->lDocIdx >= 0 &&
pStyDoc->lDocIdx < OT_CNT(pStyDoc->pDocBase)/2 &&
pStyDoc->pCurRow != (ROW(symbol))NULL &&
pStyDoc->lMbrIdx >= 0 &&
pStyDoc->lMbrIdx < OT_CNT(pStyDoc->pCurRow) )
{ symbol pMbrSym = OT_GET(symbol,pStyDoc->pCurRow,pStyDoc->lMbrIdx),
pDocSym = pMbrSym;
if( pStyDoc->lDocIdx >= MAP_count(pStyDoc->pTMap) )
{
if( ! SD_IsNTMetaSym(pMbrSym,&pDocSym) )
{
if( MAP_defined(pStyDoc->pClsMap,pDocSym) )
pDocSym = MAP_apply(symbol,pStyDoc->pClsMap,pDocSym);
}
}
if( !HP_fun_defined(pHPat,SD_PAT_MBRID) )
fprintf(pStyDoc->pSysOut,"%s",symbolToString(pDocSym));
else
{ c_string szRes = HP_fun_apply
(
pHPat,SD_PAT_MBRID,symbolToString(pDocSym)
);
fprintf(pStyDoc->pSysOut,"%s",szRes);
if( szRes != symbolToString(pDocSym) ) FreeMem(szRes);
}
return C_True;
}
return C_False;
}
static c_bool SD_gendoc_cid(HPat_T pHPat)
/* generate language id according template */
{ StyDoc_T pStyDoc = (StyDoc_T)HP_getContext(pHPat);
fprintf(pStyDoc->pSysOut,"%s",PLR_language(pStyDoc->pTab));
return C_True;
}
static c_bool SD_gendoc_dsec(HPat_T pHPat, symbol pSec)
/* generate definition section according template */
{ StyDoc_T pStyDoc = (StyDoc_T)HP_getContext(pHPat);
long lCnt = ( pSec == SD_PAT_TKMSEC )
? MAP_count(pStyDoc->pTMap)
: OT_CNT(pStyDoc->pDocBase)/2,
lBgn = ( pSec == SD_PAT_TKMSEC )
? 0 : MAP_count(pStyDoc->pTMap),
lDocIdx, lMbrIdx, lI, lJ;
ROW(symbol) pRow = HP_getListPatRow(pHPat,pSec), pCurRow;
symbol pDfn = OT_GET(symbol,pRow,0);
lDocIdx = pStyDoc->lDocIdx;
lMbrIdx = pStyDoc->lMbrIdx;
pCurRow = pStyDoc->pCurRow;
for( lI=lBgn, lJ=0; lI < lCnt; ++lI, ++lJ )
{ ROW(ROW(symbol)) pLines = OT_GET(ROW(ROW(symbol)),pStyDoc->pDocBase,2*lI+1);
if( lJ > 0 )
{
HP_gendoc_pat(pHPat,pSec);
if( OT_CNT(pRow) > lJ ) pDfn = OT_GET(symbol,pRow,lJ);
}
pStyDoc->lDocIdx = lI;
pStyDoc->lMbrIdx = -1;
pStyDoc->pCurRow = ( lI < MAP_count(pStyDoc->pTMap) )
? OT_GET(ROW(symbol),pLines,0) : (ROW(symbol))NULL;
HP_gendoc_pat(pHPat,pDfn);
}
pStyDoc->lDocIdx = lDocIdx;
pStyDoc->lMbrIdx = lMbrIdx;
pStyDoc->pCurRow = pCurRow;
return C_True;
}
static c_bool SD_gendoc_tsec(HPat_T pHPat)
/* generate token section according template */
{
return SD_gendoc_dsec(pHPat,SD_PAT_TKMSEC);
}
static c_bool SD_gendoc_nsec(HPat_T pHPat)
/* generate nonterminal section according template */
{
return SD_gendoc_dsec(pHPat,SD_PAT_NTMSEC);
}
static c_bool SD_gendoc_psec(HPat_T pHPat)
/* generate production section according template */
{ StyDoc_T pStyDoc = (StyDoc_T)HP_getContext(pHPat);
if( pStyDoc->lDocIdx >= 0 &&
pStyDoc->lDocIdx < OT_CNT(pStyDoc->pDocBase)/2 )
{ ROW(ROW(symbol)) pLines = OT_GET
(
ROW(ROW(symbol)),
pStyDoc->pDocBase,pStyDoc->lDocIdx*2+1
);
ROW(symbol) pRow = HP_getListPatRow(pHPat,SD_PAT_PRDSEC), pCurRow;
symbol pDfn = OT_GET(symbol,pRow,0);
long lCnt = OT_CNT(pLines), lI;
pCurRow = pStyDoc->pCurRow;
for( lI=0; lI < lCnt; ++lI )
{
if( lI > 0 )
{
HP_gendoc_pat(pHPat,SD_PAT_PRDSEC);
if( OT_CNT(pRow) > lI ) pDfn = OT_GET(symbol,pRow,lI);
}
pStyDoc->pCurRow = OT_GET(ROW(symbol),pLines,lI);
HP_gendoc_pat(pHPat,pDfn);
}
pStyDoc->pCurRow = pCurRow;
return C_True;
}
return C_False;
}
static c_bool SD_gendoc_msec(HPat_T pHPat)
/* generate member section according template */
{ StyDoc_T pStyDoc = (StyDoc_T)HP_getContext(pHPat);
if( pStyDoc->lDocIdx >= 0 &&
pStyDoc->lDocIdx < OT_CNT(pStyDoc->pDocBase)/2 &&
pStyDoc->pCurRow != (ROW(symbol))NULL )
{ ROW(symbol) pPRow = HP_getListPatRow(pHPat,SD_PAT_MBRSEC);
symbol pRPat = OT_GET(symbol,pPRow,0),
pMPat = OT_CNT(pPRow) >= 2 ? OT_GET(symbol,pPRow,1) : pRPat,
pVPat = OT_CNT(pPRow) >= 3 ? OT_GET(symbol,pPRow,2) : pMPat,
pLPat = OT_CNT(pPRow) >= 4 ? OT_GET(symbol,pPRow,3) : pRPat,
pMbrSym;
long lCnt = OT_CNT(pStyDoc->pCurRow), lMbrIdx, lI;
lMbrIdx = pStyDoc->lMbrIdx;
for( lI=0; lI < lCnt; ++lI )
{
if( lI > 0 ) HP_gendoc_pat(pHPat,SD_PAT_MBRSEC);
pMbrSym = OT_GET(symbol,pStyDoc->pCurRow,lI);
pStyDoc->lMbrIdx = lI;
if( HS_MBR_ELM(pMbrSym,pStyDoc->pLSet) )
{
HP_gendoc_pat(pHPat,pLPat);
}
else
if( MAP_defined(pStyDoc->pNTMap,pMbrSym) ||
MAP_defined(pStyDoc->pTMap,pMbrSym) )
{
HP_gendoc_pat(pHPat,pRPat);
}
else
if( pStyDoc->lDocIdx < MAP_count(pStyDoc->pTMap) )
{
if( SD_IsTMetaSym(pMbrSym) )
HP_gendoc_pat(pHPat,pMPat);
else HP_gendoc_pat(pHPat,pVPat);
}
else
{
if( SD_IsNTMetaSym(pMbrSym,(symbol*)NULL) ||
!strcmp(symbolToString(pMbrSym),PLR_TOK_Other) )
HP_gendoc_pat(pHPat,pMPat);
else HP_gendoc_pat(pHPat,pVPat);
}
}
pStyDoc->lMbrIdx = lMbrIdx;
return C_True;
}
return C_False;
}
static c_bool SD_gendoc_cfg(HPat_T pHPat)
/* generate documentation according template */
{
HP_gendoc_pat(pHPat,SD_PAT_CFGDFN);
return C_True;
}
/* ------------------------- Load & Unload -------------------------------- */
#define IS_QEXP_UDC(e) ( styxExp_union(e,_,_) \
|| styxExp_diff(e,_,_) \
|| styxExp_conc(e,_,_) )
static void SD_collectSubExps(styxExp e, SET(styxExp) pSubExps)
// collection of sub expression ( ... )
{ PT_Itr it;
PT_FORALL(it,e)
{ PT_Term t = PT_termIT(it), p;
if (PT_stateIT(it) == PT_PRAE)
{ styxExp exp;
if (styx_Exp(t,&exp) && ignProd(symbolToString(PT_product(exp))))
{
p = PT_parts(exp);
while( p != (PT_Term)NULL && !PT_isNonTerm(p) )
{
if( PT_isKey(p) && !strcmp(symbolToString(PT_value(p)),"(") )
{
p = PT_ign_Skip(exp);
if( p != (PT_Term)NULL ) HS_SET_ELM(p,pSubExps);
}
p = PT_next(p);
}
}
}
}
}
static void SD_evalQExp(styxExp e, ROW(symbol) l, SET(styxExp) pSubExps)
// Meta-Symbols: ()|+{}[]- and ..
{ styxExp exp1, exp2, exp3; styxLimit limit; GLS_Tok tok;
if( styxExp_quot(e,&exp1,&exp2) )
{
SD_evalQExp(exp1,l,pSubExps);
OT_PUSH(stringToSymbol("/"),l);
SD_evalQExp(exp2,l,pSubExps);
}
else
if( styxExp_dyck(e,&exp1,&exp2,&exp3) )
{
OT_PUSH(stringToSymbol("<"),l);
SD_evalQExp(exp1,l,pSubExps);
OT_PUSH(stringToSymbol(">"),l);
SD_evalQExp(exp2,l,pSubExps);
OT_PUSH(stringToSymbol("<"),l);
SD_evalQExp(exp3,l,pSubExps);
OT_PUSH(stringToSymbol(">"),l);
}
else
if( styxExp_spat(e,&exp1,&tok,&exp2) || styxExp_epat(e,&exp1,&tok,&exp2) )
{
if( styxExp_spat(e,_,_,_) )
OT_PUSH(stringToSymbol("<="),l);
else
OT_PUSH(stringToSymbol(""),l);
OT_PUSH(GLS_Tok_symbol(tok),l);
OT_PUSH(stringToSymbol("<"),l);
SD_evalQExp(exp2,l,pSubExps);
OT_PUSH(stringToSymbol(">"),l);
}
else
if( styxExp_union(e,&exp1,&exp2) )
{
if( HS_MBR_ELM(exp1,pSubExps) )
{
OT_PUSH(stringToSymbol("("),l);
SD_evalQExp(exp1,l,pSubExps);
OT_PUSH(stringToSymbol(")"),l);
}
else SD_evalQExp(exp1,l,pSubExps);
OT_PUSH(stringToSymbol("|"),l);
if( HS_MBR_ELM(exp2,pSubExps) )
{
OT_PUSH(stringToSymbol("("),l);
SD_evalQExp(exp2,l,pSubExps);
OT_PUSH(stringToSymbol(")"),l);
}
else SD_evalQExp(exp2,l,pSubExps);
}
else
if( styxExp_diff(e,&exp1,&exp2) )
{
if( HS_MBR_ELM(exp1,pSubExps) )
{
OT_PUSH(stringToSymbol("("),l);
SD_evalQExp(exp1,l,pSubExps);
OT_PUSH(stringToSymbol(")"),l);
}
else SD_evalQExp(exp1,l,pSubExps);
OT_PUSH(stringToSymbol("-"),l);
if( HS_MBR_ELM(exp2,pSubExps) )
{
OT_PUSH(stringToSymbol("("),l);
SD_evalQExp(exp2,l,pSubExps);
OT_PUSH(stringToSymbol(")"),l);
}
else SD_evalQExp(exp2,l,pSubExps);
}
else
if( styxExp_conc(e,&exp1,&exp2) )
{
if( HS_MBR_ELM(exp1,pSubExps) )
{
OT_PUSH(stringToSymbol("("),l);
SD_evalQExp(exp1,l,pSubExps);
OT_PUSH(stringToSymbol(")"),l);
}
else SD_evalQExp(exp1,l,pSubExps);
if( HS_MBR_ELM(exp2,pSubExps) )
{
OT_PUSH(stringToSymbol("("),l);
SD_evalQExp(exp2,l,pSubExps);
OT_PUSH(stringToSymbol(")"),l);
}
else SD_evalQExp(exp2,l,pSubExps);
}
else
if( styxExp_opt(e,&exp1) )
{
OT_PUSH(stringToSymbol("["),l);
SD_evalQExp(exp1,l,pSubExps);
OT_PUSH(stringToSymbol("]"),l);
}
else
if( styxExp_star(e,&exp1) || styxExp_plus0(e,&exp1) )
{
OT_PUSH(stringToSymbol("{"),l);
SD_evalQExp(exp1,l,pSubExps);
OT_PUSH(stringToSymbol("}"),l);
}
else
if( styxExp_plus(e,&exp1) || styxExp_plusn(e,&exp1,&limit) )
{
if( HS_MBR_ELM(exp1,pSubExps) )
{
OT_PUSH(stringToSymbol("("),l);
SD_evalQExp(exp1,l,pSubExps);
OT_PUSH(stringToSymbol(")"),l);
}
else SD_evalQExp(exp1,l,pSubExps);
if( styxExp_plus(e,_) )
OT_PUSH(stringToSymbol("+"),l);
else
{ styxOptNat optnat;
if( styxLimit_ntime(limit,&tok) )
OT_PUSH(GLS_Tok_symbol(tok),l);
else
if( styxLimit_range(limit,&tok,&optnat) )
{
if( styxOptNat_non(optnat) )
{
OT_PUSH(stringToSymbol(">="),l);
OT_PUSH(GLS_Tok_symbol(tok),l);
}
else
{
OT_PUSH(GLS_Tok_symbol(tok),l);
OT_PUSH(stringToSymbol(","),l);
assert( styxOptNat_nat(optnat,&tok), "");
OT_PUSH(GLS_Tok_symbol(tok),l);
}
}
}
}
else
if( styxExp_range(e,&exp1,&exp2) )
{
SD_evalQExp(exp1,l,pSubExps);
OT_PUSH(stringToSymbol(".."),l);
SD_evalQExp(exp2,l,pSubExps);
}
else
if( styxExp_set(e,&tok) )
{
OT_PUSH(GLS_Tok_symbol(tok),l);
}
else
if( styxExp_sequ(e,&tok) )
{
OT_PUSH(GLS_Tok_symbol(tok),l);
}
else
if( styxExp_ident(e,&tok) )
{
OT_PUSH(GLS_Tok_symbol(tok),l);
}
else
if( !styxExp_non(e) ) C_BUG;
}
static void SD_load_com(StyDoc_T pStyDoc)
/* load comments */
{ PT_Itr pItr; GLS_Tok pIde;
ROW(PT_Term) pComments = NULL;
ROW(PT_Term) pGrpComments = NULL;
long lRow = 0, lDRow = 0;
PT_FORALL(pItr,pStyDoc->pTree)
{ PT_Term t = PT_termIT(pItr), c;
if (PT_stateIT(pItr) == PT_PRAE)
{
if( PT_hasPos(t) )
{
lRow = PT_row(t);
if( PT_isComment(t) && strstr(GLS_Tok_string(t),";;") == NULL )
{
if( pComments == NULL )
{
if( pGrpComments == NULL )
{
pGrpComments = OT_CREATE_ADT(PT_Term);
}
OT_PUSH(t,pGrpComments);
}
else
{
if( lDRow == lRow || lDRow + 1 == lRow )
OT_PUSH(t,pComments);
else
{
if( OT_CNT(pComments) > 0 )
{
c = OT_TOP(PT_Term,pComments);
if( lRow == (long)(PT_row(c) + 1) )
OT_PUSH(t,pComments);
else
{
if( pGrpComments == NULL )
{
pGrpComments = OT_CREATE_ADT(PT_Term);
}
OT_PUSH(t,pGrpComments);
}
}
else
{
if( pGrpComments == NULL )
{
pGrpComments = OT_CREATE_ADT(PT_Term);
}
OT_PUSH(t,pGrpComments);
}
}
}
}
else
if( PT_isNonTerm(t) )
{
if( styx_QlxDfn(t,_) )
{
assert0( styxQlxDfn_defn((styxQlxDfn)t,_,_,_,&pIde,_,_)
|| styxQlxDfn_igrp((styxQlxDfn)t,&pIde)
|| styxQlxDfn_xgrp((styxQlxDfn)t,&pIde)
|| styxQlxDfn_tgrp((styxQlxDfn)t,&pIde)
|| styxQlxDfn_mgrp((styxQlxDfn)t,&pIde,_), "");
if( !MAP_defined(pStyDoc->pDfnCom,GLS_Tok_symbol(pIde)) )
{
pComments = OT_CREATE_ADT(PT_Term);
MAP_dfndom(pStyDoc->pDfnCom,GLS_Tok_symbol(pIde),pComments);
if( pGrpComments != NULL )
{
MAP_dfndom(pStyDoc->pGrpCom,GLS_Tok_symbol(pIde),pGrpComments);
pGrpComments = NULL;
}
lDRow = lRow;
}
}
else
if( styx_Dfn(t,_) )
{
styxDfn_defn((styxDfn)t,_,_,&pIde,_);
if( !MAP_defined(pStyDoc->pDfnCom,GLS_Tok_symbol(pIde)) )
{
pComments = OT_CREATE_ADT(PT_Term);
MAP_dfndom(pStyDoc->pDfnCom,GLS_Tok_symbol(pIde),pComments);
if( pGrpComments != NULL )
{
MAP_dfndom(pStyDoc->pGrpCom,GLS_Tok_symbol(pIde),pGrpComments);
pGrpComments = NULL;
}
lDRow = lRow;
}
}
else
if( styx_Prd(t,_) )
{
styxPrd_prod((styxPrd)t,_,&pIde,_);
OT_PUSH(pIde,pComments);
if( pGrpComments != NULL )
{
OT_APPEND(pComments,pGrpComments);
OT_DEL_T(pGrpComments);
pGrpComments = NULL;
}
lDRow = lRow;
}
}
}
}
}
if( pGrpComments != NULL )
MAP_dfndom(pStyDoc->pGrpCom,NULL,pGrpComments);
}
static void SD_load_lex(GLS_Lst(styxQlxDfn) pQDfns, StyDoc_T pStyDoc)
/* load documentation base for lexical analysis */
{ GLS_Lst(styxQlxDfn) pItr;
GLS_Tok pIde, pLan;
styxQlxGrp pQGrp;
styxQlxDfn pQDfn;
styxQlxCat pQCat;
styxExp pQExp;
symbol pTSym;
c_string szETok;
GLS_FORALL(pItr,pQDfns) // token map
{
pQDfn = GLS_FIRST(styxQlxDfn,pItr);
if( styxQlxDfn_defn(pQDfn,&pQCat,_,&pQGrp,&pIde,_,_) )
{
if( styxQlxCat_lanC(pQCat) )
{
assert0(styxQlxGrp_grp(pQGrp,&pLan),"");
HS_SET_ELM(GLS_Tok_symbol(pLan),pStyDoc->pLSet);
szETok = Str_printf("%s%s",GLS_Tok_string(pLan),GLS_Tok_string(pIde));
pTSym = stringToSymbol(szETok);
FreeMem(szETok);
}
else pTSym = GLS_Tok_symbol(pIde);
if( ! MAP_defined(pStyDoc->pTMap,pTSym) )
MAP_dfndom(pStyDoc->pTMap,pTSym,pQDfn);
}
else
if( styxQlxDfn_igrp(pQDfn,&pIde) || styxQlxDfn_xgrp(pQDfn,&pIde) ||
styxQlxDfn_tgrp(pQDfn,&pIde) ||
styxQlxDfn_mgrp(pQDfn,&pIde,_) )
{
if( ! MAP_defined(pStyDoc->pGMap,GLS_Tok_symbol(pIde)) )
MAP_dfndom(pStyDoc->pGMap,GLS_Tok_symbol(pIde),pQDfn);
}
}
GLS_FORALL(pItr,pQDfns) // token document base
{ ROW(ROW(symbol)) pTLines;
ROW(symbol) pTLine;
SET(styxExp) pSubExps;
pQDfn = GLS_FIRST(styxQlxDfn,pItr);
if( styxQlxDfn_defn(pQDfn,&pQCat,_,&pQGrp,&pIde,_,&pQExp) )
{
pTLines = OT_CREATE(ROW(symbol),primCopy,OT_delT,primEqual);
pTLine = OT_CREATE_ADT(symbol);
if( !styxQlxCat_lanC(pQCat) )
pTSym = GLS_Tok_symbol(pIde);
else
{
assert0(styxQlxGrp_grp(pQGrp,&pLan),"");
szETok = Str_printf("%s%s",GLS_Tok_string(pLan),GLS_Tok_string(pIde));
pTSym = stringToSymbol(szETok);
FreeMem(szETok);
}
OT_PUSH(pTSym,pStyDoc->pDocBase);
OT_PUSH(pTLines,pStyDoc->pDocBase);
OT_PUSH(pTLine,pTLines);
if( !styxQlxCat_lanC(pQCat) )
{
pSubExps = HS_CREATE_ADTSET(styxExp);
SD_collectSubExps(pQExp,pSubExps);
SD_evalQExp(pQExp,pTLine,pSubExps);
HS_DROP_SET(pSubExps);
}
else
{
OT_PUSH(GLS_Tok_symbol(pLan),pTLine);
}
}
}
}
// Meta-Symbols in Productions are enclosed with ".
/**/static long SD_load_ntgroup
(
long lNTIdx, MAP(long,ROW(ROW(symbol))) pEBNF,
StyDoc_T pStyDoc
);
static c_bool SD_splitClass(StyDoc_T pStyDoc, long lClsIdx)
/* create separate rules for each nonterminal */
{ symbol pClsSym = stringToSymbol(PLR_symName
(
pStyDoc->pTab, PLR_tokenCnt(pStyDoc->pTab) + lClsIdx
));
return HS_MBR_ELM(pClsSym,pClsToSplit);
}
static ROW(symbol) SD_load_ntprod
(
long lNTIdx, long lPrdIdx, long lDocIdx, c_bool bNTList,
MAP(long,ROW(ROW(symbol))) pEBNF, StyDoc_T pStyDoc
)
/* load documentation base for a production of nonterminal 'lNTIdx' */
{ long lMbrCnt, lSym, lSymIdx, lClsIdx, lTyp,
lSubSym, lClsSym, lSubIdx, lI, lJ;
ROW(ROW(symbol)) pNTLines = MAP_apply(ROW(ROW(symbol)),pEBNF,lDocIdx),
pMbrLines;
ROW(symbol) pNTLine = OT_CREATE_ADT(symbol), pMbrLine;
c_string szSym, szClsSym;
symbol pSym, pClsSym;
c_bool bOptNT;
lMbrCnt = PLR_prodSymCnt(pStyDoc->pTab,lPrdIdx);
for( lI=0; lI < lMbrCnt; ++lI )
{
lSym = PLR_prodSymbol(pStyDoc->pTab,lPrdIdx,lI);
lTyp = PLR_symType(pStyDoc->pTab,lSym);
if( CFG_NTM(lTyp) )
{
lSymIdx = lSym-PLR_tokenCnt(pStyDoc->pTab);
lClsIdx = PLR_ntClassId(pStyDoc->pTab,lSymIdx);
lSubIdx = SD_load_ntgroup(lSymIdx,pEBNF,pStyDoc);
lSubSym = lSubIdx + PLR_tokenCnt(pStyDoc->pTab);
lClsSym = lClsIdx + PLR_tokenCnt(pStyDoc->pTab);
szSym = PLR_symName(pStyDoc->pTab,lSubSym);
szClsSym = SD_splitClass(pStyDoc,lClsIdx)
? szSym : PLR_symName(pStyDoc->pTab,lClsSym);
pSym = stringToSymbol(szSym);
pClsSym = stringToSymbol(szClsSym);
pMbrLines = MAP_apply(ROW(ROW(symbol)),pEBNF,lSubIdx);
bOptNT = ACFG_HAS_NTTYP(pStyDoc->aPol[lSubIdx],ACFG_NTTYP_OPT) &&
! ACFG_HAS_NTTYP(pStyDoc->aPol[lSubIdx],ACFG_NTTYP_RECTYP);
if( HS_MBR_ELM(pSym,pNTsToKeep) ||
( ( MAP_defined(pStyDoc->pNTMap,pSym) ||
SD_IsNTRecRef(lSymIdx, pStyDoc) ||
! ACFG_HAS_NTTYP(pStyDoc->aPol[lClsIdx],ACFG_NTTYP_LIST) ) &&
( ACFG_HAS_NTTYP(pStyDoc->aPol[lSubIdx],ACFG_NTTYP_RECTYP) ||
( OT_CNT(pMbrLines) > 1 &&
! ( ACFG_HAS_NTTYP(pStyDoc->aPol[lSymIdx],ACFG_NTTYP_REF1) &&
ignProd(PLR_prodName(pStyDoc->pTab,lPrdIdx)) &&
lMbrCnt == 1 ) ) ) ) )
/*HM 26.1.2005
if( ( MAP_defined(pStyDoc->pNTMap,pSym) ||
HS_MBR_ELM(pSym,pNTsToKeep) ||
SD_IsNTRecRef(lSymIdx, pStyDoc) ||
! ACFG_HAS_NTTYP(pStyDoc->aPol[lClsIdx],ACFG_NTTYP_LIST) ) &&
( ACFG_HAS_NTTYP(pStyDoc->aPol[lSubIdx],ACFG_NTTYP_RECTYP) ||
( OT_CNT(pMbrLines) > 1 &&
! ( ACFG_HAS_NTTYP(pStyDoc->aPol[lSymIdx],ACFG_NTTYP_REF1) &&
ignProd(PLR_prodName(pStyDoc->pTab,lPrdIdx)) &&
lMbrCnt == 1 ) ) ) )
*/
{
if( ! MAP_defined(pStyDoc->pNTMap,pSym) )
{
if( pSym != pClsSym &&
!MAP_defined(pStyDoc->pNTMap,pClsSym) )
MAP_dfndom(pStyDoc->pClsMap,pSym,pClsSym);
MAP_dfndom(pStyDoc->pNTMap,pSym,lSubIdx);
OT_PUSH(pSym,pStyDoc->pDocBase);
OT_PUSH(pMbrLines,pStyDoc->pDocBase);
}
SD_symbolToNTSeq(bOptNT,"[]",pNTLine,pSym);
}
else
if( OT_CNT(pMbrLines) > 0 )
{
if( ! bNTList )
{
if( OT_CNT(pMbrLines) == 1 )
{
pMbrLine = OT_GET(ROW(symbol),pMbrLines,0);
if( ACFG_HAS_NTTYP(pStyDoc->aPol[lClsIdx],ACFG_NTTYP_LIST) )
SD_rowToNTSeq
(
lMbrCnt > 1 && SD_IsNTUnion(pMbrLine) &&
!SD_IsNTSequence(pMbrLine),
"()", pNTLine,pMbrLine
);
else SD_rowToNTSeq(bOptNT,"[]",pNTLine,pMbrLine);
}
else
{
assert0( pMbrLines != pNTLines,szSym );
for( lJ=0; lJ < OT_CNT(pMbrLines); ++lJ )
{
pMbrLine = OT_GET(ROW(symbol),pMbrLines,lJ);
OT_PUSH(OT_COPY(pMbrLine),pNTLines);
}
}
}
else // in this case only one line is possible !!!
if( lNTIdx != lSymIdx ) // CONSREF
{
pMbrLine = OT_GET(ROW(symbol),pMbrLines,0);
if( PLR_ntClassId(pStyDoc->pTab,lNTIdx) != lClsIdx &&
ACFG_HAS_NTTYP(pStyDoc->aPol[lClsIdx],ACFG_NTTYP_LIST) )
SD_rowToNTSeq
(
SD_IsNTUnion(pMbrLine) && !SD_IsNTSequence(pMbrLine),
"()", pNTLine,pMbrLine
);
else SD_rowToNTSeq(bOptNT,"[]",pNTLine,pMbrLine);
}
}
}
else
{
szSym = PLR_symName(pStyDoc->pTab,lSym);
OT_PUSH(stringToSymbol(szSym),pNTLine);
}
}
return pNTLine;
}
static void SD_cons_ntprod
(
long lDocIdx, MAP(long,ROW(ROW(symbol))) pEBNF, StyDoc_T pStyDoc
)
/* concat simple nonterminal/class productions */
{
ROW(ROW(symbol)) pNTLines = MAP_apply(ROW(ROW(symbol)),pEBNF,lDocIdx);
ROW(symbol) pNTLine;
long lClsIdx = PLR_ntClassId(pStyDoc->pTab,lDocIdx), lCnt, lI;
c_bool bSimple;
bSimple = ! ACFG_HAS_NTTYP(pStyDoc->aPol[lClsIdx],ACFG_NTTYP_LIST) &&
( ACFG_HAS_NTTYP(pStyDoc->aPol[lDocIdx],ACFG_NTTYP_PRIM) ||
ACFG_HAS_NTTYP(pStyDoc->aPol[lDocIdx],ACFG_NTTYP_PRIMC) );
lCnt = OT_CNT(pNTLines);
if( lCnt > 1 && bSimple )
{
pNTLine = OT_GET(ROW(symbol),pNTLines,0);
if( OT_CNT(pNTLine) > 0 )
{
for( lI=1; lI < lCnt; ++lI )
{
OT_PUSH(stringToSymbol("\"|\""),pNTLine);
OT_APPEND(pNTLine,OT_GET(ROW(symbol),pNTLines,lI));
}
OT_DEL_ES(pNTLines,1,lCnt-1);
}
}
}
static void SD_load_nt
(
long lNTIdx, c_bool bNTClass,
MAP(long,ROW(ROW(symbol))) pEBNF, StyDoc_T pStyDoc
)
/* load documentation base for a nonterminal/class */
{ long lClsIdx = PLR_ntClassId(pStyDoc->pTab,lNTIdx),
lDocIdx = bNTClass ? lClsIdx : lNTIdx,
lPrdIdx;
ROW(ROW(symbol)) pNTLines = MAP_apply(ROW(ROW(symbol)),pEBNF,lDocIdx);
ROW(symbol) pNTLine;
HS_Itr pItr;
symbol pNTSym = stringToSymbol(PLR_symName
(
pStyDoc->pTab,
PLR_tokenCnt(pStyDoc->pTab) + lNTIdx
)), pProdSym;
c_bool bExcluded;
HS_FORALL(lPrdIdx,pItr,pStyDoc->aPrd[lNTIdx])
{
pProdSym = stringToSymbol(PLR_prodName(pStyDoc->pTab,lPrdIdx));
bExcluded = MAP_defined(pExcludedProds,pNTSym) &&
HS_MBR_ELM
(
pProdSym,MAP_apply(SET(symbol),pExcludedProds,pNTSym)
);
if( ! bExcluded &&
( ! bNTClass ||
!ignProd(PLR_prodName(pStyDoc->pTab,lPrdIdx)) ||
PLR_prodSymCnt(pStyDoc->pTab,lPrdIdx) > 1 ) )
{
pNTLine = SD_load_ntprod(lNTIdx,lPrdIdx,lDocIdx,C_False,pEBNF,pStyDoc);
if( OT_CNT(pNTLine) > 0 )
OT_PUSH(pNTLine,pNTLines);
else OT_DEL_T(pNTLine);
}
}
}
static c_bool SD_add_listprod
(
long lNTIdx, long lPrdIdx,
c_bool bNTNil, ROW(symbol) pListLine,
MAP(long,ROW(ROW(symbol))) pEBNF, StyDoc_T pStyDoc
)
/* appends list production to 'pListLine' if not empty. RC = opt. list */
{ ROW(symbol) pNTLine = SD_load_ntprod
(
lNTIdx,lPrdIdx,lNTIdx,C_True,pEBNF,pStyDoc
);
c_bool bEmpty = ( OT_CNT(pNTLine) == 0 );
if( ! bEmpty )
{
bEmpty = bNTNil;
if( OT_CNT(pListLine) > 0 ) OT_PUSH(stringToSymbol("\"|\""),pListLine);
OT_APPEND(pListLine,pNTLine);
}
OT_DEL_T(pNTLine);
return bEmpty;
}
static c_bool SD_add_consprod
(
long lNTIdx, long lPrdIdx,
c_bool bNTNil, ROW(symbol)* pListLine,
MAP(long,ROW(ROW(symbol))) pEBNF, StyDoc_T pStyDoc
)
/* appends cons production to 'pListLine' if not empty. RC = opt. list */
{ ROW(symbol) pNTLine = SD_load_ntprod
(
lNTIdx,lPrdIdx,lNTIdx,C_True,pEBNF,pStyDoc
),
pTmpLine;
c_bool bEmpty = ( OT_CNT(pNTLine) == 0 );
if( ! bEmpty )
{
bEmpty = ( bNTNil && OT_CNT(*pListLine) > 0 );
pTmpLine = OT_CREATE_ADT(symbol);
SD_rowToNTSeq
(
bNTNil || !SD_IsNTSequence(pNTLine), bNTNil?"{}":"()", pTmpLine,pNTLine
);
if( ! bNTNil ) OT_PUSH(stringToSymbol("\"+\""),pTmpLine);
pTmpLine =
SD_rowToNTSeq(!bNTNil && OT_CNT(*pListLine) > 0,"[]",pTmpLine,pTmpLine);
if( SD_IsLLProd(lPrdIdx,pStyDoc) )
{
OT_APPEND(*pListLine,pTmpLine); OT_DEL_T(pTmpLine);
}
else
{
OT_APPEND(pTmpLine,*pListLine); OT_DEL_T(*pListLine);
*pListLine = pTmpLine;
}
}
OT_DEL_T(pNTLine);
return bEmpty;
}
static void SD_load_ntlist
(
long lNTIdx, MAP(long,ROW(ROW(symbol))) pEBNF, StyDoc_T pStyDoc
)
/* load documentation base for a nonterminal list */
{ long lConsIdx = -1, lMbrCnt, lPrdIdx, lIgnNTIdx;
c_bool bNTNil = ACFG_HAS_NTTYP(pStyDoc->aPol[lNTIdx],ACFG_NTTYP_NIL),
bConsRef =
ACFG_HAS_NTTYP(pStyDoc->aPol[lNTIdx],ACFG_NTTYP_CONSREF) &&
! SD_IsNTRecRef(lNTIdx, pStyDoc);
ROW(symbol) pListLine = OT_CREATE_ADT(symbol);
HS_Itr pItr;
HS_FORALL(lPrdIdx,pItr,pStyDoc->aPrd[lNTIdx])
{
lMbrCnt = PLR_prodSymCnt(pStyDoc->pTab,lPrdIdx);
if( nilProd(PLR_prodName(pStyDoc->pTab,lPrdIdx)) && lMbrCnt > 0 )
bNTNil = SD_add_listprod(lNTIdx,lPrdIdx,bNTNil,pListLine,pEBNF,pStyDoc);
else
if( ignProd(PLR_prodName(pStyDoc->pTab,lPrdIdx)) )
{
lIgnNTIdx = SD_getIgnNTIdx(lPrdIdx,pStyDoc);
if( lMbrCnt > 1 ||
( ! ACFG_HAS_NTTYP(pStyDoc->aPol[lIgnNTIdx],ACFG_NTTYP_EMPTY) &&
lIgnNTIdx != lNTIdx ) )
bNTNil = SD_add_listprod(lNTIdx,lPrdIdx,bNTNil,pListLine,pEBNF,pStyDoc);
else
bNTNil |= ACFG_HAS_NTTYP(pStyDoc->aPol[lIgnNTIdx],ACFG_NTTYP_EMPTY);
}
else
if( consProd(PLR_prodName(pStyDoc->pTab,lPrdIdx)) )
{
if( bConsRef ) lConsIdx = lPrdIdx;
else
bNTNil = SD_add_listprod(lNTIdx,lPrdIdx,bNTNil,pListLine,pEBNF,pStyDoc);
}
}
if( lConsIdx >= 0 )
bNTNil = SD_add_consprod(lNTIdx,lConsIdx,bNTNil,&pListLine,pEBNF,pStyDoc);
pListLine =
SD_rowToNTSeq(bNTNil && OT_CNT(pListLine) > 0,"[]",pListLine,pListLine);
if( OT_CNT(pListLine) > 0 )
{ ROW(ROW(symbol)) pNTLines = MAP_apply(ROW(ROW(symbol)),pEBNF,lNTIdx);
OT_PUSH(pListLine,pNTLines);
}
else OT_DEL_T(pListLine);
}
static long SD_load_ntgroup
(
long lNTIdx, MAP(long,ROW(ROW(symbol))) pEBNF, StyDoc_T pStyDoc
)
/* load documentation base for a nonterminal/class/list */
{ long lClsIdx = PLR_ntClassId(pStyDoc->pTab,lNTIdx), lDocIdx;
c_bool bNTList = ACFG_HAS_NTTYP(pStyDoc->aPol[lClsIdx],ACFG_NTTYP_LIST),
bNTClass = !bNTList &&
ACFG_HAS_NTTYP(pStyDoc->aPol[lClsIdx],ACFG_NTTYP_CLASS) &&
! SD_splitClass(pStyDoc,lClsIdx);
lDocIdx = bNTClass ? lClsIdx : lNTIdx;
if( ! MAP_defined(pEBNF,lDocIdx) )
{ ROW(ROW(symbol)) pNTLines = OT_CREATE
(
ROW(symbol),primCopy,OT_delT,primEqual
);
symbol pNTSym = stringToSymbol(PLR_symName
(
pStyDoc->pTab,
PLR_tokenCnt(pStyDoc->pTab) + lDocIdx
)),
pClsSym = SD_splitClass(pStyDoc,lClsIdx)
? pNTSym
: stringToSymbol(PLR_symName
(
pStyDoc->pTab,
PLR_tokenCnt(pStyDoc->pTab) + lClsIdx
));
HS_Itr pItr;
MAP_dfndom(pEBNF,lDocIdx,pNTLines);
if( ACFG_HAS_NTTYP(pStyDoc->aPol[lNTIdx],ACFG_NTTYP_START) &&
! MAP_defined(pStyDoc->pNTMap,pNTSym) )
{
if( pNTSym != pClsSym &&
!MAP_defined(pStyDoc->pNTMap,pClsSym) )
MAP_dfndom(pStyDoc->pClsMap,pNTSym,pClsSym);
MAP_dfndom(pStyDoc->pNTMap,pNTSym,lDocIdx);
OT_PUSH(pNTSym,pStyDoc->pDocBase);
OT_PUSH(pNTLines,pStyDoc->pDocBase);
}
if( bNTClass )
{
if( ACFG_HAS_NTTYP(pStyDoc->aPol[lClsIdx],ACFG_NTTYP_RECTYP) &&
ACFG_HAS_NTTYP(pStyDoc->aPol[lClsIdx],ACFG_NTTYP_OPT) )
OT_PUSH(OT_CREATE_ADT(symbol),pNTLines);
HS_FORALL(lNTIdx,pItr,pStyDoc->aNtm[lClsIdx])
if( HS_CARD(pStyDoc->aPrd[lNTIdx]) > 1 ||
! ACFG_HAS_NTTYP(pStyDoc->aPol[lNTIdx],ACFG_NTTYP_EMPTY) )
{
SD_load_nt(lNTIdx,bNTClass,pEBNF,pStyDoc);
}
}
else
{
if( HS_CARD(pStyDoc->aPrd[lNTIdx]) > 1 ||
! ACFG_HAS_NTTYP(pStyDoc->aPol[lNTIdx],ACFG_NTTYP_EMPTY) )
{
if( bNTList ) SD_load_ntlist(lNTIdx,pEBNF,pStyDoc);
else
{
if( ACFG_HAS_NTTYP(pStyDoc->aPol[lNTIdx],ACFG_NTTYP_RECTYP) &&
ACFG_HAS_NTTYP(pStyDoc->aPol[lNTIdx],ACFG_NTTYP_OPT) )
OT_PUSH(OT_CREATE_ADT(symbol),pNTLines);
SD_load_nt(lNTIdx,bNTClass,pEBNF,pStyDoc);
}
}
}
}
return lDocIdx;
}
static void SD_load_cfg(StyDoc_T pStyDoc)
/* load documentation base for context free grammar */
{ MAP(long,ROW(ROW(symbol))) pEBNF;
ROW(ROW(symbol)) pNTLines;
MAPIT pItr;
long lCnt = PLR_startCnt(pStyDoc->pTab),
lDocIdx, lI;
symbol pNTSym;
pEBNF = MAP_newPrimMap();
for( lI=0; lI < lCnt; ++lI )
{
lDocIdx = SD_load_ntgroup
(
PLR_startSymbol(pStyDoc->pTab,lI)-PLR_tokenCnt(pStyDoc->pTab),
pEBNF,pStyDoc
);
}
MAP_forItrAsg(pNTSym,lDocIdx,pItr,pStyDoc->pNTMap)
{
SD_cons_ntprod(lDocIdx,pEBNF,pStyDoc);
MAP_rmvdom(pEBNF,lDocIdx);
}
MAP_forItrAsg(lDocIdx,pNTLines,pItr,pEBNF)
if( pNTLines != (ROW(ROW(symbol)))NULL ) OT_DEL_T(pNTLines);
MAP_freeMap(pEBNF);
}
static void SD_load_cnt
(
long lNTIdx,
MAP(long,ROW(ROW(symbol))) pEBNF, StyDoc_T pStyDoc
)
/* load documentation base for a nonterminal */
{ long lPrdIdx, lSymCnt, lSym, lI;
ROW(ROW(symbol)) pNTLines = MAP_apply(ROW(ROW(symbol)),pEBNF,lNTIdx);
ROW(symbol) pNTLine;
HS_Itr pItr;
symbol pNTSym = stringToSymbol(PLR_symName
(
pStyDoc->pTab,
PLR_tokenCnt(pStyDoc->pTab) + lNTIdx
)), pProdSym;
c_bool bExcluded;
HS_FORALL(lPrdIdx,pItr,pStyDoc->aPrd[lNTIdx])
{
pProdSym = stringToSymbol(PLR_prodName(pStyDoc->pTab,lPrdIdx));
bExcluded = MAP_defined(pExcludedProds,pNTSym) &&
HS_MBR_ELM
(
pProdSym,MAP_apply(SET(symbol),pExcludedProds,pNTSym)
);
if( ! bExcluded )
{
pNTLine = OT_CREATE_ADT(symbol);
OT_PUSH(pNTLine,pNTLines);
lSymCnt = PLR_prodSymCnt(pStyDoc->pTab,lPrdIdx);
for( lI=0; lI < lSymCnt; ++lI )
{ c_string szSym;
lSym = PLR_prodSymbol(pStyDoc->pTab,lPrdIdx,lI);
szSym = PLR_symName(pStyDoc->pTab,lSym);
OT_PUSH(stringToSymbol(szSym),pNTLine);
}
}
}
}
static void SD_load_ccfg(StyDoc_T pStyDoc)
/* load documentation base for the concrete context free grammar */
{ MAP(long,ROW(ROW(symbol))) pEBNF;
ROW(ROW(symbol)) pNTLines;
MAPIT pItr;
long lCnt = PLR_startCnt(pStyDoc->pTab),
lDocIdx, lI;
symbol pNTSym;
pEBNF = MAP_newPrimMap();
for( lI=0; lI < lCnt; ++lI )
{
lDocIdx = PLR_startSymbol(pStyDoc->pTab,lI)-PLR_tokenCnt(pStyDoc->pTab);
pNTSym = stringToSymbol
(
PLR_symName(pStyDoc->pTab,PLR_tokenCnt(pStyDoc->pTab)+lDocIdx)
);
MAP_dfndom(pStyDoc->pNTMap,pNTSym,lDocIdx);
pNTLines = OT_CREATE(ROW(symbol),primCopy,OT_delT,primEqual);
MAP_dfndom(pEBNF,lDocIdx,pNTLines);
OT_PUSH(pNTSym,pStyDoc->pDocBase);
OT_PUSH(pNTLines,pStyDoc->pDocBase);
SD_load_cnt(lDocIdx,pEBNF,pStyDoc);
}
lCnt = PLR_nontermCnt(pStyDoc->pTab);
for( lI=0; lI < lCnt; ++lI )
{
if( !MAP_defined(pEBNF,lI) )
{
pNTSym = stringToSymbol
(
PLR_symName(pStyDoc->pTab,PLR_tokenCnt(pStyDoc->pTab)+lI)
);
MAP_dfndom(pStyDoc->pNTMap,pNTSym,lI);
pNTLines = OT_CREATE(ROW(symbol),primCopy,OT_delT,primEqual);
MAP_dfndom(pEBNF,lI,pNTLines);
OT_PUSH(pNTSym,pStyDoc->pDocBase);
OT_PUSH(pNTLines,pStyDoc->pDocBase);
SD_load_cnt(lI,pEBNF,pStyDoc);
}
}
MAP_forItrAsg(pNTSym,lDocIdx,pItr,pStyDoc->pNTMap)
{
MAP_rmvdom(pEBNF,lDocIdx);
}
MAP_forItrAsg(lDocIdx,pNTLines,pItr,pEBNF)
if( pNTLines != (ROW(ROW(symbol)))NULL ) OT_DEL_T(pNTLines);
MAP_freeMap(pEBNF);
}
static c_bool SD_load_pat(StyDoc_T pStyDoc)
/* load template */
{
if( strlen(template) > 0 )
{ Scn_Stream pStream;
pStyDoc->pHPat = HP_create();
HP_setContext(pStyDoc->pHPat,pStyDoc);
HP_setPrintFun(pStyDoc->pHPat,SD_gendoc_txt);
if( strlen(refalias) > 0 )
HP_setRefAlias(pStyDoc->pHPat,stringToSymbol(refalias));
HP_addPatSpec(pStyDoc->pHPat,SD_PAT_CFGDFN,SD_gendoc_cfg,HPAT_REF_PAT);
//HP_addPatSpec(pStyDoc->pHPat,SD_PAT_COMSEC,SD_gendoc_csec,HPAT_REF_PAT);
HP_addPatSpec(pStyDoc->pHPat,SD_PAT_TKMSEC,SD_gendoc_tsec,HPAT_REF_LIST);
HP_addPatSpec(pStyDoc->pHPat,SD_PAT_NTMSEC,SD_gendoc_nsec,HPAT_REF_LIST);
HP_addPatSpec(pStyDoc->pHPat,SD_PAT_MBRSEC,SD_gendoc_msec,HPAT_REF_LIST);
HP_addPatSpec(pStyDoc->pHPat,SD_PAT_PRDSEC,SD_gendoc_psec,HPAT_REF_LIST);
HP_addPatSpec(pStyDoc->pHPat,SD_PAT_CFGID,SD_gendoc_cid,HPAT_REF_PAR);
HP_addPatSpec(pStyDoc->pHPat,SD_PAT_DFNID,SD_gendoc_did,HPAT_REF_PAR);
HP_addPatSpec(pStyDoc->pHPat,SD_PAT_DFNREF,SD_gendoc_dref,HPAT_REF_PAR);
HP_addPatSpec(pStyDoc->pHPat,SD_PAT_LANREF,SD_gendoc_lref,HPAT_REF_PAR);
HP_addPatSpec(pStyDoc->pHPat,SD_PAT_DFNCAT,SD_gendoc_dcat,HPAT_REF_PAR);
HP_addPatSpec(pStyDoc->pHPat,SD_PAT_DFNOPT,SD_gendoc_dopt,HPAT_REF_PAR);
HP_addPatSpec(pStyDoc->pHPat,SD_PAT_MBRID,SD_gendoc_mid,HPAT_REF_PAR);
HP_addPatSpec(pStyDoc->pHPat,SD_PAT_DFNCOM,SD_gendoc_dcom,HPAT_REF_PAR);
HP_addPatSpec(pStyDoc->pHPat,SD_PAT_GRPCOM,SD_gendoc_gcom,HPAT_REF_PAR);
HP_addPatSpec(pStyDoc->pHPat,SD_PAT_BOTCOM,SD_gendoc_bcom,HPAT_REF_PAR);
HP_addPatSpec(pStyDoc->pHPat,SD_PAT_OPTCOM,SD_gendoc_ocom,HPAT_REF_PAR);
pStream = Stream_file(HP_getScanner(pStyDoc->pHPat),"",template,"");
return HP_load(pStyDoc->pHPat,pStream,NULL,SD_PAT_CFGDFN,recursiv) &&
HP_check(pStyDoc->pHPat);
}
else return C_True;
}
static c_bool SD_load(StyDoc_T* ppStyDoc)
/* load documentation base */
{ PLR_Tab pTab;
Scn_T pScn;
Scn_Stream pStream;
PT_Cfg pCfg;
StyDoc_T pStyDoc;
MAP(long,symbol) pPreParMap;
SPP_T pPP;
// init database
pStyDoc = *ppStyDoc = SD_init_base();
// parse language definition
pPreParMap = MAP_newPrimMap();
MAP_dfndom(pPreParMap,SPP_INC_PATH,stringToSymbol(styxpath));
pPP = SPP_init_reentrant(pPreParMap);
Scn_get_styx(&pScn);
pStream = Stream_file(pScn,"",infile,"");
Stream_premac_set(pStream, SPP_premac);
Stream_add_ctxval(pStream,stringToSymbol("SPP_premac"),pPP);
pTab = PLR_get_styx();
pCfg = PT_init(pTab,pStream);
pStyDoc->pTree = PT_PARSE(pCfg,"");
PT_setErrorCnt(PT_synErrorCnt(pCfg));
PT_quit(pCfg);
Stream_close(pStream);
Stream_free(pStream);
Scn_free(pScn);
PLR_delTab(pTab);
SPP_quit_reentrant(pPP);
MAP_freeMap(pPreParMap);
if( PT_errorCnt() == 0 )
{ styxSource pSrc;
GLS_Lst(styxQlxDfn) pQDfns;
GLS_Lst(styxDfn) pDfns;
styxOptCfg pOptCfg;
GLS_Tok pIde;
// fill documentation base
styx_Start_Source(pStyDoc->pTree,&pSrc);
styxSource_root(pSrc,_,&pIde,&pQDfns,&pOptCfg);
SD_load_com(pStyDoc);
SD_load_lex(pQDfns,pStyDoc);
if( styxOptCfg_cfg(pOptCfg,&pDfns,_) && ! GLS_EMPTY(pDfns) )
{
pStyDoc->pTab = PLR_getTab_env(binpath,GLS_Tok_string(pIde));
if( pStyDoc->pTab != (PLR_Tab)NULL &&
acfg_init_doc(pStyDoc->pTab,
&pStyDoc->aPol,&pStyDoc->aNtm,&pStyDoc->aPrd) )
{
if( bConcreteCfg )
SD_load_ccfg(pStyDoc);
else
SD_load_cfg(pStyDoc);
return SD_load_pat(pStyDoc);
}
}
else
return SD_load_pat(pStyDoc);
}
return C_False;
}
static void SD_unload(StyDoc_T pStyDoc)
/* unload documentation base */
{ long lCnt = OT_CNT(pStyDoc->pDocBase)/2, lDom, lI;
MAPIT pItr; ROW(PT_Term) pRng;
if( pStyDoc->pTree != (PT_Term)NULL )
PT_delT(pStyDoc->pTree);
if( pStyDoc->pTab != (PLR_Tab)NULL )
{
acfg_quit(pStyDoc->pTab,pStyDoc->aPol,pStyDoc->aNtm,pStyDoc->aPrd);
PLR_delTab(pStyDoc->pTab);
}
MAP_forItrAsg(lDom,pRng,pItr,pStyDoc->pDfnCom)
OT_DEL_T(pRng);
MAP_freeMap(pStyDoc->pDfnCom);
MAP_forItrAsg(lDom,pRng,pItr,pStyDoc->pGrpCom)
OT_DEL_T(pRng);
MAP_freeMap(pStyDoc->pGrpCom);
MAP_freeMap(pStyDoc->pGMap);
MAP_freeMap(pStyDoc->pTMap);
MAP_freeMap(pStyDoc->pNTMap);
MAP_freeMap(pStyDoc->pClsMap);
HS_DROP_SET(pStyDoc->pLSet);
for( lI=0; lI < lCnt; ++lI )
OT_DEL_T(OT_GET(ROW(_),pStyDoc->pDocBase,2*lI+1));
OT_DEL_T(pStyDoc->pDocBase);
if( pStyDoc->pHPat != (HPat_T)NULL )
HP_drop(pStyDoc->pHPat);
FreeMem(pStyDoc);
}
/* ------------------------- Main ----------------------------------------- */
int main(int argc, c_string argv[])
{ StyDoc_T pStyDoc;
SD_init(argc,argv);
if( SD_load(&pStyDoc) )
{
// generate language documentation
if( strlen(outfile) > 0 )
pStyDoc->pSysOut = OpnFile(outfile,"wt");
else
pStyDoc->pSysOut = stdout;
if( pStyDoc->pHPat != (HPat_T)NULL )
SD_gendoc_cfg(pStyDoc->pHPat);
else SD_gendoc_raw(pStyDoc);
fclose(pStyDoc->pSysOut);
}
SD_unload(pStyDoc);
SD_quit();
BUG_CORE;
return(0);
}
styx-2.0.1/pgm/pim2dot.cmd 0000666 0001750 0001750 00000001300 10373405111 012261 0000000 0000000 # [pim2dot.cmd] command description for pim2dot.c
Program pim2dot -- Parse table visualisation
doc
'pim2dot' converts a styx parse table [Language.pim] into the graph file language 'dot'.
The current version doesn't support the embedded language facility.
cod
Arguments
Img : path -- path of the parse table image [Language.pim]
Options
DiaType : string = "T" -- diagram type T=parse table (default), R=nonterminal relation, A=class relation
OutFile : path = "" -- path of the target file (default: stdout)
Template : path = "" -- path of the template file
doc
The template file can be used to specify default graph, node or edge attributes.
cod
Environment
styx-2.0.1/pgm/pgm_popt.h 0000666 0001750 0001750 00000000435 07572652761 012252 0000000 0000000 /* [pgm_popt.h] Common parse command line options */
#define start CTX_EVAL(c_string,"Start")
#define xaron CTX_EVAL(c_bool,"xaron")
#define early CTX_EVAL(c_bool,"early")
#define shiftfun CTX_EVAL(c_string,"shiftfun")
#define reducefun CTX_EVAL(c_string,"reducefun")
styx-2.0.1/pgm/pgm_popt.inc 0000666 0001750 0001750 00000000601 10161654632 012552 0000000 0000000 Start : string = "" -- start symbol
xaron : flag = false -- create a derivation tree ( lisp like representation )
early : flag = false -- use early reduction
shiftfun : string = "" -- user-defined token conversion: Function@Library ( see [ptm_gen] )
reducefun : string = "" -- user-defined nonterminal conversion: Function@Library ( see [ptm_gen] )
styx-2.0.1/pgm/pgm_arg.inc 0000666 0001750 0001750 00000000144 07572652761 012360 0000000 0000000 Language : name -- language name
FileName : path -- path of source file to scan
styx-2.0.1/pgm/ptm_img.cmd 0000666 0001750 0001750 00000001717 10373405111 012353 0000000 0000000 # [ptm_img.cmd] command description for ptm_img.c
Program ptm_img -- Term Put&Get
doc
'ptm_img' translates the given source file into a binary format and reverse.
In the reverse case it lists the derivation tree on stdout.
The source file must be conform with the language parameter. It uses the image files
of the parser and scanner tables, [Language.lim] and [Language.pim].
In case you specify a start symbol the parsing process starts from this nonterminal.
The symbol must be specified as valid start nonterminal in [Language.sty].
If the option is omitted the parser takes the first start nonterminal.
cod
Arguments
Language : name -- language name
Img : path -- path of the binary format
Options
FileName : path = "" -- path of source file to parse
#include pgm_sopt.inc
#include pgm_popt.inc
#include pgm_odoc.inc
Environment
BINSTYX : path = "PATH" -- search environment for [Language.pim] and [Language.lim]
styx-2.0.1/pgm/lim2dot.c 0000666 0001750 0001750 00000010373 10125554161 011753 0000000 0000000 /* ------------------------------------------------------------------------ */
/* */
/* [lim2dot.c] Scanner table visualisation ( lim -> dot ) */
/* */
/* Copyright (c) 2004 by D\olle, Manns */
/* ------------------------------------------------------------------------ */
#include "stdosx.h"
#include "hmap.h"
#include "pgm_base.h"
#include "scn_imp.h"
#include "gstream.h"
#include "line_scn.h"
#include "pathes.h"
#include "sink.h"
#include "lim2dot_cim.h"
#define imgfile CTX_EVAL(string,"Img")
#define tmplfile CTX_EVAL(string,"Template")
#define outfile CTX_EVAL(string,"OutFile")
static FILE* SysOut = NULL;
static void evalTemplate()
{
if( strlen(tmplfile) > 0 )
{ FILE* fp = OpnFile(tmplfile,"rb");
string line = Line_get(fp);
fprintf(SysOut,"\n");
while( line != NULL )
{
fprintf(SysOut,"%s\n",line);
FreeMem(line);
line = Line_get(fp);
}
fprintf(SysOut,"\n");
}
}
static void edgeCharacter(Sink snk, wc_char wc)
{ byte b = (byte)wc;
if( ((wc_char)b) == wc )
{
switch(b)
{
case '\r': Sink_printf(snk,"\\r"); break;
case '\n': Sink_printf(snk,"\\n"); break;
case '\t': Sink_printf(snk,"\\t"); break;
case '\\': Sink_printf(snk,"\\\\"); break;
case '"' : Sink_printf(snk,"\\\""); break;
default :
if( isprint(b) && b != ' ' )
Sink_printf(snk,"%c",b);
else Sink_printf(snk,"0x%02x",b);
}
}
else Sink_printf(snk,"0x%08lx",wc);
}
static c_string edgeLabel(MAP(wc_char,wc_char) edge)
{ Sink snk = Sink_open();
MAPIT itr; wc_char lwr, upr;
MAP_forItrAsg(lwr,upr,itr,edge)
{
if( lwr == upr )
{
Sink_printf(snk," ");
edgeCharacter(snk,lwr);
}
else
{
Sink_printf(snk," ");
edgeCharacter(snk,lwr);
Sink_printf(snk,"-");
edgeCharacter(snk,upr);
}
}
return Sink_close(snk);
}
static void scn2dot(scn_t scn)
{ long i, j, k, t;
for( i=0; i < scn->States; ++i )
{
for( k=0; k < scn->States; ++k )
{ MAP(wc_char,wc_char) edge = MAP_newPrimMap();
c_string lbl = NULL;
for( j=scn->StaEdg[i]; j < scn->StaEdg[i+1]; ++j )
{
if( k+1 == scn->EdgeS[j] ) // follow state = 0 ==> error
{ wc_char lwr = scn->EdgeC[j],
upr = j > scn->StaEdg[i] ? scn->EdgeC[j-1]-1 : lwr;
MAP_dfndom(edge,lwr,upr);
}
}
if( MAP_count(edge) > 0 )
{
lbl = edgeLabel(edge);
fprintf
(
SysOut,"\n node%ld -> node%ld [label=\"%s\"]", i,k,lbl
);
FreeMem(lbl);
}
MAP_freeMap(edge);
}
t = scn->StaFin[i];
if( t > 0 )
{
fprintf(SysOut,"\n node%ld [label=\"%s\",shape=box]",i,scn->TokId[t]);
}
else
if( i==0 )
{
fprintf(SysOut,"\n node0 [shape=box]");
}
}
}
static void lim2dot(scn_t scn)
{
fprintf(SysOut,"\ndigraph %s",scn->Name);
fprintf(SysOut,"\n{");
evalTemplate();
if( scn->Groups == 0 )
{
scn2dot(scn);
}
else
{ int i, j, g;
for( i=0; i < scn->Groups; ++i )
{
fprintf(SysOut,"\n subgraph %s",scn->GrpScn[i]->Name);
fprintf(SysOut,"\n {");
scn2dot(scn->GrpScn[i]);
fprintf(SysOut,"\n }\n");
}
for( i=0; i < scn->Groups; ++i )
{
for( j=0; i < scn->GrpScn[i]->Tokens; ++j )
{
g = scn->GrpScn[i]->Switch[j];
if( g >= 0 )
{
fprintf
(
SysOut,"\n %s -> %s [label=\"%s\"]",
scn->GrpScn[i]->Name,
scn->GrpScn[g]->Name,
scn->GrpScn[i]->TokId[j]
);
}
}
}
fprintf(SysOut,"\n %s [shape=box]",scn->Name);
}
fprintf(SysOut,"\n}\n");
}
int main(int argc, string argv[])
{ Scn_T scn;
/* init module */
PGM_init(argc,argv,CTX_init_lim2dot);
/* get the scanner */
Scn_get_file(imgfile,&scn);
/* produce the dot file */
if( strlen(outfile) > 0 )
SysOut = OpnFile(outfile,"wt");
else SysOut = stdout;
lim2dot(Scn_IMP(scn));
/* free the scanner */
Scn_free(scn);
/* quit module */
PGM_quit();
BUG_CORE;
return(0);
}
styx-2.0.1/pgm/pgm_sopt.h 0000666 0001750 0001750 00000000506 07572652761 012254 0000000 0000000 /* [pgm_sopt.h] Common scan command line options */
#define prepar CTX_EVAL(c_string,"prepar")
#define premac CTX_EVAL(c_string,"premac")
#define prefun CTX_EVAL(c_string,"prefun")
#define cset CTX_EVAL(c_string,"charset")
#define skipset CTX_EVAL(c_string,"skipset")
#define wprint CTX_EVAL(c_bool,"wprint")
styx-2.0.1/pgm/lim_test.c 0000666 0001750 0001750 00000003007 10154060157 012214 0000000 0000000 /* ------------------------------------------------------------------------ */
/* */
/* [lim_test.c] Scanner Test */
/* */
/* Copyright (c) 1993 by D\olle, Manns */
/* ------------------------------------------------------------------------ */
#include "stdosx.h"
#include "pgm_base.h"
#include "pgm_sopt.h"
#include "lim__cim.h"
#define filename CTX_EVAL(string,"FileName")
#define binmode CTX_EVAL(bool,"binmode")
#define binpath CTX_EVAL(string,"BINSTYX")
int main(int argc, string argv[])
{ Scn_Stream stream; Scn_T scn;
/* init module */
PGM_init(argc,argv,CTX_init_lim_test);
/* init preprocessing */
PGM_initPreprocessing(prepar,premac,cset);
/* get the scanner */
Scn_get_env(binpath,CTX_EVAL(string,"Language"),&scn);
/* create & init scan stream */
stream = PGM_initScanStream
(
scn,filename,prepar,prefun,binmode,cset,
skipset,CTX_EVAL(bool,"lookahead"),True
);
/* actual scanning & printing */
PGM_scan(stream,CTX_EVAL(bool,"tokens"),cset,wprint);
/* quit scan stream */
PGM_quitScanStream(stream);
Scn_free(scn);
/* quit preprocessing */
PGM_quitPreprocessing(prepar);
/* print symbols */
if (CTX_EVAL(bool,"symbols")) { NL; printSymbols(0); NL; }
/* quit module */
PGM_quit();
BUG_CORE;
return(0);
}
styx-2.0.1/pgm/Makefile.am 0000664 0001750 0001750 00000001106 10125536257 012267 0000000 0000000 ## Process this file with automake to create pgm/Makefile.in
vpath %.h $(top_srcdir)/modstd $(top_srcdir)/libutil $(top_srcdir)/libbase $(top_srcdir)/pgm $(top_srcdir)/modext $(top_srcdir)/inc
INCLUDES = -I$(top_srcdir)/modstd -I$(top_srcdir)/libutil -I$(top_srcdir)/libbase -I$(top_srcdir)/pgm -I$(top_srcdir)/modext -I$(top_srcdir)/inc
include_HEADERS = pgm_popt.h pgm_sopt.h
noinst_LIBRARIES = libpgm.a
libpgm_a_SOURCES = ctoh.c lim_test.c styx.c pim_test.c stypp.c stydoc.c ptm_img.c lim2dot.c pim2dot.c
EXTRA_DIST = $(wildcard $(srcdir)/*.cmd) $(wildcard $(srcdir)/*.inc)
styx-2.0.1/pgm/Makefile.in 0000644 0001750 0001750 00000043364 12116751125 012305 0000000 0000000 # Makefile.in generated by automake 1.11.6 from Makefile.am.
# @configure_input@
# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
# Foundation, Inc.
# This Makefile.in is free software; the Free Software Foundation
# gives unlimited permission to copy and/or distribute it,
# with or without modifications, as long as this notice is preserved.
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
# PARTICULAR PURPOSE.
@SET_MAKE@
VPATH = @srcdir@
am__make_dryrun = \
{ \
am__dry=no; \
case $$MAKEFLAGS in \
*\\[\ \ ]*) \
echo 'am--echo: ; @echo "AM" OK' | $(MAKE) -f - 2>/dev/null \
| grep '^AM OK$$' >/dev/null || am__dry=yes;; \
*) \
for am__flg in $$MAKEFLAGS; do \
case $$am__flg in \
*=*|--*) ;; \
*n*) am__dry=yes; break;; \
esac; \
done;; \
esac; \
test $$am__dry = yes; \
}
pkgdatadir = $(datadir)/@PACKAGE@
pkgincludedir = $(includedir)/@PACKAGE@
pkglibdir = $(libdir)/@PACKAGE@
pkglibexecdir = $(libexecdir)/@PACKAGE@
am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd
install_sh_DATA = $(install_sh) -c -m 644
install_sh_PROGRAM = $(install_sh) -c
install_sh_SCRIPT = $(install_sh) -c
INSTALL_HEADER = $(INSTALL_DATA)
transform = $(program_transform_name)
NORMAL_INSTALL = :
PRE_INSTALL = :
POST_INSTALL = :
NORMAL_UNINSTALL = :
PRE_UNINSTALL = :
POST_UNINSTALL = :
build_triplet = @build@
host_triplet = @host@
subdir = pgm
DIST_COMMON = $(include_HEADERS) $(srcdir)/Makefile.am \
$(srcdir)/Makefile.in
ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
am__aclocal_m4_deps = $(top_srcdir)/configure.in
am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
$(ACLOCAL_M4)
mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs
CONFIG_HEADER = $(top_builddir)/config.h
CONFIG_CLEAN_FILES =
CONFIG_CLEAN_VPATH_FILES =
LIBRARIES = $(noinst_LIBRARIES)
ARFLAGS = cru
libpgm_a_AR = $(AR) $(ARFLAGS)
libpgm_a_LIBADD =
am_libpgm_a_OBJECTS = ctoh.$(OBJEXT) lim_test.$(OBJEXT) styx.$(OBJEXT) \
pim_test.$(OBJEXT) stypp.$(OBJEXT) stydoc.$(OBJEXT) \
ptm_img.$(OBJEXT) lim2dot.$(OBJEXT) pim2dot.$(OBJEXT)
libpgm_a_OBJECTS = $(am_libpgm_a_OBJECTS)
DEFAULT_INCLUDES = -I.@am__isrc@ -I$(top_builddir)
depcomp = $(SHELL) $(top_srcdir)/depcomp
am__depfiles_maybe = depfiles
am__mv = mv -f
COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \
$(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
LTCOMPILE = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \
--mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \
$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
CCLD = $(CC)
LINK = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \
--mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) $(AM_LDFLAGS) \
$(LDFLAGS) -o $@
SOURCES = $(libpgm_a_SOURCES)
DIST_SOURCES = $(libpgm_a_SOURCES)
am__can_run_installinfo = \
case $$AM_UPDATE_INFO_DIR in \
n|no|NO) false;; \
*) (install-info --version) >/dev/null 2>&1;; \
esac
am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`;
am__vpath_adj = case $$p in \
$(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \
*) f=$$p;; \
esac;
am__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;
am__install_max = 40
am__nobase_strip_setup = \
srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*|]/\\\\&/g'`
am__nobase_strip = \
for p in $$list; do echo "$$p"; done | sed -e "s|$$srcdirstrip/||"
am__nobase_list = $(am__nobase_strip_setup); \
for p in $$list; do echo "$$p $$p"; done | \
sed "s| $$srcdirstrip/| |;"' / .*\//!s/ .*/ ./; s,\( .*\)/[^/]*$$,\1,' | \
$(AWK) 'BEGIN { files["."] = "" } { files[$$2] = files[$$2] " " $$1; \
if (++n[$$2] == $(am__install_max)) \
{ print $$2, files[$$2]; n[$$2] = 0; files[$$2] = "" } } \
END { for (dir in files) print dir, files[dir] }'
am__base_list = \
sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \
sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g'
am__uninstall_files_from_dir = { \
test -z "$$files" \
|| { test ! -d "$$dir" && test ! -f "$$dir" && test ! -r "$$dir"; } \
|| { echo " ( cd '$$dir' && rm -f" $$files ")"; \
$(am__cd) "$$dir" && rm -f $$files; }; \
}
am__installdirs = "$(DESTDIR)$(includedir)"
HEADERS = $(include_HEADERS)
ETAGS = etags
CTAGS = ctags
DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
ACLOCAL = @ACLOCAL@
AMTAR = @AMTAR@
AR = @AR@
AUTOCONF = @AUTOCONF@
AUTOHEADER = @AUTOHEADER@
AUTOMAKE = @AUTOMAKE@
AWK = @AWK@
CC = @CC@
CCDEPMODE = @CCDEPMODE@
CFLAGS = @CFLAGS@
CPP = @CPP@
CPPFLAGS = @CPPFLAGS@
CXX = @CXX@
CXXCPP = @CXXCPP@
CXXDEPMODE = @CXXDEPMODE@
CXXFLAGS = @CXXFLAGS@
CYGPATH_W = @CYGPATH_W@
DEFS = @DEFS@
DEPDIR = @DEPDIR@
DLLTOOL = @DLLTOOL@
DSYMUTIL = @DSYMUTIL@
DUMPBIN = @DUMPBIN@
ECHO_C = @ECHO_C@
ECHO_N = @ECHO_N@
ECHO_T = @ECHO_T@
EGREP = @EGREP@
EXEEXT = @EXEEXT@
FGREP = @FGREP@
GREP = @GREP@
INSTALL = @INSTALL@
INSTALL_DATA = @INSTALL_DATA@
INSTALL_PROGRAM = @INSTALL_PROGRAM@
INSTALL_SCRIPT = @INSTALL_SCRIPT@
INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
LD = @LD@
LDFLAGS = @LDFLAGS@
LIBOBJS = @LIBOBJS@
LIBS = @LIBS@
LIBTOOL = @LIBTOOL@
LIPO = @LIPO@
LN_S = @LN_S@
LTLIBOBJS = @LTLIBOBJS@
MAKEINFO = @MAKEINFO@
MANIFEST_TOOL = @MANIFEST_TOOL@
MKDIR_P = @MKDIR_P@
NM = @NM@
NMEDIT = @NMEDIT@
OBJDUMP = @OBJDUMP@
OBJEXT = @OBJEXT@
OTOOL = @OTOOL@
OTOOL64 = @OTOOL64@
PACKAGE = @PACKAGE@
PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
PACKAGE_NAME = @PACKAGE_NAME@
PACKAGE_STRING = @PACKAGE_STRING@
PACKAGE_TARNAME = @PACKAGE_TARNAME@
PACKAGE_URL = @PACKAGE_URL@
PACKAGE_VERSION = @PACKAGE_VERSION@
PATH_SEPARATOR = @PATH_SEPARATOR@
RANLIB = @RANLIB@
SED = @SED@
SET_MAKE = @SET_MAKE@
SHELL = @SHELL@
STRIP = @STRIP@
VERSION = @VERSION@
abs_builddir = @abs_builddir@
abs_srcdir = @abs_srcdir@
abs_top_builddir = @abs_top_builddir@
abs_top_srcdir = @abs_top_srcdir@
ac_ct_AR = @ac_ct_AR@
ac_ct_CC = @ac_ct_CC@
ac_ct_CXX = @ac_ct_CXX@
ac_ct_DUMPBIN = @ac_ct_DUMPBIN@
am__include = @am__include@
am__leading_dot = @am__leading_dot@
am__quote = @am__quote@
am__tar = @am__tar@
am__untar = @am__untar@
bindir = @bindir@
build = @build@
build_alias = @build_alias@
build_cpu = @build_cpu@
build_os = @build_os@
build_vendor = @build_vendor@
builddir = @builddir@
datadir = @datadir@
datarootdir = @datarootdir@
docdir = @docdir@
dvidir = @dvidir@
exec_prefix = @exec_prefix@
host = @host@
host_alias = @host_alias@
host_cpu = @host_cpu@
host_os = @host_os@
host_vendor = @host_vendor@
htmldir = @htmldir@
includedir = @includedir@
infodir = @infodir@
install_sh = @install_sh@
libdir = @libdir@
libexecdir = @libexecdir@
localedir = @localedir@
localstatedir = @localstatedir@
mandir = @mandir@
mkdir_p = @mkdir_p@
oldincludedir = @oldincludedir@
pdfdir = @pdfdir@
prefix = @prefix@
program_transform_name = @program_transform_name@
psdir = @psdir@
sampledir = @sampledir@
sbindir = @sbindir@
sgmldir = @sgmldir@
sharedstatedir = @sharedstatedir@
srcdir = @srcdir@
sysconfdir = @sysconfdir@
target_alias = @target_alias@
top_build_prefix = @top_build_prefix@
top_builddir = @top_builddir@
top_srcdir = @top_srcdir@
INCLUDES = -I$(top_srcdir)/modstd -I$(top_srcdir)/libutil -I$(top_srcdir)/libbase -I$(top_srcdir)/pgm -I$(top_srcdir)/modext -I$(top_srcdir)/inc
include_HEADERS = pgm_popt.h pgm_sopt.h
noinst_LIBRARIES = libpgm.a
libpgm_a_SOURCES = ctoh.c lim_test.c styx.c pim_test.c stypp.c stydoc.c ptm_img.c lim2dot.c pim2dot.c
EXTRA_DIST = $(wildcard $(srcdir)/*.cmd) $(wildcard $(srcdir)/*.inc)
all: all-am
.SUFFIXES:
.SUFFIXES: .c .lo .o .obj
$(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps)
@for dep in $?; do \
case '$(am__configure_deps)' in \
*$$dep*) \
( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \
&& { if test -f $@; then exit 0; else break; fi; }; \
exit 1;; \
esac; \
done; \
echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign pgm/Makefile'; \
$(am__cd) $(top_srcdir) && \
$(AUTOMAKE) --foreign pgm/Makefile
.PRECIOUS: Makefile
Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status
@case '$?' in \
*config.status*) \
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \
*) \
echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \
cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \
esac;
$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
$(top_srcdir)/configure: $(am__configure_deps)
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
$(ACLOCAL_M4): $(am__aclocal_m4_deps)
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
$(am__aclocal_m4_deps):
clean-noinstLIBRARIES:
-test -z "$(noinst_LIBRARIES)" || rm -f $(noinst_LIBRARIES)
libpgm.a: $(libpgm_a_OBJECTS) $(libpgm_a_DEPENDENCIES) $(EXTRA_libpgm_a_DEPENDENCIES)
-rm -f libpgm.a
$(libpgm_a_AR) libpgm.a $(libpgm_a_OBJECTS) $(libpgm_a_LIBADD)
$(RANLIB) libpgm.a
mostlyclean-compile:
-rm -f *.$(OBJEXT)
distclean-compile:
-rm -f *.tab.c
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/ctoh.Po@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/lim2dot.Po@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/lim_test.Po@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/pim2dot.Po@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/pim_test.Po@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/ptm_img.Po@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/stydoc.Po@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/stypp.Po@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/styx.Po@am__quote@
.c.o:
@am__fastdepCC_TRUE@ $(COMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ $<
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
@am__fastdepCC_FALSE@ $(COMPILE) -c $<
.c.obj:
@am__fastdepCC_TRUE@ $(COMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ `$(CYGPATH_W) '$<'`
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
@am__fastdepCC_FALSE@ $(COMPILE) -c `$(CYGPATH_W) '$<'`
.c.lo:
@am__fastdepCC_TRUE@ $(LTCOMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ $<
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Plo
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
@am__fastdepCC_FALSE@ $(LTCOMPILE) -c -o $@ $<
mostlyclean-libtool:
-rm -f *.lo
clean-libtool:
-rm -rf .libs _libs
install-includeHEADERS: $(include_HEADERS)
@$(NORMAL_INSTALL)
@list='$(include_HEADERS)'; test -n "$(includedir)" || list=; \
if test -n "$$list"; then \
echo " $(MKDIR_P) '$(DESTDIR)$(includedir)'"; \
$(MKDIR_P) "$(DESTDIR)$(includedir)" || exit 1; \
fi; \
for p in $$list; do \
if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
echo "$$d$$p"; \
done | $(am__base_list) | \
while read files; do \
echo " $(INSTALL_HEADER) $$files '$(DESTDIR)$(includedir)'"; \
$(INSTALL_HEADER) $$files "$(DESTDIR)$(includedir)" || exit $$?; \
done
uninstall-includeHEADERS:
@$(NORMAL_UNINSTALL)
@list='$(include_HEADERS)'; test -n "$(includedir)" || list=; \
files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \
dir='$(DESTDIR)$(includedir)'; $(am__uninstall_files_from_dir)
ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
unique=`for i in $$list; do \
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
done | \
$(AWK) '{ files[$$0] = 1; nonempty = 1; } \
END { if (nonempty) { for (i in files) print i; }; }'`; \
mkid -fID $$unique
tags: TAGS
TAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \
$(TAGS_FILES) $(LISP)
set x; \
here=`pwd`; \
list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
unique=`for i in $$list; do \
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
done | \
$(AWK) '{ files[$$0] = 1; nonempty = 1; } \
END { if (nonempty) { for (i in files) print i; }; }'`; \
shift; \
if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \
test -n "$$unique" || unique=$$empty_fix; \
if test $$# -gt 0; then \
$(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
"$$@" $$unique; \
else \
$(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
$$unique; \
fi; \
fi
ctags: CTAGS
CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \
$(TAGS_FILES) $(LISP)
list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
unique=`for i in $$list; do \
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
done | \
$(AWK) '{ files[$$0] = 1; nonempty = 1; } \
END { if (nonempty) { for (i in files) print i; }; }'`; \
test -z "$(CTAGS_ARGS)$$unique" \
|| $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \
$$unique
GTAGS:
here=`$(am__cd) $(top_builddir) && pwd` \
&& $(am__cd) $(top_srcdir) \
&& gtags -i $(GTAGS_ARGS) "$$here"
distclean-tags:
-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
distdir: $(DISTFILES)
@srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
list='$(DISTFILES)'; \
dist_files=`for file in $$list; do echo $$file; done | \
sed -e "s|^$$srcdirstrip/||;t" \
-e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \
case $$dist_files in \
*/*) $(MKDIR_P) `echo "$$dist_files" | \
sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \
sort -u` ;; \
esac; \
for file in $$dist_files; do \
if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \
if test -d $$d/$$file; then \
dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \
if test -d "$(distdir)/$$file"; then \
find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
fi; \
if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \
cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \
find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
fi; \
cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \
else \
test -f "$(distdir)/$$file" \
|| cp -p $$d/$$file "$(distdir)/$$file" \
|| exit 1; \
fi; \
done
check-am: all-am
check: check-am
all-am: Makefile $(LIBRARIES) $(HEADERS)
installdirs:
for dir in "$(DESTDIR)$(includedir)"; do \
test -z "$$dir" || $(MKDIR_P) "$$dir"; \
done
install: install-am
install-exec: install-exec-am
install-data: install-data-am
uninstall: uninstall-am
install-am: all-am
@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
installcheck: installcheck-am
install-strip:
if test -z '$(STRIP)'; then \
$(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
install; \
else \
$(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \
fi
mostlyclean-generic:
clean-generic:
distclean-generic:
-test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES)
-test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES)
maintainer-clean-generic:
@echo "This command is intended for maintainers to use"
@echo "it deletes files that may require special tools to rebuild."
clean: clean-am
clean-am: clean-generic clean-libtool clean-noinstLIBRARIES \
mostlyclean-am
distclean: distclean-am
-rm -rf ./$(DEPDIR)
-rm -f Makefile
distclean-am: clean-am distclean-compile distclean-generic \
distclean-tags
dvi: dvi-am
dvi-am:
html: html-am
html-am:
info: info-am
info-am:
install-data-am: install-includeHEADERS
install-dvi: install-dvi-am
install-dvi-am:
install-exec-am:
install-html: install-html-am
install-html-am:
install-info: install-info-am
install-info-am:
install-man:
install-pdf: install-pdf-am
install-pdf-am:
install-ps: install-ps-am
install-ps-am:
installcheck-am:
maintainer-clean: maintainer-clean-am
-rm -rf ./$(DEPDIR)
-rm -f Makefile
maintainer-clean-am: distclean-am maintainer-clean-generic
mostlyclean: mostlyclean-am
mostlyclean-am: mostlyclean-compile mostlyclean-generic \
mostlyclean-libtool
pdf: pdf-am
pdf-am:
ps: ps-am
ps-am:
uninstall-am: uninstall-includeHEADERS
.MAKE: install-am install-strip
.PHONY: CTAGS GTAGS all all-am check check-am clean clean-generic \
clean-libtool clean-noinstLIBRARIES ctags distclean \
distclean-compile distclean-generic distclean-libtool \
distclean-tags distdir dvi dvi-am html html-am info info-am \
install install-am install-data install-data-am install-dvi \
install-dvi-am install-exec install-exec-am install-html \
install-html-am install-includeHEADERS install-info \
install-info-am install-man install-pdf install-pdf-am \
install-ps install-ps-am install-strip installcheck \
installcheck-am installdirs maintainer-clean \
maintainer-clean-generic mostlyclean mostlyclean-compile \
mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \
tags uninstall uninstall-am uninstall-includeHEADERS
vpath %.h $(top_srcdir)/modstd $(top_srcdir)/libutil $(top_srcdir)/libbase $(top_srcdir)/pgm $(top_srcdir)/modext $(top_srcdir)/inc
# Tell versions [3.59,3.63) of GNU make to not export all variables.
# Otherwise a system limit (for SysV at least) may be exceeded.
.NOEXPORT:
styx-2.0.1/pgm/stypp.cmd 0000666 0001750 0001750 00000002075 10373405111 012074 0000000 0000000 # [stypp.cmd] command description for stypp.c
Program stypp -- Pretty Printer
doc
'stypp' serves as a pretty printer for source files written in a styx-conform language.
Beside that it can be used to port source files, provided that the abstract syntax of the
source and target language are equivalent. The conversion includes all comments. A user-defined
token conversion handler can be applied.
The work on this program, especially on the pretty printer layout, ist still in progress.
The current version doesn't support the embedded language facility.
cod
Arguments
srclang : name -- source language name
dstlang : name -- target language name
filename : path -- path of source file to transform
Options
#macro EXCLUDE_OPTION_BINMODE
#include pgm_sopt.inc
#include pgm_popt.inc
ppfun : string = "" -- user-defined token conversion: Function@Library ( see [ptm_pp] )
#include pgm_odoc.inc
Environment
BINSTYX : path = "PATH"
-- search environment for [srclang.pim], [srclang.lim], [dstlang.pim] and [dstlang.lim]
styx-2.0.1/pgm/lim2dot.cmd 0000666 0001750 0001750 00000001132 10373405111 012260 0000000 0000000 # [lim2dot.cmd] command description for lim2dot.c
Program lim2dot -- Scanner table visualisation
doc
'lim2dot' converts a styx scanner table [Language.lim] into the graph file language 'dot'.
The current version doesn't support the embedded language facility.
cod
Arguments
Img : path -- path of the scanner table image [Language.lim]
Options
OutFile : path = "" -- path of the target file (default: stdout)
Template : path = "" -- path of the template file
doc
The template file can be used to specify default graph, node or edge attributes.
cod
Environment
styx-2.0.1/libstyx/ 0000755 0001750 0001750 00000000000 12116751137 011224 5 0000000 0000000 styx-2.0.1/libstyx/styx_gen.c 0000666 0001750 0001750 00000357740 12116673413 013174 0000000 0000000 /* ------------------------------------------------------------------------- */
/* */
/* [styx_gen.c] STYX Compiler Library */
/* - realizes an abstract syntax tree - */
/* */
/* Copyright (c) 2002 by D\olle, Manns. */
/* ------------------------------------------------------------------------- */
#include "standard.h"
#include "scn_base.h"
#include "prs.h"
#include "hmap.h"
#include "symbols.h"
#include "pathes.h"
#include "literal.h"
#include "prs_gen.h"
#include "cfg_abs.h"
#include "ptm.h"
#include "ptm_gen.h"
#include "gls.h"
#include "hset.h"
#include "scn_gen.h"
#include "scn_pre.h"
#include "sink.h"
#include "gstream.h"
#include "styx_int.h"
#include "styx_lim.h"
#include "styx_pim.h"
/*!!
The module [styx_gen] provides an reentrant interface for the compilation of
STYX definitions.
*/
/*I-------------------------- Types and macros ------------------------------ */
/* Scanner & parser translation */
#define UsageLet -100
#define UsageIgn 1
#define UsageTok 2
#define UsageCom 3
#define UsageLan 4
#define UsageInd 5
#define InitialGroup stringToSymbol("_INIT_")
#define RootCtx(c) ( ((c)->root == (Styx_T)NULL) ? (c) : (c)->root )
/* Interface generation */
#define INTEXT "int" /* FileNames will be LANGUAGE_INTEXT.(c|h) */
#define ANTEXT "ant" /* FileNames will be LANGUAGE_ANTEXT.(c|h) */
#define LineLen 78
ExternalType( StyxApp_T ) /* Abstract STYX application type */
{
PLR_Tab PTab; /* STYX Parse table */
Scn_T Scn; /* STYX Scan table */
};
ExternalType( Styx_T ) /* Abstract STYX compiler type */
{
StyxApp_T styapp; /* STYX application configuration */
/* STYX compilation configuration */
c_bool verbose; /* print progress information */
c_bool diagnose; /* print diagnose information */
c_bool conflicts; /* allow conflicts ? */
/* Parsing & semantic check of STYX definition */
c_string language; /* STYX language */
int version; /* STYX version (default=0) */
symbol incpath; /* STYX include & embedded path */
PT_Term PTree; /* Source derivation tree */
PT_Diag diag; /* Diagnose context */
MAPTY gloty; /* Type for global definitions */
MAP(PT_Term, PT_Term) glo; /* Global definitions */
MAP(symbol,PT_Term) grp; /* Scan groups */
MAP(GLS_Tok,symbol) grptok; /* Scan group tokens */
MAP(symbol,int) dyntok; /* Dynamic token references */
MAP(symbol,symbol) langrp; /* Embedded language token group */
MAP(GLS_Tok,symbol) tokgrp; /* Token --> group to activate */
MAP(PT_Term,symbol) ebnfmbr; /* EBNF production member */
int ebnfcnt; /* number of EBNF nonterminals */
MAP(symbol,SET(symbol)) metagrp; /* meta group --> token groups */
MAP(GLS_Tok,byte) tokflg; /* special token flags */
Styx_T root; /* Main language */
MAP(symbol,Styx_T) embed; /* Embedded languages */
c_string (*ef_info)(Styx_T styctx,c_string language, c_string incpath);
/* Embedded language path / definition retrieval function */
int (*ef_compile)(Styx_T styctx, c_string e_info, c_string incpath);
/* Embedded language path / definition compile function */
Any_T extctx; /* external context */
HS_Set tkset; /* Used tokens */
MAP(symbol,_) indtokkeys; /* (de)indent token keywords */
int errorCnt; /* number of translation errors */
/* Scanner translation */
MAP(GLS_Tok,RegSet_T) qlx; /* Computed RegSets */
/* Scan & parse table generation */
PLR_Tab PTab; /* Parse table */
Scn_T Scn; /* Scan table */
/* abstract syntax data structure ( see comments in cfg_abs.c ) */
int* aPol;
HS_Set* aNtm;
HS_Set* aPrd;
/* Interface generation */
FILE* SysOut; /* Interface output file */
c_bool genabs;
/* True: generate for row representation */
int maxlen;
/* Layout: maximal function name length */
c_string tkclsnam; /* Token class name */
c_string lprefix; /* Language prefix */
c_string cprefix; /* comment prefix */
c_string csuffix; /* comment suffix */
};
/*I----------------------------- Init & Quit --------------------------------- */
StyxApp_T STYX_app_init(void)
/* init STYX application */
{ StyxApp_T styapp;
initSymbols();
MAP_init();
styx_initSymbols();
styapp = New(StyxApp_T);
Scn_get_styx(&styapp->Scn);
styapp->PTab = PLR_get_styx();
return styapp;
}
void STYX_app_quit(StyxApp_T styapp)
/* quit STYX application; release resources */
{
if( styapp != (StyxApp_T)NULL )
{
if( styapp->PTab != (PLR_Tab)NULL )
{
PLR_delTab(styapp->PTab);
styapp->PTab = (PLR_Tab)NULL;
}
if( styapp->Scn != (Scn_T)NULL )
{
Scn_free(styapp->Scn);
styapp->Scn = (Scn_T)NULL;
}
FreeMem(styapp);
}
styx_quitSymbols();
MAP_quit();
freeSymbols();
}
/*forward*/ void STYX_quit(Styx_T styctx);
/*forward*/ int STYX_compile_file
(
Styx_T styctx, c_string stydfn, c_string incpath
);
/*forward*/ int STYX_compile_string
(
Styx_T styctx, c_string stydfn, c_string incpath
);
static void STYX_reset(Styx_T styctx)
{
styctx->errorCnt = 0;
styctx->SysOut = (FILE*)NULL;
styctx->genabs = C_False;
styctx->maxlen = 0;
styctx->version = 0;
if( styctx->embed != (MAP(_,_))NULL )
{
if( MAP_count(styctx->embed) > 0 )
{ MAPIT itr; Styx_T rng; symbol dom;
ROW(Styx_T) tmp = OT_CREATE_ADT(Styx_T);
long cnt, i;
MAP_forItrAsg(dom,rng,itr,styctx->embed)
{
if( !strcmp(symbolToString(dom),rng->language) )
OT_PUSH(rng,tmp);
}
cnt = OT_CNT(tmp);
for( i=0; i < cnt; ++i )
STYX_quit(OT_GET(Styx_T,tmp,i));
OT_DEL_T(tmp);
}
MAP_freeMap(styctx->embed);
styctx->embed = (MAP(_,_))NULL;
}
if( styctx->grp != (MAP(_,_))NULL )
{
MAP_freeMap(styctx->grp);
styctx->grp = (MAP(_,_))NULL;
}
if( styctx->grptok != (MAP(_,_))NULL )
{
MAP_freeMap(styctx->grptok);
styctx->grptok = (MAP(_,_))NULL;
}
if( styctx->dyntok != (MAP(_,_))NULL )
{
MAP_freeMap(styctx->dyntok);
styctx->dyntok = (MAP(_,_))NULL;
}
if( styctx->langrp != (MAP(_,_))NULL )
{
MAP_freeMap(styctx->langrp);
styctx->langrp = (MAP(_,_))NULL;
}
if( styctx->tokgrp != (MAP(_,_))NULL )
{
MAP_freeMap(styctx->tokgrp);
styctx->tokgrp = (MAP(_,_))NULL;
}
if( styctx->ebnfmbr != (MAP(_,_))NULL )
{
MAP_freeMap(styctx->ebnfmbr);
styctx->ebnfmbr = (MAP(_,_))NULL;
}
styctx->ebnfcnt = 0;
if( styctx->metagrp != (MAP(_,_))NULL )
{ MAPIT itr; SET(symbol) rng; symbol dom;
MAP_forItrAsg(dom,rng,itr,styctx->metagrp)
HS_DROP_SET(rng);
MAP_freeMap(styctx->metagrp);
styctx->metagrp = (MAP(_,_))NULL;
}
if( styctx->tokflg != (MAP(_,_))NULL )
{
MAP_freeMap(styctx->tokflg);
styctx->tokflg = (MAP(_,_))NULL;
}
if( styctx->glo != (MAP(_,_))NULL )
{
MAP_freeMap(styctx->glo);
styctx->glo = (MAP(_,_))NULL;
}
if( styctx->qlx != (MAP(_,_))NULL )
{ MAPIT itr; RegSet_T rng; symbol dom;
MAP_forItrAsg(dom,rng,itr,styctx->qlx)
RegSet_Free(rng);
MAP_freeMap(styctx->qlx);
styctx->qlx = (MAP(_,_))NULL;
}
if( styctx->indtokkeys != (MAP(symbol,_))NULL )
{
MAP_freeMap(styctx->indtokkeys);
styctx->indtokkeys = (MAP(symbol,_))NULL;
}
if( styctx->gloty != (MAPTY)NULL )
{
MAP_freeTyp(styctx->gloty);
styctx->gloty = (MAPTY)NULL;
}
if( styctx->tkset != (HS_Set)NULL )
{
HS_DROP_SET(styctx->tkset);
styctx->tkset = (HS_Set)NULL;
}
if( styctx->PTree != (PT_Term)NULL )
{
PT_delT(styctx->PTree);
styctx->PTree = (PT_Term)NULL;
}
if( styctx->PTab != (PLR_Tab)NULL )
{
acfg_quit(styctx->PTab,styctx->aPol,styctx->aNtm,styctx->aPrd);
PLR_delTab(styctx->PTab);
styctx->PTab = (PLR_Tab)NULL;
styctx->aPol = (int*)NULL;
styctx->aNtm = (HS_Set*)NULL;
styctx->aPrd = (HS_Set*)NULL;
}
if( styctx->Scn != (Scn_T)NULL )
{
Scn_free(styctx->Scn);
styctx->Scn = (Scn_T)NULL;
}
if( styctx->cprefix != (c_string)NULL )
{
FreeMem(styctx->cprefix);
styctx->cprefix = (c_string)NULL;
}
if( styctx->csuffix != (c_string)NULL )
{
FreeMem(styctx->csuffix);
styctx->csuffix = (c_string)NULL;
}
if( styctx->diag != (PT_Diag)NULL )
{
PT_diag_setErrorCnt(styctx->diag,0);
PT_diag_setWarningCnt(styctx->diag,0);
}
}
Styx_T STYX_init
(
StyxApp_T styapp, c_string language,
void (*prMsg)(c_string msg), c_bool verbose, c_bool diagnose
)
/* init STYX compilation for 'language';
'prMsg' --> print function or NULL
'verbose' --> (de)activate progress information
'diagnose' --> (de)activate diagnose information
*/
{ Styx_T styctx;
BUG_NULL(styapp); BUG_NULL(language);
styctx = New(Styx_T);
styctx->root = (Styx_T)NULL;
styctx->styapp = styapp;
styctx->verbose = verbose;
styctx->diagnose = diagnose;
styctx->conflicts = C_True;
styctx->language = StrCopy(language);
styctx->version = 0;
styctx->incpath = (symbol)NULL;
styctx->diag = PT_diag_init(prMsg!=NULL?prMsg:prMsg_stderr);
styctx->PTree = (PT_Term)NULL;
styctx->gloty = (MAPTY)NULL;
styctx->glo = (MAP(_,_))NULL;
styctx->embed = (MAP(_,_))NULL;
styctx->ef_info =
(c_string (*)(Styx_T styctx,c_string language,c_string incpath))NULL;
styctx->ef_compile = STYX_compile_file;
styctx->extctx = (Any_T)NULL;
styctx->grp = (MAP(_,_))NULL;
styctx->grptok = (MAP(_,_))NULL;
styctx->dyntok = (MAP(_,_))NULL;
styctx->langrp = (MAP(_,_))NULL;
styctx->tokgrp = (MAP(_,_))NULL;
styctx->ebnfmbr = (MAP(_,_))NULL;
styctx->ebnfcnt = 0;
styctx->metagrp = (MAP(_,_))NULL;
styctx->tokflg = (MAP(_,_))NULL;
styctx->tkset = (HS_Set)NULL;
styctx->indtokkeys = (MAP(symbol,_))NULL;
styctx->errorCnt = 0;
styctx->qlx = (MAP(_,_))NULL;
styctx->PTab = (PLR_Tab)NULL;
styctx->Scn = (Scn_T)NULL;
styctx->aPol = (int*)NULL;
styctx->aNtm = (HS_Set*)NULL;
styctx->aPrd = (HS_Set*)NULL;
styctx->SysOut = (FILE*)NULL;
styctx->genabs = C_False;
styctx->maxlen = 0;
styctx->tkclsnam = Str_printf("T%s",language);
styctx->lprefix = StrCopy(language);
styctx->cprefix = (c_string)NULL;
styctx->csuffix = (c_string)NULL;
return styctx;
}
void STYX_quit(Styx_T styctx)
/* quit STYX compilation; release resources */
{
if(styctx != (Styx_T)NULL )
{
STYX_reset(styctx);
if( styctx->language != (c_string)NULL )
{
FreeMem(styctx->language);
styctx->language = (c_string)NULL;
}
if( styctx->lprefix != (c_string)NULL )
{
FreeMem(styctx->lprefix);
styctx->lprefix = (c_string)NULL;
}
if( styctx->tkclsnam != (c_string)NULL )
{
FreeMem(styctx->tkclsnam);
styctx->tkclsnam = (c_string)NULL;
}
if( styctx->diag != (PT_Diag)NULL )
{
PT_diag_quit(styctx->diag);
styctx->diag = (PT_Diag)NULL;
}
FreeMem(styctx);
}
}
/*I----------------------------- Set & Get ----------------------------------- */
void STYX_set_conflict_policy(Styx_T styctx, c_bool conflicts)
/* (dis)allow conflicts during parse table generation */
{
BUG_NULL(styctx);
styctx->conflicts = conflicts;
}
void STYX_set_verbose(Styx_T styctx, c_bool verbose)
/* (de)activate progress information */
{
BUG_NULL(styctx);
styctx->verbose = verbose;
}
void STYX_set_diagnose(Styx_T styctx, c_bool diagnose)
/* (de)activate diagnose information */
{
BUG_NULL(styctx);
styctx->diagnose = diagnose;
}
void STYX_set_shortform(Styx_T styctx, c_bool shortform)
/* (de)activate short filenames ( default: longform ) */
{
BUG_NULL(styctx);
if( styctx->lprefix != (c_string)NULL ) FreeMem(styctx->lprefix);
if( shortform )
styctx->lprefix = Str_printf("%.4s",styctx->language);
else
styctx->lprefix = StrCopy(styctx->language);
if( styctx->tkclsnam != (c_string)NULL ) FreeMem(styctx->tkclsnam);
if( shortform )
styctx->tkclsnam = Str_printf("T%.4s",styctx->language);
else
styctx->tkclsnam = Str_printf("T%s",styctx->language);
}
void STYX_set_context(Styx_T styctx, Any_T extctx)
/* set external context information */
{
BUG_NULL(styctx);
assert0(RootCtx(styctx) == styctx,"");
styctx->extctx = extctx;
}
Any_T STYX_get_context(Styx_T styctx)
/* get external context information */
{
BUG_NULL(styctx);
return RootCtx(styctx)->extctx;
}
void STYX_set_fun_epath
(
Styx_T styctx,
c_string (*ef_path)(Styx_T styctx, c_string language, c_string incpath)
)
/* (re)set embedded language path retrieval function */
{
BUG_NULL(styctx);
assert0(RootCtx(styctx) == styctx,"");
styctx->ef_info = ef_path;
styctx->ef_compile = STYX_compile_file;
}
void STYX_set_fun_edfn
(
Styx_T styctx,
c_string (*ef_dfn)(Styx_T styctx, c_string language, c_string incpath)
)
/* (re)set embedded language definition retrieval function */
{
if( ef_dfn == NULL )
STYX_set_fun_epath(styctx,ef_dfn);
else
{
BUG_NULL(styctx);
assert0(RootCtx(styctx) == styctx,"");
styctx->ef_info = ef_dfn;
styctx->ef_compile = STYX_compile_string;
}
}
MAP(symbol,Styx_T) STYX_get_embed(Styx_T styctx)
/* STYX compilations of embedded languages or NULL;
The result map has to be released.
*/
{ MAP(symbol,Styx_T) embed = (MAP(_,_))NULL;
if( MAP_count(styctx->embed) > 0 )
{ MAPIT itr; Styx_T rng; symbol dom;
embed = MAP_newPrimMap();
MAP_forItrAsg(dom,rng,itr,styctx->embed)
{
if( !strcmp(symbolToString(dom),rng->language) )
MAP_dfndom(embed,dom,rng);
}
}
return embed;
}
void STYX_get_tables(Styx_T styctx, PLR_Tab* PTab, Scn_T* Scn)
/* get scan & parse table */
{
BUG_NULL(styctx);
if( PTab != (PLR_Tab*)NULL )
*PTab = styctx->PTab;
if( Scn != (Scn_T*)NULL )
*Scn = styctx->Scn;
}
/*I----------------------------- Compilation --------------------------------- */
/* semantic check */
static c_bool pop_group(Styx_T styctx, styxQlxGrp grp)
{
return styxQlxGrp_pop(grp);
}
static c_bool push_group(Styx_T styctx, styxQlxGrp grp)
{
return styxQlxGrp_pigrp(grp) || styxQlxGrp_pgrp(grp,_);
}
static void getGroupInfo
(
Styx_T styctx, styxQlxGrp grp,
symbol* grpsym, c_bool prError
)
{ GLS_Tok id;
if( grpsym != (symbol*)NULL )
*grpsym = (symbol)NULL;
if( styxQlxGrp_grp(grp,&id) || styxQlxGrp_pgrp(grp,&id) )
{
if( !MAP_defined(styctx->grp,GLS_Tok_symbol(id)) )
{
if( prError )
PT_diag_err
(
id,styctx->diag,"identifier '%s' undefined",
GLS_Tok_string(id)
);
}
else
{
if( grpsym != (symbol*)NULL )
*grpsym = GLS_Tok_symbol(id);
}
}
else
if( styxQlxGrp_igrp(grp) || styxQlxGrp_pigrp(grp) )
{
if( grpsym != (symbol*)NULL )
*grpsym = InitialGroup;
}
}
static void addTokenFlag(Styx_T styctx, GLS_Tok id, byte f)
{
if( MAP_defined(styctx->tokflg,id) )
f |= MAP_apply_small(byte,styctx->tokflg,id);
MAP_ovrdom(styctx->tokflg,id,f);
}
static PT_Term getDfn(Styx_T styctx, GLS_Tok id, c_bool force)
{ Styx_T rootctx = RootCtx(styctx);
if(MAP_defined(styctx->glo,id))
return MAP_apply(PT_Term,styctx->glo,id);
else
{
if( MAP_defined(rootctx->embed,GLS_Tok_symbol(id)) )
return MAP_apply(PT_Term,styctx->grp,GLS_Tok_symbol(id));
}
if( force == C_True ) C_BUG;
return (PT_Term)NULL;
}
static int qlx_usage(Styx_T styctx, PT_Term t)
{ styxQlxCat cat;
if (styx_QlxDfn(t,_) )
styxQlxDfn_defn((styxQlxDfn)t,&cat,_,_,_,_,_);
else
styxQlxDfn_defn((styxQlxDfn)getDfn(styctx,t,C_True),&cat,_,_,_,_,_);
if (styxQlxCat_letC(cat)) return UsageLet;
if (styxQlxCat_tokC(cat)) return UsageTok;
if (styxQlxCat_comC(cat)) return UsageCom;
if (styxQlxCat_ignC(cat)) return UsageIgn;
if (styxQlxCat_lanC(cat)) return UsageLan;
if (styxQlxCat_indC(cat)) return UsageInd;
C_BUG; return 0;
}
static c_bool qlx_quotient(Styx_T styctx, GLS_Tok id)
{ styxExp exp;
styxQlxDfn qd = (styxQlxDfn)getDfn(styctx,id,C_True);
if( !styxQlxDfn_defn(qd,_,_,_,_,_,&exp) )
return C_False;
return styxExp_quot(exp,_,_);
}
static c_bool qlx_dyck(Styx_T styctx, GLS_Tok id)
{ styxExp exp;
styxQlxDfn qd = (styxQlxDfn)getDfn(styctx,id,C_True);
if( !styxQlxDfn_defn(qd,_,_,_,_,_,&exp) )
return C_False;
if( styxExp_quot(exp,&exp,_) )
/* noop */;
return styxExp_dyck(exp,_,_,_);
}
static c_bool qlx_pattern(Styx_T styctx, GLS_Tok id)
{ styxExp exp;
styxQlxDfn qd = (styxQlxDfn)getDfn(styctx,id,C_True);
if( !styxQlxDfn_defn(qd,_,_,_,_,_,&exp) )
return C_False;
if( styxExp_quot(exp,&exp,_) )
/* noop */;
return styxExp_spat(exp,_,_,_) || styxExp_epat(exp,_,_,_);
}
static c_bool qlx_ica(Styx_T styctx, GLS_Tok id)
{ styxQlxOpt opt;
styxQlxDfn qd = (styxQlxDfn)getDfn(styctx,id,C_True);
if( !styxQlxDfn_defn(qd,_,&opt,_,_,_,_) )
return C_False;
return styxQlxOpt_ignca(opt);
}
static void Pass1(Styx_T styctx, styxSource s)
/* Collecting definitions and scoping rules */
{ Styx_T lanctx, rootctx; bool startflg = False;
int indcnt = 0, dyncnt = 0, rc;
MAP(PT_Term,NULL) pro = MAP_newMap(styctx->gloty); /* Productions */
PT_Itr it; styxOptCfg optcfg; GLS_Lst(styxDfn) dfns;
rootctx = RootCtx(styctx);
styxSource_root(s,_,_,_,&optcfg);
/* set initial group */
MAP_dfndom(styctx->grp,InitialGroup,(PT_Term)NULL);
/* collect definitions */
PT_FORALL(it,s)
{ PT_Term t = PT_termIT(it), st = (PT_Term)NULL;
if (PT_stateIT(it) == PT_POST)
{ styxQlxDfn qd; styxDfn pd; styxPrd p; GLS_Tok id, sgid, dgid;
styxMbr mbr;
/* Scope(Source): all identifiers in QLX definitions */
if (styx_QlxDfn(t,&qd) )
{ styxQlxOpt o; styxQlxCat c; styxQlxGrp gsrc, gdst; styxExp e, e1;
if( styxQlxDfn_igrp(qd,&id) || styxQlxDfn_xgrp(qd,&id) ||
styxQlxDfn_tgrp(qd,&id) ||
styxQlxDfn_mgrp(qd,&id,_) )
{ GLS_Lst(GLS_Tok) ids, lst;
if (MAP_defined(styctx->grp,GLS_Tok_symbol(id)) ||
!strcmp(styctx->language,GLS_Tok_string(id)))
PT_diag_err
(
id,styctx->diag,"identifier '%s' already defined",
GLS_Tok_string(id)
);
else
{
MAP_dfndom(styctx->grp,GLS_Tok_symbol(id),qd);
if( styxQlxDfn_mgrp(qd,_,&ids) )
{ SET(symbol) grpset = HS_CREATE_ADTSET(symbol);
MAP_dfndom(styctx->metagrp,GLS_Tok_symbol(id),grpset);
GLS_FORALL(lst,ids)
{ GLS_Tok grpid = GLS_FIRST(GLS_Tok,lst);
if( !strcmp(styctx->language,GLS_Tok_string(grpid)) )
HS_SET_ELM(InitialGroup,grpset);
else
if( !MAP_defined(styctx->grp,GLS_Tok_symbol(grpid)) )
PT_diag_err
(
grpid,styctx->diag,"undefined identifier '%s'",
GLS_Tok_string(grpid)
);
else
if( MAP_defined(styctx->metagrp,GLS_Tok_symbol(grpid)) )
PT_diag_err(grpid,styctx->diag,"invalid group");
else
HS_SET_ELM(GLS_Tok_symbol(grpid),grpset);
}
}
}
}
else
if ( styxQlxDfn_defn(qd,&c,&o,&gsrc,&id,&gdst,&e) )
{
if( !styxQlxCat_lanC(c) && MAP_defined(styctx->glo,id))
PT_diag_err
(
id,styctx->diag,"identifier '%s' already defined",
GLS_Tok_string(id)
);
else
{
if( !styxQlxCat_lanC(c) )
MAP_dfndom(styctx->glo,id,qd);
if( styxQlxCat_letC(c) )
{
if( !styxQlxGrp_non(gsrc) || !styxQlxGrp_non(gdst) )
PT_diag_err(qd,styctx->diag,"grouping not allowed here");
}
else
if( styxQlxCat_lanC(c) )
{
if( !(styxQlxGrp_grp(gsrc,&sgid) && styxQlxGrp_grp(gdst,&dgid)) )
PT_diag_err
(
qd,styctx->diag,"invalid or incomplete embedded language specification"
);
else
{ c_string lantok, lanpath; symbol lansym;
lantok = Str_printf
(
"%s%s",GLS_Tok_string(sgid),GLS_Tok_string(id)
);
lansym = stringToSymbol(lantok);
if( MAP_defined(styctx->grp,lansym) )
PT_diag_err
(
id,styctx->diag,"identifier '%s' already defined",
symbolToString(lansym)
);
else
{ styxCat c;
MAP_dfndom(styctx->grp,lansym,qd);
if( !MAP_defined(rootctx->embed,GLS_Tok_symbol(sgid)) )
{ c_string incpath = symbolToString(styctx->incpath);
lanctx = STYX_init
(
styctx->styapp, GLS_Tok_string(sgid),
PT_diag_msgFun(styctx->diag),
styctx->verbose, styctx->diagnose
);
lanctx->root = rootctx;
MAP_dfndom(rootctx->embed,GLS_Tok_symbol(sgid),lanctx);
MAP_ovrdom(rootctx->embed,lansym,lanctx);
if( rootctx->ef_info != NULL )
lanpath =
(*rootctx->ef_info)(styctx,GLS_Tok_string(sgid),incpath);
else
lanpath = MkPath(incpath,GLS_Tok_string(sgid),".sty",'p');
rc = (*rootctx->ef_compile)(lanctx,lanpath,incpath);
if( rc != 0 )
PT_diag_err
(
qd,styctx->diag,
"compilation of embedded language '%s' failed",
GLS_Tok_string(sgid)
);
FreeMem(lanpath);
}
else
{
lanctx = MAP_apply(Styx_T,rootctx->embed,GLS_Tok_symbol(sgid));
MAP_ovrdom(rootctx->embed,lansym,lanctx);
if( lanctx->qlx == (MAP(_,_))NULL )
PT_diag_err
(
qd,styctx->diag,
"cyclic referenced embedded language '%s'",
GLS_Tok_string(sgid)
);
}
if( strcmp(styctx->language,GLS_Tok_string(dgid)) &&
strcmp(lanctx->language,GLS_Tok_string(dgid)) )
PT_diag_err
(
dgid,styctx->diag,
"unknown EOF or follow token language '%s'",
GLS_Tok_string(dgid)
);
if( MAP_defined(lanctx->glo,id) )
st = MAP_apply(PT_Term,lanctx->glo,id);
if( st != (PT_Term)NULL &&
( !styx_Dfn(st,&pd) ||
!styxDfn_defn(pd,&c,_,_,_) || !styxCat_bgnC(c) ) )
PT_diag_err
(
id,styctx->diag,
"start symbol '%s' doesn't exist in language '%s'",
GLS_Tok_string(id), GLS_Tok_string(sgid)
);
}
FreeMem(lantok);
}
}
else
{ symbol srcsym = (symbol)NULL,
dstsym = (symbol)NULL;
getGroupInfo(styctx,gsrc,&srcsym,C_True);
if( srcsym == (symbol)NULL )
srcsym = InitialGroup;
MAP_dfndom(styctx->grptok,id,srcsym);
if( MAP_defined(rootctx->embed,srcsym) )
PT_diag_err(gsrc,styctx->diag,"invalid group or group list");
getGroupInfo(styctx,gdst,&dstsym,C_True);
if( MAP_defined(styctx->metagrp,dstsym) )
PT_diag_err(gdst,styctx->diag,"invalid group");
else
if( dstsym != (symbol)NULL )
{
MAP_ovrdom(styctx->tokgrp,id,dstsym);
}
if( push_group(styctx,gdst) || pop_group(styctx,gdst) )
{
addTokenFlag(styctx,id,SCN_FLG_GroupStack);
if( styxExp_spat(e,_,_,_) ||
( styxExp_quot(e,&e1,_) && styxExp_spat(e1,_,_,_) ) )
PT_diag_err(c,styctx->diag,"push/pop group not allowed here");
}
if( MAP_defined(rootctx->embed,dstsym) )
{
addTokenFlag(styctx,id,SCN_FLG_SwitchToken);
if( MAP_defined(styctx->langrp,dstsym) )
{
if( MAP_apply(symbol,styctx->langrp,dstsym) != srcsym )
PT_diag_err
(
gsrc,styctx->diag,
"different embedded language token group '%s'",
symbolToString(srcsym)
);
}
else
{
MAP_dfndom(styctx->langrp,dstsym,srcsym);
}
if( push_group(styctx,gdst) )
PT_diag_err(c,styctx->diag,"push group not allowed here");
if( ! styxQlxCat_tokC(c) && ! styxQlxCat_comC(c) )
PT_diag_err(c,styctx->diag,"invalid switch token category");
}
}
}
/* quotient expression must be set or sequence */
if( styxExp_quot(e,_,&e1) &&
!( styxExp_set(e1,_) || styxExp_sequ(e1,_) ) )
PT_diag_err
(
e1,styctx->diag,"quotient expression must be set or sequence"
);
/* CaseIgnore only with categories tok, com */
if( styxQlxOpt_ignca(o) &&
! styxQlxCat_tokC(c) &&
! styxQlxCat_comC(c) )
PT_diag_err(o,styctx->diag,"CaseIgnore not allowed here");
/* dyck, pattern not with categories let, lan, ind */
if( (styxExp_quot(e,_,_) || styxExp_dyck(e,_,_,_) ||
styxExp_spat(e,_,_,_) || styxExp_epat(e,_,_,_)) &&
(styxQlxCat_letC(c) || styxQlxCat_lanC(c) || styxQlxCat_indC(c)) )
PT_diag_err(e,styctx->diag,"quotient, dyck or pattern token definition not allowed here");
/* pattern not with category ign */
if( (styxExp_quot(e,_,_) || styxExp_spat(e,_,_,_) || styxExp_epat(e,_,_,_)) &&
styxQlxCat_ignC(c) )
PT_diag_err(e,styctx->diag,"quotient or pattern token definition not allowed here");
/* maximal 1 (de)indent token per scanner (group) */
indcnt += styxQlxCat_indC(c);
if( indcnt > 1 )
PT_diag_err(o,styctx->diag,"too many (de)indent tokens");
}
else
if ( styxQlxDfn_defd(qd,&id) )
{
if( MAP_defined(styctx->glo,id))
PT_diag_err
(
id,styctx->diag,"identifier '%s' already defined",
GLS_Tok_string(id)
);
else
{
MAP_dfndom(styctx->glo,id,qd);
MAP_dfndom(styctx->dyntok,GLS_Tok_symbol(id),0);
}
}
}
/* Scope(Source): all identifiers in CFG definitions */
if (styx_Dfn(t,&pd))
{ styxCat c; styxDfnOpt o;
if ( styxDfn_defn(pd,&c,&o,&id,_) )
{
if (MAP_defined(styctx->glo,id))
PT_diag_err
(
id,styctx->diag,"identifier '%s' already defined",
symbolToString(GLS_Tok_symbol(id))
);
else MAP_dfndom(styctx->glo,id,pd);
if (MAP_emptyMap(pro))
PT_diag_err
(
id,styctx->diag,"production '%s' has no rules",
GLS_Tok_string(id)
);
MAP_rmvall(pro);
startflg |= styxCat_bgnC(c);
}
}
/* Scope(Definition): all production identifiers */
if (styx_Prd(t,&p))
{
dyncnt = 0;
if ( styxPrd_prod(p,_,&id,_) )
{
if (MAP_defined(pro,id))
PT_diag_err
(
id,styctx->diag,"identifier '%s' already defined",
GLS_Tok_string(id)
);
else MAP_dfndom(pro,id,NULL);
}
}
if (styx_Mbr(t,&mbr) )
{
if( styxMbr_dtok(mbr,_,_) )
++dyncnt;
if( dyncnt == 2 )
PT_diag_err
(
mbr,styctx->diag,"production with more than one dynamic token members"
);
}
}
}
if( ! startflg && styxOptCfg_cfg(optcfg,&dfns,_) && ! GLS_EMPTY(dfns) )
PT_diag_err(dfns,styctx->diag,"missing start production");
MAP_freeMap(pro);
}
static int Pass2_checkMbrIde(Styx_T styctx, GLS_Tok id, GLS_Lst(styxQlxDfn) qlxdfns)
/* check wether production or conflict member 'id' is a defined token or nonterminal
rc = -1 (unknown), 0 (token), 1 (nonterminal), 2 (embedded language token)
*/
{
Styx_T rootctx = RootCtx(styctx);
if (!MAP_defined(styctx->glo,id) &&
!MAP_defined(rootctx->embed,GLS_Tok_symbol(id)))
{
if( GLS_EMPTY(qlxdfns) )
{
return 0;
}
}
else
if (MAP_defined(styctx->glo,id))
{ PT_Term def = MAP_apply(PT_Term,styctx->glo,id);
styxQlxDfn qd; styxQlxCat qc;
if( ! ( styx_Dfn(def,_) ||
( styx_QlxDfn(def,&qd) &&
( styxQlxDfn_defd(qd,_) ||
styxQlxDfn_defn(qd,&qc,_,_,_,_,_) &&
(styxQlxCat_tokC(qc) || styxQlxCat_lanC(qc)) ) ) ) )
{
PT_diag_err
(
id,styctx->diag,"invalid production member symbol '%s'",GLS_Tok_string(id)
);
return -1;
}
return styx_Dfn(def,_) ? 1 : 0;
}
else
if( MAP_defined(styctx->grp,GLS_Tok_symbol(id)) )
{
return 2;
}
PT_diag_err
(
id,styctx->diag,"undefined grammar symbol '%s'",GLS_Tok_string(id)
);
return -1;
}
static void Pass2_checkMbr(Styx_T styctx, styxMbr m, GLS_Lst(styxQlxDfn) qlxdfns)
/* check production member 'm' (Pass2) */
{ GLS_Tok id, did; int rc, flg;
if ( styxMbr_ntm(m,&id) )
{
rc = Pass2_checkMbrIde(styctx,id,qlxdfns);
if( rc == 0 && MAP_defined(styctx->dyntok,GLS_Tok_symbol(id)) )
{
flg = MAP_apply(int,styctx->dyntok,GLS_Tok_symbol(id));
flg |= 2;
MAP_upddom(styctx->dyntok,GLS_Tok_symbol(id),(long)flg);
}
}
else
if ( styxMbr_dtok(m,&id,&did) )
{
rc = Pass2_checkMbrIde(styctx,id,qlxdfns);
if( rc == 1 || rc == 2 ||
MAP_defined(styctx->dyntok,GLS_Tok_symbol(id)) )
{
PT_diag_err
(
id,styctx->diag,"expected token '%s'",GLS_Tok_string(id)
);
}
if( !MAP_defined(styctx->dyntok,GLS_Tok_symbol(did)) )
{
PT_diag_err
(
did,styctx->diag,"undefined dynamic token '%s'",GLS_Tok_string(did)
);
}
else
{
flg = MAP_apply(int,styctx->dyntok,GLS_Tok_symbol(did));
flg |= 1;
MAP_upddom(styctx->dyntok,GLS_Tok_symbol(did),(long)flg);
}
}
else
{ styxMbr em;
if( styxMbr_klst0(m,_,&em,_,_) ||
styxMbr_klst1(m,_,&em,_,_) || styxMbr_opt(m,_,&em,_) )
{
Pass2_checkMbr(styctx,em,qlxdfns);
}
}
}
static void Pass2_checkConflict
(
Styx_T styctx, styxConflict conflict,
GLS_Lst(styxQlxDfn) qlxdfns
)
/* check wether conflict token, state and rules refer to defined
token, nonterminals and productions.
*/
{ styxState state; styxToken token; GLS_Lst(styxRule) rules, itr;
if( styxConflict_defn(conflict,&state,&token,&rules) )
{ GLS_Tok id1, id2, pid;
int rc;
if( styxState_ide(state,&id1) )
{
rc = Pass2_checkMbrIde(styctx,id1,qlxdfns);
}
if( styxToken_ide(token,&id1) )
{
rc = Pass2_checkMbrIde(styctx,id1,qlxdfns);
if( rc == 1 ) /* nonterminal */
{
PT_diag_err
(
id1,styctx->diag,"'%s' must be a token",GLS_Tok_string(id1)
);
}
}
GLS_FORALL(itr,rules)
{
styxRule rule = GLS_FIRST(styxRule,itr);
if( styxRule_red(rule,&id1,&id2) )
{
rc = Pass2_checkMbrIde(styctx,id1,qlxdfns);
if( rc == 0 || rc == 2 ) /* token */
{
PT_diag_err
(
id1,styctx->diag,"'%s' must be a nonterminal",GLS_Tok_string(id1)
);
}
else
if( rc == 1 ) /* nonterminal */
{ PT_Term def = MAP_apply(PT_Term,styctx->glo,id1);
styxDfn pd; GLS_Lst(styxPrd) prds, prditr;
if( styx_Dfn(def,&pd) && styxDfn_defn(pd,_,_,_,&prds) )
{
c_bool found = C_False;
GLS_FORALL(prditr,prds)
{ styxPrd p = GLS_FIRST(styxPrd,prditr);
if( styxPrd_prod(p,_,&pid,_) &&
GLS_Tok_symbol(pid) == GLS_Tok_symbol(id2) );
{
found = C_True; break;
}
}
if( !found )
{
PT_diag_err
(
id2,styctx->diag,"'%s' must be a production name",GLS_Tok_string(id2)
);
}
}
}
}
}
}
}
static void Pass2(Styx_T styctx, styxSource s)
/* References */
{ PT_Itr it; Styx_T rootctx = RootCtx(styctx), tokctx;
MAP(PT_Term,Styx_T) lanexp = MAP_newPrimMap();
GLS_Lst(styxQlxDfn) qlxdfns;
styxSource_root(s,_,_,&qlxdfns,_);
PT_FORALL(it,s)
{ PT_Term t = PT_termIT(it);
styxExp exp; GLS_Tok id, lid;
if (PT_stateIT(it) == PT_PRAE)
{ styxQlxDfn qd; styxQlxCat c; styxQlxGrp g;
if (styx_QlxDfn(t,&qd) &&
styxQlxDfn_defn(qd,&c,_,_,_,&g,&exp) &&
styxQlxCat_lanC(c) &&
styxQlxGrp_grp(g,&lid))
{
if( MAP_defined(rootctx->embed,GLS_Tok_symbol(lid)) )
MAP_dfndom
(
lanexp,exp,MAP_apply(Styx_T,rootctx->embed,GLS_Tok_symbol(lid))
);
else
MAP_dfndom(lanexp,exp,styctx);
}
}
else
if (PT_stateIT(it) == PT_POST)
{ styxMbr m; styxConflict cr;
if (styx_Exp(t,&exp) )
{
if ( styxExp_ident(exp,&id) )
{ styxQlxDfn qd;
tokctx = styctx;
if( MAP_defined(lanexp,exp) )
tokctx = MAP_apply(Styx_T,lanexp,exp);
if (!MAP_defined(tokctx->glo,id))
PT_diag_err
(
id,styctx->diag,"undefined identifier '%s'",GLS_Tok_string(id)
);
else
if (!styx_QlxDfn(MAP_apply(PT_Term,tokctx->glo,id),&qd))
PT_diag_err
(
id,styctx->diag,"undefined QLX-identifier '%s'", GLS_Tok_string(id)
);
else
if( styxQlxDfn_defd(qd,_) ||
qlx_usage(tokctx,id) == UsageLan ||
qlx_quotient(tokctx,id) || qlx_dyck(tokctx,id)
/*|| qlx_pattern(tokctx,id)*/ )
PT_diag_err
(
id,styctx->diag,"'%s' can't be used as subexpression",
GLS_Tok_string(id)
);
}
}
if (styx_Mbr(t,&m) )
{
Pass2_checkMbr(styctx,m,qlxdfns);
}
else
if( styx_Conflict(t,&cr) )
{
Pass2_checkConflict(styctx,cr,qlxdfns);
}
}
}
MAP_freeMap(lanexp);
}
/* Scanner Translation */
static RegSet_T trans_Ide(Styx_T styctx, GLS_Tok id);
static RegSet_T trans_Exp(Styx_T styctx, styxExp e);
static RegSet_T TRANS_RegSet_String(string s)
{ RegSet_T reg; long len; c_bool ucs4;
wc_string tstring = LIT_styx_lit_str(&len,s,&ucs4);
reg = RegSet_StringN(tstring,len);
FreeMem(tstring);
return reg;
}
static RegSet_T TRANS_RegSet_Cset
(
Styx_T styctx, string s, PT_Term t, c_bool setrange
)
{ RegSet_T reg, a, b; long len, i; c_bool ucs4;
wc_string tstring = LIT_styx_lit_str(&len,s,&ucs4);
if( !setrange || strstr(s,"..") == (c_string)NULL )
reg = RegSet_CsetN(tstring,len);
else
{ reg = (RegSet_T)NULL;
for( i=0; i < len; ++i )
{
if( i + 3 < len &&
tstring[i+1] == WCHAR_LITERAL('.') &&
tstring[i+2] == WCHAR_LITERAL('.') )
{
if (tstring[i] > tstring[i+3])
{
PT_diag_err
(
t,styctx->diag,"range ( %ld, %ld ) must be ordered",
tstring[i], tstring[i+3]
);
a = RegSet_Range(tstring[i+3], tstring[i]);
}
else
{
a = RegSet_Range(tstring[i], tstring[i+3]);
}
i+= 3;
}
else
{
a = RegSet_CsetN(&tstring[i],1);
}
if( reg == (RegSet_T)NULL ) reg = a;
else
{
b = RegSet_Union(reg,a);
RegSet_Free(a); RegSet_Free(reg);
reg = b;
}
}
}
FreeMem(tstring); return reg;
}
static c_string TRANS_ID_Cset
(
Styx_T styctx, string s, PT_Term t,
c_bool setrange, c_bool quotient
)
{ Sink snk = Sink_open(); long len, i; c_bool ucs4;
wc_string tstring = LIT_styx_lit_str(&len,s,&ucs4);
Sink_printf(snk,"%c",SCN_SEP_TOK_ID_PATTERN);
if( quotient )
{
Sink_printf(snk,"%03d",(unsigned int)s[0]);
}
else /* pattern */
{
Sink_printf(snk,"000");
}
if( ucs4 )
{
PT_diag_err(t,styctx->diag,"invalid unicode character in set");
}
else
if( !setrange || strstr(s,"..") == (c_string)NULL )
{
for( i=0; i < len; ++i )
{
Sink_printf(snk,"%03ld",tstring[i]);
}
}
else
{
for( i=0; i < len; ++i )
{
if( i + 3 < len &&
tstring[i+1] == WCHAR_LITERAL('.') &&
tstring[i+2] == WCHAR_LITERAL('.') )
{
if (tstring[i] > tstring[i+3])
{ /* error already reported */
Sink_printf(snk,"%03ld...%03ld",tstring[i+3], tstring[i]);
}
else
{
Sink_printf(snk,"%03ld...%03ld",tstring[i], tstring[i+3]);
}
i+= 3;
}
else
{
Sink_printf(snk,"%03ld",tstring[i]);
}
}
}
FreeMem(tstring);
return Sink_close(snk);
}
static c_string TRANS_ID_quotient
(
Styx_T styctx, styxExp exp, c_bool setrange
)
{ styxExp exp1; GLS_Tok tok;
assert0(styxExp_quot(exp,_,&exp1),"");
if( styxExp_set(exp1,&tok) )
{
return TRANS_ID_Cset(styctx,GLS_Tok_string(tok),tok,C_True,C_True);
}
else
if( styxExp_sequ(exp1,&tok) )
{
return TRANS_ID_Cset(styctx,GLS_Tok_string(tok),tok,C_True,C_True);
}
else /* error, already reported */
{
return StrCopy("");
}
}
static StdCPtr TRANS_Seq(GLS_Tok seq, c_bool* ucs4)
{ StdCPtr res; wc_string tstring; long len;
string s = symbolToString(GLS_Tok_symbol(seq));
tstring = LIT_styx_lit_str(&len,s,ucs4);
if( *ucs4 == C_False )
{
res = WCToStrCopy(tstring);
bug0(strlen((string)res) == len,"'\\0' not allowed in keywords");
FreeMem(tstring);
}
else
{
bug0(WCStrLen(tstring) == len,"'L\\0' not allowed in keywords");
res = tstring;
}
return res;
}
static RegSet_T trans_Ide(Styx_T styctx, GLS_Tok id)
{
if (!MAP_defined(styctx->qlx,id))
{ RegSet_T res,old; styxExp exp, lft;
/* Flag to protect against endless recursion */
MAP_dfndom(styctx->qlx,id,NULL);
styxQlxDfn_defn(MAP_apply(styxQlxDfn,styctx->glo,id),_,_,_,_,_,&exp);
if( styxExp_quot(exp,&exp,_) )
/* noop */;
if( styxExp_dyck(exp,&lft,_,_) )
res = trans_Exp(styctx,lft);
else res = trans_Exp(styctx,exp);
old = MAP_apply(RegSet_T,styctx->qlx,id);
if (old != (RegSet_T)NULL) RegSet_Free(old);
MAP_upddom(styctx->qlx,id,res);
}
else
if (MAP_apply(RegSet_T,styctx->qlx,id) == (RegSet_T)NULL)
{
PT_diag_err(id,styctx->diag,"recursive definition");
MAP_upddom(styctx->qlx,id,RegSet_Empty());
}
return RegSet_Copy(MAP_apply(RegSet_T,styctx->qlx,id));
}
static RegSet_T trans_Exp(Styx_T styctx, styxExp e)
{ styxExp exp1; styxExp exp2;
styxLimit limit; GLS_Tok tok;
if( styxExp_union(e,&exp1,&exp2) )
{ RegSet_T a = trans_Exp(styctx,exp1);
RegSet_T b = trans_Exp(styctx,exp2);
RegSet_T res = RegSet_Union(a,b);
RegSet_Free(a); RegSet_Free(b);
return res;
}
if( styxExp_diff(e,&exp1,&exp2) )
{ RegSet_T a = trans_Exp(styctx,exp1);
RegSet_T b = trans_Exp(styctx,exp2);
RegSet_T res = RegSet_Difference(a,b);
RegSet_Free(a); RegSet_Free(b);
return res;
}
if( styxExp_conc(e,&exp1,&exp2) )
{ RegSet_T a = trans_Exp(styctx,exp1);
RegSet_T b = trans_Exp(styctx,exp2);
RegSet_T res;
res = RegSet_Concat(a,b);
RegSet_Free(a); RegSet_Free(b);
return res;
}
if( styxExp_spat(e,&exp1,&tok,&exp2) )
{ RegSet_T a = styxExp_non(exp1)
? RegSet_Epsilon() : trans_Exp(styctx,exp1);
RegSet_T b = styxExp_non(exp2)
? RegSet_Epsilon() : trans_Exp(styctx,exp2);
RegSet_T c = TRANS_RegSet_Cset
(
styctx,symbolToString(GLS_Tok_symbol(tok)),tok,C_True
);
RegSet_T d = RegSet_Plus(c);
RegSet_T e = RegSet_Concat(a,d);
RegSet_T res = RegSet_Concat(e,b);
RegSet_Free(a);
RegSet_Free(b);
RegSet_Free(c);
RegSet_Free(d);
RegSet_Free(e);
return res;
}
if( styxExp_epat(e,&exp1,&tok,&exp2) )
{ styxExp exp; RegSet_T a, b, c, d, e, res;
a = styxExp_non(exp1) ? RegSet_Epsilon() : trans_Exp(styctx,exp1);
b = styxExp_non(exp2) ? RegSet_Epsilon() : trans_Exp(styctx,exp2);
styxQlxDfn_defn(MAP_apply(styxQlxDfn,styctx->glo,tok),_,_,_,_,_,&exp);
if( styxExp_quot(exp,&exp,_) )
/* noop */;
if( !styxExp_spat(exp,_,&tok,_) )
{
PT_diag_err
(
tok,styctx->diag,"'%s' is no start pattern",GLS_Tok_string(tok)
);
d = trans_Exp(styctx,exp);
}
else
{
c = TRANS_RegSet_Cset
(
styctx,symbolToString(GLS_Tok_symbol(tok)),tok,C_True
);
d = RegSet_Plus(c);
RegSet_Free(c);
}
e = RegSet_Concat(a,d);
res = RegSet_Concat(e,b);
RegSet_Free(a);
RegSet_Free(b);
RegSet_Free(d);
RegSet_Free(e);
return res;
}
if( styxExp_opt(e,&exp1) )
{ RegSet_T a = trans_Exp(styctx,exp1);
RegSet_T res = RegSet_Option(a);
RegSet_Free(a);
return res;
}
if( styxExp_star(e,&exp1) || styxExp_plus0(e,&exp1) )
{ RegSet_T a = trans_Exp(styctx,exp1);
RegSet_T res = RegSet_Star(a);
RegSet_Free(a);
return res;
}
if( styxExp_plus(e,&exp1) )
{ RegSet_T a = trans_Exp(styctx,exp1);
RegSet_T res = RegSet_Plus(a);
RegSet_Free(a);
return res;
}
if( styxExp_plusn(e,&exp1,&limit) )
{ RegSet_T a = trans_Exp(styctx,exp1);
RegSet_T res = (RegSet_T)NULL;
styxOptNat optnat;
int lwr = -1, upr = -1;
if( styxLimit_ntime(limit,&tok) )
{
lwr = atoi(GLS_Tok_string(tok));
if (lwr < 0) PT_diag_err(tok,styctx->diag,"limit >= 0");
res = RegSet_Plus_ntimes(a,lwr);
}
else
if( styxLimit_range(limit,&tok,&optnat) )
{
lwr = atoi(GLS_Tok_string(tok));
if (lwr < 0) PT_diag_err(tok,styctx->diag,"limit >= 0");
if( styxOptNat_nat(optnat,&tok) )
{
upr = atoi(GLS_Tok_string(tok));
if (upr < 0) PT_diag_err(tok,styctx->diag,"limit >= 0");
res = RegSet_Plus_range(a,lwr,upr);
}
else
{
RegSet_T b = RegSet_Plus_ntimes(a,lwr);
RegSet_T c = RegSet_Star(a);
res = RegSet_Concat(b,c);
RegSet_Free(b); RegSet_Free(c);
}
}
RegSet_Free(a);
return res;
}
if( styxExp_range(e,&exp1,&exp2) )
{ RegSet_T a = trans_Exp(styctx,exp1);
RegSet_T b = trans_Exp(styctx,exp2);
RegSet_T res;
wc_char al, bu;
if (!RegSet_isChar(a)) PT_diag_err(exp1,styctx->diag,"single character");
if (!RegSet_isChar(b)) PT_diag_err(exp2,styctx->diag,"single character");
al = RegSet_charVal(a);
bu = RegSet_charVal(b);
if (al > bu)
{ wc_char x = al; al = bu; bu = x;
PT_diag_err(e,styctx->diag,"range ( %ld, %ld ) must be ordered",bu,al);
}
res = RegSet_Range(al,bu);
RegSet_Free(a); RegSet_Free(b);
return res;
}
if( styxExp_set(e,&tok) )
return TRANS_RegSet_Cset(styctx,GLS_Tok_string(tok),tok,C_False);
if( styxExp_sequ(e,&tok) )
return TRANS_RegSet_String(GLS_Tok_string(tok));
if( styxExp_ident(e,&tok) )
return trans_Ide(styctx,tok);
C_BUG; return (RegSet_T)NULL;
}
static void collectEofOrFollowTokens
(
Styx_T styctx, Styx_T parctx, symbol lansym, styxExp e,
MAP(symbol,MAP(GLS_Tok,RegSet_T)) g_ftoks
)
{ Styx_T rootctx = RootCtx(styctx),
lanctx = MAP_apply(Styx_T,rootctx->embed,lansym), ftokctx;
styxQlxDfn qd = MAP_apply(styxQlxDfn,styctx->grp,lansym);
styxQlxGrp gs, gd; styxExp exp1, exp2; GLS_Tok tok, slid, dlid;
MAP(GLS_Tok,RegSet_T) ftoks;
assert0
(
styxQlxDfn_defn(qd,_,_,&gs,_,&gd,_) &&
styxQlxGrp_grp(gs,&slid) && styxQlxGrp_grp(gd,&dlid),""
);
ftokctx = ( !strcmp(GLS_Tok_string(dlid),styctx->language) )
? styctx : lanctx;
if( MAP_defined(g_ftoks,GLS_Tok_symbol(slid)) )
ftoks = MAP_apply(MAP(_,_),g_ftoks,GLS_Tok_symbol(slid));
else
{
ftoks = MAP_newMap(styctx->gloty);
MAP_dfndom(g_ftoks,GLS_Tok_symbol(slid),ftoks);
MAP_dfndom(ftoks,(GLS_Tok)NULL,(RegSet_T)NULL);
}
if( styxExp_conc(e,&exp1,&exp2) )
{
collectEofOrFollowTokens(styctx,parctx,lansym,exp1,g_ftoks);
collectEofOrFollowTokens(styctx,parctx,lansym,exp2,g_ftoks);
}
else
if( styxExp_ident(e,&tok) )
{ styxQlxGrp gsrc; symbol grpsym;
if( qlx_pattern(ftokctx,tok) )
PT_diag_err
(
tok,parctx->diag,
"pattern token '%s' not allowed here", GLS_Tok_string(tok)
);
else
if( ftokctx != lanctx && MAP_defined(lanctx->glo,tok) )
PT_diag_err
(
tok,parctx->diag,
"identifier '%s' already defined in embedded language '%s'",
GLS_Tok_string(tok),lanctx->language
);
else
{ styxQlxCat c;
styxQlxDfn_defn(MAP_apply(styxQlxDfn,ftokctx->glo,tok),&c,_,&gsrc,_,_,_);
if( ftokctx == styctx )
{
getGroupInfo(styctx,gsrc,&grpsym,C_False);
if( grpsym == (symbol)NULL )
grpsym = InitialGroup;
if( MAP_defined(styctx->langrp,lansym) &&
MAP_apply(symbol,styctx->langrp,lansym) != grpsym )
PT_diag_err
(
gsrc,parctx->diag,
"different embedded language token group '%s'",
symbolToString(grpsym)
);
else
{ RegSet_T a, b, u;
if( MAP_defined(ftoks,tok) )
{
a = MAP_apply(RegSet_T,ftoks,tok);
b = trans_Ide(styctx,tok);
u = RegSet_Union(a,b);
MAP_dfndom(ftoks,tok,u);
RegSet_Free(a); RegSet_Free(b);
}
else
{
u = trans_Ide(styctx,tok);
MAP_dfndom(ftoks,tok,u);
}
a = MAP_apply(RegSet_T,ftoks,(GLS_Tok)NULL);
if( a == (RegSet_T)NULL )
{
MAP_upddom(ftoks,(GLS_Tok)NULL,RegSet_Copy(u));
}
else
{
b = RegSet_Union(a,u);
MAP_upddom(ftoks,(GLS_Tok)NULL,b);
RegSet_Free(a);
}
}
}
else MAP_ovrdom(ftoks,tok,(RegSet_T)NULL);
if( ! styxQlxCat_tokC(c) && ! styxQlxCat_comC(c) )
PT_diag_err(c,parctx->diag,"invalid EOF or follow token category");
}
}
else PT_diag_err(e,parctx->diag,"malformed follow token");
}
static Scn_T trans_Dyck
(
Styx_T styctx, GLS_Tok id, RegSet_T left
)
{ Scn_T dyck; ScnDfn_T scndfn;
styxExp exp, pat, rgt; RegSet_T rpat, rrgt;
c_string sl = Str_printf("%sPrefix",GLS_Tok_string(id)),
sp = Str_printf("%sPattern",GLS_Tok_string(id)),
sr = Str_printf("%sSuffix",GLS_Tok_string(id));
scndfn = Scn_dfnBegin_reentrant(symbolToString(GLS_Tok_symbol(id)));
Scn_setMsgFun_reentrant(scndfn,PT_diag_msgFun(styctx->diag));
Scn_dfnToken_reentrant
(
scndfn,sl,(byte)( qlx_ica(styctx,id)?SCN_FLG_IgnoreCase:0 ),left
);
styxQlxDfn_defn(MAP_apply(styxQlxDfn,styctx->glo,id),_,_,_,_,_,&exp);
if( styxExp_quot(exp,&exp,_) )
/* noop */;
styxExp_dyck(exp,_,&pat,&rgt);
rrgt = trans_Exp(styctx,rgt);
Scn_dfnToken_reentrant
(
scndfn,sr,(byte)( qlx_ica(styctx,id)?SCN_FLG_IgnoreCase:0 ),rrgt
);
RegSet_Free(rrgt);
if( !styxExp_non(pat) )
{
rpat = trans_Exp(styctx,pat);
Scn_dfnToken_reentrant
(
scndfn,sp,(byte)( qlx_ica(styctx,id)?SCN_FLG_IgnoreCase:0 ),rpat
);
RegSet_Free(rpat);
}
FreeMem(sl); FreeMem(sp); FreeMem(sr);
dyck = Scn_dfnEnd_reentrant(scndfn,styctx->diagnose);
return dyck;
}
static Scn_T trans_QlxDfns(Styx_T styctx, styxSource s)
{ GLS_Tok id; ScnDfn_T scndfn;
PT_Itr it; MAPIT itr;
styctx->qlx = MAP_newMap(styctx->gloty);
styxSource_root(s,_,&id,_,_);
scndfn = Scn_dfnBegin_reentrant(symbolToString(GLS_Tok_symbol(id)));
Scn_setMsgFun_reentrant(scndfn,PT_diag_msgFun(styctx->diag));
PT_FORALL(it,s) if (PT_stateIT(it) == PT_PRAE)
{ PT_Term t = PT_termIT(it); styxQlxDfn d; styxQlxGrp gsrc, gdst;
if( styx_QlxDfn(t,&d) )
{ styxQlxOpt o;
if( styxQlxDfn_defn(d,_,&o,&gsrc,&id,&gdst,_) )
{
if( qlx_usage(styctx,d) == UsageTok ||
qlx_usage(styctx,d) == UsageIgn ||
qlx_usage(styctx,d) == UsageCom ||
qlx_usage(styctx,d) == UsageInd )
{ RegSet_T a = trans_Ide(styctx,id);
byte f = 0;
if( qlx_usage(styctx,d) == UsageInd )
f |= SCN_FLG_IndentToken;
if( !qlx_dyck(styctx,id) )
{ c_string tid = GLS_Tok_string(id);
if( qlx_pattern(styctx,id) )
{ styxExp exp; GLS_Tok tok;
styxQlxDfn_defn(MAP_apply(styxQlxDfn,styctx->glo,id),_,_,_,_,_,&exp);
if( styxExp_quot(exp,&exp,_) )
/* noop */;
if( styxExp_spat(exp,_,&tok,_) )
{ c_string pat = TRANS_ID_Cset(styctx,GLS_Tok_string(tok),tok,C_True,C_False),
pid = Str_printf("%s%s",tid,pat);
tid = symbolToString(stringToSymbol(pid));
FreeMem(pat); FreeMem(pid);
}
f |= SCN_FLG_PatternToken;
}
if( qlx_quotient(styctx,id) )
{ styxExp exp; c_string pat, pid;
styxQlxDfn_defn(MAP_apply(styxQlxDfn,styctx->glo,id),_,_,_,_,_,&exp);
pat = TRANS_ID_quotient(styctx,exp,C_True);
pid = Str_printf("%s%s",tid,pat);
tid = symbolToString(stringToSymbol(pid));
FreeMem(pat); FreeMem(pid);
}
Scn_dfnToken_reentrant
(
scndfn, tid,
(byte)( qlx_usage(styctx,d) == UsageIgn
? SCN_FLG_IgnoreToken
: f | ( styxQlxOpt_ignca(o) ? SCN_FLG_IgnoreCase : 0)
),
a
);
}
else
{ Scn_T dyck = trans_Dyck(styctx,id,a);
c_string tid = GLS_Tok_string(id);
if( qlx_quotient(styctx,id) )
{ styxExp exp; c_string pat, pid;
styxQlxDfn_defn(MAP_apply(styxQlxDfn,styctx->glo,id),_,_,_,_,_,&exp);
pat = TRANS_ID_quotient(styctx,exp,C_True);
pid = Str_printf("%s%s",tid,pat);
tid = symbolToString(stringToSymbol(pid));
FreeMem(pat); FreeMem(pid);
}
Scn_dfnDyckToken_reentrant
(
scndfn, tid,
(byte)( qlx_usage(styctx,d) == UsageIgn
? SCN_FLG_IgnoreToken
: f | ( styxQlxOpt_ignca(o) ? SCN_FLG_IgnoreCase : 0)
),
a, dyck
);
}
RegSet_Free(a);
}
}
}
}
styctx->Scn = Scn_dfnEnd_reentrant(scndfn,styctx->diagnose);
if( styctx->root == (Styx_T)NULL )
{
MAP_forItr(id,itr,styctx->qlx)
RegSet_Free(MAP_apply(RegSet_T,styctx->qlx,id));
MAP_freeMap(styctx->qlx); styctx->qlx = (MAP(_,_))NULL;
}
return styctx->Scn;
}
static void trans_QlxGroupDfns
(
Styx_T styctx, ScnDfn_T scndfn, symbol grpsym,
MAP(GLS_Tok,RegSet_T) ftoks,
MAP(GLS_Tok,symbol) patids
)
{ GLS_Tok id; MAPIT itr; RegSet_T a, u, d; symbol rng; byte f;
MAP_forItrAsg(id,rng,itr,styctx->grptok)
{
if( rng == grpsym ||
( MAP_defined(styctx->metagrp,rng) &&
HS_MBR_ELM(grpsym,MAP_apply(SET(symbol),styctx->metagrp,rng)) ) )
{ styxQlxDfn qd; styxQlxGrp gsrc, gdst; styxQlxOpt o; styxExp exp;
qd = MAP_apply(styxQlxDfn,styctx->glo,id);
if( styxQlxDfn_defn(qd,_,&o,&gsrc,&id,&gdst,&exp) )
{
if( qlx_usage(styctx,qd) == UsageTok ||
qlx_usage(styctx,qd) == UsageIgn ||
qlx_usage(styctx,qd) == UsageCom ||
qlx_usage(styctx,qd) == UsageInd )
{
a = trans_Ide(styctx,id);
u = ( ftoks == (MAP(_,_))NULL )
? (RegSet_T)NULL : MAP_apply(RegSet_T,ftoks,(GLS_Tok)NULL);
d = ( u == (RegSet_T)NULL ) ? a : RegSet_Difference(a,u);
f = 0;
if( qlx_usage(styctx,qd) == UsageInd )
f |= SCN_FLG_IndentToken;
if( MAP_defined(styctx->tokflg,id) )
f |= MAP_apply_small(byte,styctx->tokflg,id);
if( ftoks != (MAP(_,_))NULL && MAP_defined(ftoks,id) &&
MAP_apply(RegSet_T,ftoks,id) == (RegSet_T)NULL )
f |= SCN_FLG_EofToken;
if( !qlx_dyck(styctx,id) )
{ c_string tid = GLS_Tok_string(id);
if( qlx_pattern(styctx,id) )
{ GLS_Tok tok;
if( styxExp_quot(exp,&exp,_) )
/* noop */;
if( styxExp_spat(exp,_,&tok,_) )
{ c_string pat = TRANS_ID_Cset(styctx,GLS_Tok_string(tok),tok,C_True,C_False),
pid = Str_printf("%s%s",tid,pat);
symbol psy = stringToSymbol(pid);
tid = symbolToString(psy);
MAP_ovrdom(patids,id,psy);
FreeMem(pat); FreeMem(pid);
}
f |= SCN_FLG_PatternToken;
}
if( qlx_quotient(styctx,id) )
{ styxExp exp; c_string pat, pid; symbol psy;
styxQlxDfn_defn(qd,_,_,_,_,_,&exp);
pat = TRANS_ID_quotient(styctx,exp,C_True);
pid = Str_printf("%s%s",tid,pat);
psy = stringToSymbol(pid);
tid = symbolToString(psy);
MAP_ovrdom(patids,id,psy);
FreeMem(pat); FreeMem(pid);
}
Scn_dfnToken_reentrant
(
scndfn, tid,
(byte)( qlx_usage(styctx,qd) == UsageIgn
? SCN_FLG_IgnoreToken
: f | ( styxQlxOpt_ignca(o) ? SCN_FLG_IgnoreCase : 0)
),
d
);
}
else
{ Scn_T dyck = trans_Dyck(styctx,id,a);
c_string tid = GLS_Tok_string(id);
if( qlx_quotient(styctx,id) )
{ styxExp exp; c_string pat, pid; symbol psy;
styxQlxDfn_defn(qd,_,_,_,_,_,&exp);
pat = TRANS_ID_quotient(styctx,exp,C_True);
pid = Str_printf("%s%s",tid,pat);
psy = stringToSymbol(pid);
tid = symbolToString(psy);
MAP_ovrdom(patids,id,psy);
FreeMem(pat); FreeMem(pid);
}
Scn_dfnDyckToken_reentrant
(
scndfn, tid,
(byte)( qlx_usage(styctx,qd) == UsageIgn
? SCN_FLG_IgnoreToken
: f | ( styxQlxOpt_ignca(o) ? SCN_FLG_IgnoreCase : 0)
),
a, dyck
);
}
if( d != a ) RegSet_Free(d);
RegSet_Free(a);
}
}
}
}
if( ftoks != (MAP(_,_))NULL )
{
MAP_forItrAsg(id,a,itr,ftoks)
{
if( a != (RegSet_T)NULL )
{
f = SCN_FLG_EofToken | SCN_FLG_SwitchToken;
Scn_dfnToken_reentrant(scndfn, GLS_Tok_string(id),f,a);
}
}
}
}
static void trans_QlxGroups_prepare
(
Styx_T styctx, Styx_T parctx,
MAP(symbol,MAP(GLS_Tok,RegSet_T)) g_ftoks
)
{ Styx_T rootctx = RootCtx(styctx), lanctx;
MAPIT itr; symbol grpsym;
styxQlxDfn d; styxExp e;
MAP_forItrAsg(grpsym,lanctx,itr,rootctx->embed)
{
if( MAP_defined(styctx->grp,grpsym) )
{
d = MAP_apply(styxQlxDfn,styctx->grp,grpsym);
styxQlxDfn_defn(d,_,_,_,_,_,&e);
collectEofOrFollowTokens(styctx,parctx,grpsym,e,g_ftoks);
trans_QlxGroups_prepare(lanctx,parctx,g_ftoks);
}
}
}
static void trans_QlxGroups_aux
(
Styx_T styctx, Styx_T parctx, symbol elansym,
MAP(symbol,MAP(GLS_Tok,RegSet_T)) g_ftoks,
MAP(symbol,symbol) grpset,
MAP(GLS_Tok,symbol) patids
)
{ Styx_T rootctx = RootCtx(styctx), lanctx;
MAPIT itr, itr2; MAP(GLS_Tok,RegSet_T) ftoks;
ScnDfn_T scndfn; Scn_T scn; styxQlxDfn d; GLS_Tok id;
symbol rng, grpsym, lansym; c_string grpid, igrpid, sgrpid;
/* initialGroup */
ftoks = (MAP(_,_))NULL;
if( parctx == styctx )
igrpid = StrCopy(symbolToString(InitialGroup));
else
{
igrpid = Str_printf
(
"%s_%s",styctx->language,
symbolToString(elansym)+strlen(styctx->language)
);
lansym = stringToSymbol(styctx->language);
if( MAP_defined(g_ftoks,lansym) )
ftoks = MAP_apply(MAP(_,_),g_ftoks,lansym);
}
if( !MAP_defined(grpset,stringToSymbol(igrpid)) )
{
MAP_dfndom(grpset,stringToSymbol(igrpid),InitialGroup);
scndfn = Scn_dfnBegin_reentrant(igrpid);
Scn_setMsgFun_reentrant(scndfn,PT_diag_msgFun(parctx->diag));
trans_QlxGroupDfns(styctx,scndfn,InitialGroup,ftoks,patids);
MAP_forItrAsg(lansym,rng,itr,styctx->langrp)
{
if( rng == InitialGroup )
{
lanctx = MAP_apply(Styx_T,rootctx->embed,lansym);
Scn_dfnToken_reentrant
(
scndfn,symbolToString(lansym),SCN_FLG_CfgToken,(RegSet_T)NULL
);
}
}
scn = Scn_dfnEnd_reentrant(scndfn,parctx->diagnose);
ScnGrp_dfnScanner(parctx->Scn,scn);
}
/* other groups and embedded languages */
MAP_forItrAsg(grpsym,d,itr,styctx->grp)
{
if( !MAP_defined(rootctx->embed,grpsym) )
{
if( grpsym != InitialGroup &&
!MAP_defined(styctx->metagrp,grpsym) )
{
ftoks = (MAP(_,_))NULL;
if( parctx == styctx )
{
if( styxQlxDfn_tgrp(d,_) )
grpid = Str_printf("tok_%s",symbolToString(grpsym));
else
grpid = StrCopy(symbolToString(grpsym));
}
else
{
if( styxQlxDfn_tgrp(d,_) )
grpid = Str_printf
(
"%s__tok_%s",styctx->language,symbolToString(grpsym)
);
else
grpid = Str_printf
(
"%s__%s",styctx->language,symbolToString(grpsym)
);
lansym = stringToSymbol(styctx->language);
if( MAP_defined(g_ftoks,lansym) )
ftoks = MAP_apply(MAP(_,_),g_ftoks,lansym);
}
if( !MAP_defined(grpset,stringToSymbol(grpid)) )
{
MAP_dfndom(grpset,stringToSymbol(grpid),grpsym);
scndfn = Scn_dfnBegin_reentrant(grpid);
Scn_setMsgFun_reentrant(scndfn,PT_diag_msgFun(parctx->diag));
trans_QlxGroupDfns(styctx,scndfn,grpsym,ftoks,patids);
if( styxQlxDfn_igrp(d,_) )
trans_QlxGroupDfns(styctx,scndfn,InitialGroup,ftoks,patids);
MAP_forItrAsg(lansym,rng,itr2,styctx->langrp)
{
if( rng == grpsym )
{
lanctx = MAP_apply(Styx_T,rootctx->embed,lansym);
Scn_dfnToken_reentrant
(
scndfn,symbolToString(lansym),SCN_FLG_CfgToken,(RegSet_T)NULL
);
}
}
scn = Scn_dfnEnd_reentrant(scndfn,parctx->diagnose);
if( scn != (Scn_T)NULL )
ScnGrp_dfnScanner(parctx->Scn,scn);
}
FreeMem(grpid);
}
}
else
{
lanctx = MAP_apply(Styx_T,rootctx->embed,grpsym);
trans_QlxGroups_aux(lanctx, parctx, grpsym, g_ftoks, grpset, patids);
}
}
/* set token group switch information */
MAP_forItrAsg(id,rng,itr,styctx->tokgrp)
{
grpsym = MAP_apply(symbol,styctx->grptok,id);
if( MAP_defined(styctx->grp,grpsym) )
d = MAP_apply(styxQlxDfn,styctx->grp,grpsym);
else d = (styxQlxDfn)NULL;
if( grpsym == InitialGroup )
grpid = StrCopy(igrpid);
else
if( parctx == styctx )
{
if( d != (styxQlxDfn)NULL && styxQlxDfn_tgrp(d,_) )
grpid = Str_printf("tok_%s",symbolToString(grpsym));
else
grpid = StrCopy(symbolToString(grpsym));
}
else
{
if( d != (styxQlxDfn)NULL && styxQlxDfn_tgrp(d,_) )
grpid = Str_printf
(
"%s__tok_%s",styctx->language,symbolToString(grpsym)
);
else
grpid = Str_printf
(
"%s__%s",styctx->language,symbolToString(grpsym)
);
}
if( MAP_defined(styctx->grp,rng) )
d = MAP_apply(styxQlxDfn,styctx->grp,rng);
if( rng == InitialGroup )
sgrpid = StrCopy(igrpid);
else
if( MAP_defined(rootctx->embed,rng) )
{
lanctx = MAP_apply(Styx_T,rootctx->embed,rng);
sgrpid = Str_printf
(
"%s_%s",lanctx->language,
symbolToString(rng)+strlen(lanctx->language)
);
}
else
if( parctx == styctx )
{
if( d != (styxQlxDfn)NULL && styxQlxDfn_tgrp(d,_) )
sgrpid = Str_printf("tok_%s",symbolToString(rng));
else
sgrpid = StrCopy(symbolToString(rng));
}
else
{
if( d != (styxQlxDfn)NULL && styxQlxDfn_tgrp(d,_) )
sgrpid = Str_printf
(
"%s__tok_%s",styctx->language,symbolToString(rng)
);
else
sgrpid = Str_printf
(
"%s__%s",styctx->language,symbolToString(rng)
);
}
if( !MAP_defined(styctx->metagrp,grpsym) )
{
if( MAP_defined(patids,id) )
{ symbol psy = MAP_apply(symbol,patids,id);
ScnGrp_dfnSwitch(parctx->Scn, grpid, symbolToString(psy), sgrpid);
}
else
ScnGrp_dfnSwitch(parctx->Scn, grpid, GLS_Tok_string(id), sgrpid);
}
else
{ SET(symbol) grpset = MAP_apply(SET(symbol),styctx->metagrp,grpsym);
HS_Itr it; symbol elm;
HS_FORALL(elm,it,grpset)
{
if( MAP_defined(patids,id) )
{ symbol psy = MAP_apply(symbol,patids,id);
ScnGrp_dfnSwitch
(
parctx->Scn, symbolToString(elm), symbolToString(psy), sgrpid
);
}
else
ScnGrp_dfnSwitch
(
parctx->Scn, symbolToString(elm), GLS_Tok_string(id), sgrpid
);
}
}
FreeMem(grpid); FreeMem(sgrpid);
}
FreeMem(igrpid);
}
static Scn_T trans_QlxGroups(Styx_T styctx)
{ MAP(symbol,MAP(GLS_Tok,byte)) g_ftoks;
MAP(GLS_Tok,RegSet_T) ftoks;
MAP(GLS_Tok,symbol) patids;
MAP(symbol,symbol) grpset;
MAPIT itr1, itr2; RegSet_T reg;
GLS_Tok tok; symbol lansym; int rc;
styctx->qlx = MAP_newMap(styctx->gloty);
g_ftoks = MAP_newPrimMap();
grpset = MAP_newPrimMap();
patids = MAP_newPrimMap();
trans_QlxGroups_prepare(styctx,styctx,g_ftoks);
if( PT_diag_errorCnt(styctx->diag) == 0 )
{
styctx->Scn = ScnGrp_dfnBegin(styctx->language);
trans_QlxGroups_aux(styctx,styctx,(symbol)NULL,g_ftoks,grpset,patids);
rc = ScnGrp_dfnEnd(styctx->Scn);
if( rc != 0 )
PT_diag_warn(styctx->PTree,styctx->diag,"%d unreachable groups",rc);
}
MAP_forItrAsg(lansym,ftoks,itr1,g_ftoks)
{
MAP_forItrAsg(tok,reg,itr2,ftoks)
{
if( reg != (RegSet_T)NULL )
RegSet_Free(reg);
}
MAP_freeMap(ftoks);
}
MAP_freeMap(g_ftoks);
MAP_freeMap(grpset);
MAP_freeMap(patids);
if( styctx->root == (Styx_T)NULL )
{
MAP_forItr(tok,itr1,styctx->qlx)
RegSet_Free(MAP_apply(RegSet_T,styctx->qlx,tok));
MAP_freeMap(styctx->qlx); styctx->qlx = (MAP(_,_))NULL;
}
return styctx->Scn;
}
/* checking keywords */
static void Pass3_checkMbrSeq(Styx_T styctx, GLS_Tok seq, GLS_Lst(styxQlxDfn) qlxdfns)
/* check wether production or conflict keyword 'seq' is well defined */
{
c_bool u; int t; StdCPtr s = TRANS_Seq(seq,&u);
/*FIXME: comments are not allowed, too*/
if( Scn_groups(styctx->Scn) == 0 )
{
if( (!u && !(t=Scn_check_Token(styctx->Scn,(string)s))) ||
(u && !(t=Scn_check_WCToken(styctx->Scn,(wc_string)s))) )
PT_diag_err(seq,styctx->diag,"malformed token");
else
if( MAP_count(styctx->indtokkeys) < 3 &&
( Scn_tokFlags(styctx->Scn,t) & SCN_FLG_IndentToken ) )
MAP_ovrdom(styctx->indtokkeys,GLS_Tok_symbol(seq),NULL);
}
else
{
if( (!u && !(t=Scn_check_GroupToken(styctx->Scn,(string)s))) ||
(u && !(t=Scn_check_GroupWCToken(styctx->Scn,(wc_string)s))) )
PT_diag_err(seq,styctx->diag,"malformed token");
else
{ Scn_T grpscn = Scn_group(styctx->Scn,I32_HIGHVAL(t));
if( MAP_count(styctx->indtokkeys) < 3 &&
( Scn_tokFlags(grpscn,I32_LOWVAL(t)) &
SCN_FLG_IndentToken ) )
MAP_ovrdom(styctx->indtokkeys,GLS_Tok_symbol(seq),NULL);
}
}
FreeMem(s);
}
static void Pass3_checkMbr(Styx_T styctx, styxMbr m, GLS_Lst(styxQlxDfn) qlxdfns)
/* check production member 'm' (Pass3) */
{ GLS_Tok seq;
if ( styxMbr_tkm(m,&seq) )
{
Pass3_checkMbrSeq(styctx,seq,qlxdfns);
}
else
{ styxMbr em;
GLS_Lst(GLS_Tok) glst1;
GLS_Lst(GLS_Tok) glst2;
GLS_Lst(GLS_Tok) glst3;
GLS_Lst(GLS_Tok) itr;
if( styxMbr_klst0(m,&glst1,&em,&glst2,&glst3) ||
styxMbr_klst1(m,&glst1,&em,&glst2,&glst3) )
{
GLS_FORALL(itr,glst1)
{
seq = GLS_FIRST(GLS_Tok,itr);
Pass3_checkMbrSeq(styctx,seq,qlxdfns);
}
GLS_FORALL(itr,glst2)
{
seq = GLS_FIRST(GLS_Tok,itr);
Pass3_checkMbrSeq(styctx,seq,qlxdfns);
}
GLS_FORALL(itr,glst3)
{
seq = GLS_FIRST(GLS_Tok,itr);
Pass3_checkMbrSeq(styctx,seq,qlxdfns);
}
Pass3_checkMbr(styctx,em,qlxdfns);
}
else
if( styxMbr_opt(m,&glst1,&em,&glst2) )
{
GLS_FORALL(itr,glst1)
{
seq = GLS_FIRST(GLS_Tok,itr);
Pass3_checkMbrSeq(styctx,seq,qlxdfns);
}
GLS_FORALL(itr,glst2)
{
seq = GLS_FIRST(GLS_Tok,itr);
Pass3_checkMbrSeq(styctx,seq,qlxdfns);
}
Pass3_checkMbr(styctx,em,qlxdfns);
}
}
}
static void Pass3_checkConflict
(
Styx_T styctx, styxConflict conflict,
GLS_Lst(styxQlxDfn) qlxdfns
)
/* check wether conflict token, state and rules refer to defined
token, nonterminals and productions.
*/
{ styxState state; styxToken token;
if( styxConflict_defn(conflict,&state,&token,_) )
{ GLS_Tok seq;
if( styxState_seq(state,&seq) )
{
Pass3_checkMbrSeq(styctx,seq,qlxdfns);
}
if( styxToken_seq(token,&seq) )
{
Pass3_checkMbrSeq(styctx,seq,qlxdfns);
}
}
}
static void Pass3(Styx_T styctx, styxSource src)
/* keywords */
{ PT_Itr it; GLS_Lst(styxQlxDfn) qlxdfns;
styxSource_root(src,_,_,&qlxdfns,_);
if( !GLS_EMPTY(qlxdfns) )
{
PT_FORALL(it,src)
{
if (PT_stateIT(it) == PT_POST) /* all reserved words */
{ PT_Term trm = PT_termIT(it);
styxMbr m; styxConflict cr;
if( styx_Mbr(trm,&m) )
{
Pass3_checkMbr(styctx,m,qlxdfns);
}
else
if( styx_Conflict(trm,&cr) )
{
Pass3_checkConflict(styctx,cr,qlxdfns);
}
}
}
if( MAP_count(styctx->indtokkeys) >= 3 )
PT_diag_err(qlxdfns,styctx->diag,"too many (de)indent token keywords");
}
}
/* Parser Translation */
static string normalKeyword
(
Styx_T styctx, GLS_Tok seq, c_bool extkey, c_bool* ucs4
)
/* normalizes keywords (IgnoreCase) */
{ StdCPtr s = TRANS_Seq(seq,ucs4); long tid; Scn_T grpscn;
if( extkey == C_True )
{
if( *ucs4 == C_False )
return (string)s;
else
{ string mbkey;
bug0((mbkey = GS_ucs4_to_utf8((wc_string)s))!=(string)NULL,"");
FreeMem(s);
return mbkey;
}
}
else
if( *ucs4 == C_False )
{
if( Scn_groups(styctx->Scn) == 0 )
{
tid = Scn_check_Token(styctx->Scn,(string)s);
bug1(tid,"token '%s' does not belong to grammar\n",(string)s);
if( Scn_tokFlags(styctx->Scn,(short)tid) & SCN_FLG_IgnoreCase )
StrToLower((string)s);
}
else
{
tid = Scn_check_GroupToken(styctx->Scn,(string)s);
bug1(tid,"token '%s' does not belong to grammar\n",(string)s);
grpscn = Scn_group(styctx->Scn,I32_HIGHVAL(tid));
if( Scn_tokFlags(grpscn,I32_LOWVAL(tid)) & SCN_FLG_IgnoreCase )
StrToLower((string)s);
}
return (string)s;
}
else
{ string mbkey, tmp;
if( Scn_groups(styctx->Scn) == 0 )
tid = Scn_check_WCToken(styctx->Scn,(wc_string)s);
else
tid = Scn_check_GroupWCToken(styctx->Scn,(wc_string)s);
if( !tid )
{ Sink snk = Sink_open();
mbkey = GS_ucs4_to_utf8((wc_string)s);
Sink_puts(snk,"token '");
if( mbkey != (string)NULL ) Sink_puts_raw(styctx->Scn,mbkey);
Sink_puts(snk,"' does not belong to grammar\n");
tmp = Sink_close(snk);
FreeMem(s); FreeMem(mbkey);
bug1(False,"%s",tmp);
}
else
{
if( Scn_groups(styctx->Scn) == 0 )
{
if( Scn_tokFlags(styctx->Scn,(short)tid) & SCN_FLG_IgnoreCase )
WCStrToLower((wc_string)s);
}
else
{
grpscn = Scn_group(styctx->Scn,I32_HIGHVAL(tid));
if( Scn_tokFlags(grpscn,I32_LOWVAL(tid)) & SCN_FLG_IgnoreCase )
WCStrToLower((wc_string)s);
}
bug0((mbkey = GS_ucs4_to_utf8((wc_string)s))!=(string)NULL,"");
FreeMem(s);
}
return mbkey;
}
}
static void trans_Dfns_addMbrNTK_Seq
(
Styx_T styctx, PLR_Cfg Cfg,
GLS_Tok seq, GLS_Lst(styxQlxDfn) qlxdfns,
MAP(symbol,NULL) key
)
{
c_bool ucs4;
string s = normalKeyword(styctx,seq,GLS_EMPTY(qlxdfns),&ucs4);
symbol keyword = stringToSymbol(s);
FreeMem(s);
if( ! MAP_defined(key,keyword) )
{
MAP_dfndom(key,keyword,NULL);
PLR_addTK(Cfg,symbolToString(keyword),(ucs4?PLR_TYP_WKY:PLR_TYP_KEY));
}
}
static void trans_Dfns_addMbrNTK_Ide
(
Styx_T styctx, PLR_Cfg Cfg,
GLS_Tok id, GLS_Lst(styxQlxDfn) qlxdfns,
MAP(symbol,NULL) exttok
)
{ Styx_T rootctx = RootCtx(styctx);
if( GLS_EMPTY(qlxdfns) )
{
if (!MAP_defined(styctx->glo,id) &&
!MAP_defined(rootctx->embed,GLS_Tok_symbol(id)))
{
if( ! MAP_defined(exttok,GLS_Tok_symbol(id)) )
{
MAP_dfndom(exttok,GLS_Tok_symbol(id),NULL);
PLR_addTK(Cfg,GLS_Tok_string(id),PLR_TYP_TOK);
}
}
}
}
static void trans_Dfns_addMbrNTK
(
Styx_T styctx, PLR_Cfg Cfg,
styxMbr m, c_bool* tkother, GLS_Lst(styxQlxDfn) qlxdfns,
MAP(symbol,NULL) key, MAP(symbol,NULL) exttok
)
{ Styx_T rootctx = RootCtx(styctx);
GLS_Tok id, seq;
if( styxMbr_tkm(m,&seq) )
{
trans_Dfns_addMbrNTK_Seq(styctx,Cfg,seq,qlxdfns,key);
}
else
if( styxMbr_else(m) )
{
*tkother = C_True;
}
else
if( styxMbr_ntm(m,&id) )
{
trans_Dfns_addMbrNTK_Ide(styctx,Cfg,id,qlxdfns,exttok);
}
else
if( !MAP_defined(styctx->ebnfmbr,m) ) //20110122 neue Bedingung: Bugfix gleicher EBNF-Member-Term
{ styxMbr em;
GLS_Lst(GLS_Tok) glst1;
GLS_Lst(GLS_Tok) glst2;
GLS_Lst(GLS_Tok) glst3;
GLS_Lst(GLS_Tok) itr;
char buf[80+1];
if( styxMbr_klst0(m,&glst1,&em,&glst2,&glst3) ||
styxMbr_klst1(m,&glst1,&em,&glst2,&glst3) )
{ symbol s = (symbol)NULL;
sprintf(buf,"_List%d",++rootctx->ebnfcnt);
PLR_addNT(Cfg,buf,C_False);
s = stringToSymbol(buf);
sprintf(buf,"%s_0",symbolToString(s));
PLR_addNT(Cfg,buf,C_False);
MAP_dfndom(styctx->ebnfmbr,m,s);
GLS_FORALL(itr,glst1)
{
seq = GLS_FIRST(GLS_Tok,itr);
trans_Dfns_addMbrNTK_Seq(styctx,Cfg,seq,qlxdfns,key);
}
GLS_FORALL(itr,glst2)
{
seq = GLS_FIRST(GLS_Tok,itr);
trans_Dfns_addMbrNTK_Seq(styctx,Cfg,seq,qlxdfns,key);
}
GLS_FORALL(itr,glst3)
{
seq = GLS_FIRST(GLS_Tok,itr);
trans_Dfns_addMbrNTK_Seq(styctx,Cfg,seq,qlxdfns,key);
}
/*trans_Dfns_addMbrNTK(styctx,Cfg,em,tkother,qlxdfns,key,exttok);*/
}
else
if( styxMbr_opt(m,&glst1,&em,&glst2) )
{ symbol s = (symbol)NULL;
sprintf(buf,"_Opt%d",++rootctx->ebnfcnt);
PLR_addNT(Cfg,buf,C_False);
s = stringToSymbol(buf);
MAP_dfndom(styctx->ebnfmbr,m,s);
GLS_FORALL(itr,glst1)
{
seq = GLS_FIRST(GLS_Tok,itr);
trans_Dfns_addMbrNTK_Seq(styctx,Cfg,seq,qlxdfns,key);
}
GLS_FORALL(itr,glst2)
{
seq = GLS_FIRST(GLS_Tok,itr);
trans_Dfns_addMbrNTK_Seq(styctx,Cfg,seq,qlxdfns,key);
}
/*trans_Dfns_addMbrNTK(styctx,Cfg,em,tkother,qlxdfns,key,exttok);*/
}
}
}
static void trans_Dfns_addConflict
(
Styx_T styctx, PLR_Cfg Cfg,
styxConflict conflict, GLS_Lst(styxQlxDfn) qlxdfns,
MAP(symbol,NULL) key, MAP(symbol,NULL) exttok
)
{ styxState state; styxToken token; GLS_Lst(styxRule) rules, itr;
if( styxConflict_defn(conflict,&state,&token,&rules) )
{ GLS_Tok seq, id1, id2, nat;
string s; symbol statesym = NULL, tokensym = NULL;
int idx = -1; c_bool ucs4;
if( styxState_seq(state,&seq) )
{
s = normalKeyword(styctx,seq,GLS_EMPTY(qlxdfns),&ucs4);
statesym = stringToSymbol(s);
FreeMem(s);
if( !MAP_defined(key,statesym) )
{
PT_diag_err(seq,styctx->diag,"unknown state symbol");
return;
}
}
else
if( styxState_ide(state,&id1) )
{
statesym = GLS_Tok_symbol(id1);
if( GLS_EMPTY(qlxdfns) && !MAP_defined(exttok,statesym) )
{
PT_diag_err(id1,styctx->diag,"unknown state symbol");
return;
}
}
else
if( styxState_nat(state,&nat) )
{
idx = atoi(GLS_Tok_string(nat));
}
if( styxToken_seq(token,&seq) )
{
s = normalKeyword(styctx,seq,GLS_EMPTY(qlxdfns),&ucs4);
tokensym = stringToSymbol(s);
FreeMem(s);
if( !MAP_defined(key,tokensym) )
{
PT_diag_err(seq,styctx->diag,"unknown token symbol");
return;
}
}
else
if( styxToken_ide(token,&id1) )
{
tokensym = GLS_Tok_symbol(id1);
if( GLS_EMPTY(qlxdfns) && !MAP_defined(exttok,tokensym) )
{
PT_diag_err(id1,styctx->diag,"unknown token symbol");
return;
}
}
if( tokensym == NULL )
{
PT_diag_err(token,styctx->diag,"unknown token symbol");
return;
}
if( statesym == NULL && idx == -1 )
{
PT_diag_err(token,styctx->diag,"undefined conflict state");
return;
}
PLR_addCCtx(Cfg,idx,statesym==NULL?NULL:symbolToString(statesym),symbolToString(tokensym));
GLS_FORALL(itr,rules)
{
styxRule rule = GLS_FIRST(styxRule,itr);
if( styxRule_red(rule,&id1,&id2) )
{
PLR_addCRule(Cfg,GLS_Tok_string(id1),GLS_Tok_string(id2));
}
}
}
}
static void trans_Dfns_addMbr_Seq
(
Styx_T styctx, PLR_Cfg Cfg,
GLS_Tok seq, GLS_Lst(styxQlxDfn) qlxdfns
)
{
c_bool ucs4;
long r = PT_row(seq);
long c = PT_col(seq);
string s = normalKeyword(styctx,seq,GLS_EMPTY(qlxdfns),&ucs4);
PLR_addPK(Cfg,s,r,c);
FreeMem(s);
}
static c_bool trans_Dfns_addMbr
(
Styx_T styctx, PLR_Cfg Cfg,
styxMbr m, GLS_Lst(styxQlxDfn) qlxdfns
)
{
long r = PT_row(m), c = PT_col(m);
GLS_Tok id, did, seq;
if( styxMbr_tkm(m,&seq) )
{
trans_Dfns_addMbr_Seq(styctx,Cfg,seq,qlxdfns);
return C_True;
}
else
if( styxMbr_ntm(m,&id) )
{ PT_Term t = getDfn(styctx,id,!GLS_EMPTY(qlxdfns));
r = PT_row(id);
c = PT_col(id);
if( t == (PT_Term)NULL || styx_QlxDfn(t,_) )
{
PLR_addPT(Cfg,GLS_Tok_string(id),r,c);
HS_SET_ELM(GLS_Tok_symbol(id),styctx->tkset);
}
else
if( styx_Dfn(t,_) )
PLR_addPN(Cfg,GLS_Tok_string(id),r,c);
return C_True;
}
else
if( styxMbr_dtok(m,&id,&did) )
{
r = PT_row(id);
c = PT_col(id);
PLR_addPD(Cfg,GLS_Tok_string(id),GLS_Tok_string(did),r,c);
HS_SET_ELM(GLS_Tok_symbol(id),styctx->tkset);
return C_True;
}
else
if( styxMbr_else(m) )
{
PLR_addPT(Cfg,PLR_TOK_Other,r,c);
HS_SET_ELM(stringToSymbol(PLR_TOK_Other),styctx->tkset);
return C_True;
}
return C_False;
}
static c_bool trans_Dfns_addEBNFMbr
(
Styx_T styctx, PLR_Cfg Cfg,
styxMbr m, GLS_Lst(styxQlxDfn) qlxdfns
)
{
c_bool stdmbr = trans_Dfns_addMbr(styctx,Cfg,m,qlxdfns);
if( !stdmbr && MAP_defined(styctx->ebnfmbr,m) )
{ long r = PT_row(m), c = PT_col(m);
c_string ebnfmbrid = symbolToString(MAP_apply(symbol,styctx->ebnfmbr,m));
PLR_addPN(Cfg,ebnfmbrid,r,c);
}
return stdmbr;
}
static void trans_Dfns_addEBNFPrd
(
Styx_T styctx, PLR_Cfg Cfg,
styxMbr m, GLS_Lst(styxQlxDfn) qlxdfns
)
{ long r = PT_row(m), c = PT_col(m);
c_string ebnfid = symbolToString(MAP_apply(symbol,styctx->ebnfmbr,m));
GLS_Lst(GLS_Tok) glst1;
GLS_Lst(GLS_Tok) glst2;
GLS_Lst(GLS_Tok) glst3;
GLS_Lst(GLS_Tok) itr;
GLS_Tok seq; styxMbr em; char buf[80+1];
if( styxMbr_klst0(m,&glst1,&em,&glst2,&glst3) ||
styxMbr_klst1(m,&glst1,&em,&glst2,&glst3) )
{
sprintf(buf,"%s_0",ebnfid);
if( styxMbr_klst0(m,_,_,_,_) )
{
PLR_addPR(Cfg,"nil", PLR_PRD_DFT,ebnfid);
}
PLR_addPR(Cfg,"cons", PLR_PRD_DFT,ebnfid);
GLS_FORALL(itr,glst1)
{
seq = GLS_FIRST(GLS_Tok,itr);
trans_Dfns_addMbr_Seq(styctx,Cfg,seq,qlxdfns);
}
trans_Dfns_addEBNFMbr(styctx,Cfg,em,qlxdfns);
PLR_addPN(Cfg,buf,r,c);
GLS_FORALL(itr,glst3)
{
seq = GLS_FIRST(GLS_Tok,itr);
trans_Dfns_addMbr_Seq(styctx,Cfg,seq,qlxdfns);
}
PLR_addPR(Cfg,"nil", PLR_PRD_DFT,buf);
PLR_addPR(Cfg,"cons", PLR_PRD_DFT,buf);
GLS_FORALL(itr,glst2)
{
seq = GLS_FIRST(GLS_Tok,itr);
trans_Dfns_addMbr_Seq(styctx,Cfg,seq,qlxdfns);
}
trans_Dfns_addEBNFMbr(styctx,Cfg,em,qlxdfns);
PLR_addPN(Cfg,buf,r,c);
}
else
if( styxMbr_opt(m,&glst1,&em,&glst2) )
{
PLR_addPR(Cfg,"none", PLR_PRD_DFT,ebnfid);
PLR_addPR(Cfg,"some", PLR_PRD_DFT,ebnfid);
GLS_FORALL(itr,glst1)
{
seq = GLS_FIRST(GLS_Tok,itr);
trans_Dfns_addMbr_Seq(styctx,Cfg,seq,qlxdfns);
}
trans_Dfns_addEBNFMbr(styctx,Cfg,em,qlxdfns);
GLS_FORALL(itr,glst2)
{
seq = GLS_FIRST(GLS_Tok,itr);
trans_Dfns_addMbr_Seq(styctx,Cfg,seq,qlxdfns);
}
}
}
static PLR_Cfg trans_Dfns(Styx_T styctx, styxSource src)
{
MAPTY keyty; MAP(symbol,NULL) key, exttok; /* reserved words */
PLR_Cfg Cfg; MAPIT itr; PT_Itr it;
GLS_Lst(styxQlxDfn) qlxdfns;
GLS_Lst(styxDfn) dfns, dfnitr;
GLS_Lst(styxConflict) conflicts, critr;
styxOptCfg optcfg; styxDfn pd; styxMbr m;
GLS_Tok id, nt, elan;
c_bool tkother = C_False;
styxSource_root(src,_,&id,&qlxdfns,&optcfg);
styxOptCfg_cfg(optcfg,&dfns,&conflicts);
Cfg = PLR_createCfg(symbolToString(GLS_Tok_symbol(id)),styctx->version);
keyty = MAP_newTyp(primCopy,primFree,primEqual,primHash,primCopy,primFree);
key = MAP_newMap(keyty);
exttok = MAP_newMap(keyty);
PT_FORALL(it,src) if( PT_stateIT(it) == PT_PRAE )
{ PT_Term t = PT_termIT(it); styxQlxDfn qd;
if( styx_QlxDfn(t,&qd) ) /* Token */
{ styxQlxGrp gsrc, gdst;
if( styxQlxDfn_defn(qd,_,_,&gsrc,&id,&gdst,_) &&
( qlx_usage(styctx,qd) == UsageTok ||
qlx_usage(styctx,qd) == UsageCom ||
qlx_usage(styctx,qd) == UsageLan ||
qlx_usage(styctx,qd) == UsageInd ) )
{
if( qlx_usage(styctx,qd) != UsageLan )
PLR_addTK(Cfg,GLS_Tok_string(id),PLR_TYP_TOK);
else
{ c_string lantok;
assert0( styxQlxGrp_grp(gsrc,&elan), "");
lantok = Str_printf("%s%s",GLS_Tok_string(elan),GLS_Tok_string(id));
PLR_addTK(Cfg,lantok,PLR_TYP_CFG);
FreeMem(lantok);
}
}
else
if( styxQlxDfn_defd(qd,&id) )
{ int flg = 0;
if( MAP_defined(styctx->dyntok,GLS_Tok_symbol(id)) )
flg = MAP_apply(int,styctx->dyntok,GLS_Tok_symbol(id));
if( (flg&1) == 0 || (flg&2) == 0 )
{
PT_diag_warn
(
id,styctx->diag,"%s dynamic token %s",
GLS_Tok_string(id),
(flg&2)==0 ? "unused" : "unintroduced"
);
}
PLR_addTK(Cfg,GLS_Tok_string(id),PLR_TYP_TOK);
}
}
else
if( styx_Dfn(t,&pd) ) /* Nonterminal */
{ styxDfnOpt o;
if( styxDfn_defn(pd,_,&o,&id,_) )
PLR_addNT(Cfg,GLS_Tok_string(id),styxDfnOpt_errnt(o));
}
else
if( styx_Mbr(t,&m) ) /* Keyword, external Token, EBNF Nonterminal */
{
trans_Dfns_addMbrNTK(styctx,Cfg,m,&tkother,qlxdfns,key,exttok);
}
}
if( tkother )
{
PLR_addTK(Cfg,PLR_TOK_Other,PLR_TYP_TOK);
}
/*
MAP_freeMap( key );
MAP_freeMap( exttok );
MAP_freeTyp( keyty );
*/
PLR_endSD(Cfg); /* Sorting Token & Nonterminals */
MAP_forItr(id,itr,styctx->glo)
{ styxQlxDfn qd;
if( styx_QlxDfn(MAP_apply(PT_Term,styctx->glo,id),&qd) &&
styxQlxDfn_defn(qd,_,_,_,_,_,_) &&
qlx_usage(styctx,id) == UsageCom ) /* Special Token */
PLR_addST(Cfg,GLS_Tok_string(id));
}
GLS_FORALL(dfnitr,dfns)
{ styxCat c; GLS_Lst(styxPrd) prds, prditr;
pd = GLS_FIRST(styxDfn,dfnitr);
if( styxDfn_defn(pd,&c,_,&nt,&prds) )
{
if( styxCat_bgnC(c) ) /* Startsymbol */
PLR_addSN(Cfg,GLS_Tok_string(nt));
GLS_FORALL(prditr,prds)
{ styxPrd p = GLS_FIRST(styxPrd,prditr);
GLS_Lst(styxMbr) mbrs, mbritr;
styxLay lay; GLS_Tok pid;
if( styxPrd_prod(p,&lay,&pid,&mbrs) ) /* Production */
{
if( styxLay_dft(lay) )
PLR_addPR
(
Cfg,GLS_Tok_string(pid), PLR_PRD_DFT,GLS_Tok_string(nt)
);
else
if( styxLay_rec(lay) )
PLR_addPR
(
Cfg,GLS_Tok_string(pid), PLR_PRD_REC,GLS_Tok_string(nt)
);
else
if( styxLay_grp(lay) )
PLR_addPR
(
Cfg,GLS_Tok_string(pid), PLR_PRD_GRP,GLS_Tok_string(nt)
);
GLS_FORALL(mbritr,mbrs)
{ m = GLS_FIRST(styxMbr,mbritr); /* Production Symbol */
trans_Dfns_addEBNFMbr(styctx,Cfg,m,qlxdfns);
}
}
}
}
}
/* EBNF Productions */
{ styxMbr ep = (styxMbr)NULL;
MAP_forItr(ep,itr,styctx->ebnfmbr)
{
trans_Dfns_addEBNFPrd(styctx,Cfg,ep,qlxdfns);
}
}
/* Conflict rules */
GLS_FORALL(critr,conflicts)
{ styxConflict conflict = GLS_FIRST(styxConflict,critr);
trans_Dfns_addConflict
(
styctx, Cfg, conflict, qlxdfns, key, exttok
);
}
MAP_freeMap( key );
MAP_freeMap( exttok );
MAP_freeTyp( keyty );
return Cfg;
}
static void STYX_compile_free(Styx_T styctx, int rc)
{
if( styctx->qlx != (MAP(_,_))NULL )
{ MAPIT itr; RegSet_T rng; symbol dom;
MAP_forItrAsg(dom,rng,itr,styctx->qlx)
RegSet_Free(rng);
MAP_freeMap(styctx->qlx); styctx->qlx = (MAP(_,_))NULL;
}
if( styctx->glo != (MAP(_,_))NULL )
{
MAP_freeMap(styctx->glo); styctx->glo = (MAP(_,_))NULL;
}
if( styctx->grp != (MAP(_,_))NULL )
{
MAP_freeMap(styctx->grp); styctx->grp = (MAP(_,_))NULL;
}
if( styctx->grptok != (MAP(_,_))NULL )
{
MAP_freeMap(styctx->grptok); styctx->grptok = (MAP(_,_))NULL;
}
if( styctx->dyntok != (MAP(_,_))NULL )
{
MAP_freeMap(styctx->dyntok); styctx->dyntok = (MAP(_,_))NULL;
}
if( styctx->langrp != (MAP(_,_))NULL )
{
MAP_freeMap(styctx->langrp); styctx->langrp = (MAP(_,_))NULL;
}
if( styctx->tokgrp != (MAP(_,_))NULL )
{
MAP_freeMap(styctx->tokgrp); styctx->tokgrp = (MAP(_,_))NULL;
}
if( styctx->ebnfmbr != (MAP(_,_))NULL )
{
MAP_freeMap(styctx->ebnfmbr); styctx->ebnfmbr = (MAP(_,_))NULL;
}
if( styctx->tokflg != (MAP(_,_))NULL )
{
MAP_freeMap(styctx->tokflg); styctx->tokflg = (MAP(_,_))NULL;
}
if( rc != 0 && styctx->tkset != (HS_Set)NULL )
{
HS_DROP_SET(styctx->tkset); styctx->tkset = (HS_Set)NULL;
}
if( styctx->indtokkeys != (MAP(symbol,_))NULL )
{
MAP_freeMap(styctx->indtokkeys); styctx->indtokkeys = (MAP(symbol,_))NULL;
}
if( styctx->gloty != (MAPTY)NULL )
{
MAP_freeTyp(styctx->gloty); styctx->gloty = (MAPTY)NULL;
}
}
static int STYX_compile(Styx_T styctx, Scn_Stream cStream, c_string incpath)
{ PLR_Cfg Cfg; PT_Cfg PCfg;
MAP(long,symbol) pPreParMap; SPP_T pPP;
styxSource s; styxOptCfg optcfg; GLS_Lst(styxDfn) dfns;
GLS_Lst(styxQlxDfn) qlxdfns; GLS_Tok id;
void (*prMsg)(c_string msg) = PT_diag_msgFun(styctx->diag);
MAPIT itr; Styx_T rng; symbol dom;
long indcnt = 0; int rc = 0, tblcnt = 2;
if (styctx->verbose) (*prMsg)("parsing ...\n");
STYX_reset(styctx);
styctx->incpath = stringToSymbol(incpath);
pPreParMap = MAP_newPrimMap();
MAP_dfndom(pPreParMap,SPP_INC_PATH,styctx->incpath);
pPP = SPP_init_reentrant(pPreParMap);
Stream_premac_set(cStream, SPP_premac);
Stream_add_ctxval(cStream,SPP_premac,pPP);
PCfg = PT_init(styctx->styapp->PTab,cStream);
styctx->PTree = (styx)PT_PARSE(PCfg,"Source");
PT_diag_setErrorCnt(styctx->diag,PT_synErrorCnt(PCfg));
PT_quit(PCfg);
SPP_quit_reentrant(pPP);
MAP_freeMap(pPreParMap);
if (styctx->verbose) (*prMsg)("done parsing\n");
if( (styctx->errorCnt=PT_diag_errorCnt(styctx->diag)) == 0 )
{ styxOptNat optnat; GLS_Tok nat;
styx_Start_0(styctx->PTree,&s);
styxSource_root(s,&optnat,&id,&qlxdfns,&optcfg);
if( strcmp(GLS_Tok_string(id),styctx->language) != 0 )
{
PT_diag_err
(
id,styctx->diag,"language identifier und file name are different"
);
}
if( styxOptNat_nat(optnat,&nat) )
{
styctx->version = atoi(GLS_Tok_string(nat));
if( styctx->version > 1 )
{
PT_diag_warn
(
nat,styctx->diag,"unknown styx version"
);
}
}
styctx->gloty = MAP_newTyp
(
primCopy,primFree,PT_equal,PT_hash,
primCopy,primFree
);
styctx->glo = MAP_newMap(styctx->gloty);
styctx->tkset = HS_CREATE_ADTSET(symbol);
styctx->indtokkeys = MAP_newPrimMap();
styctx->grp = MAP_newPrimMap();
styctx->grptok = MAP_newMap(styctx->gloty);
styctx->dyntok = MAP_newPrimMap();
styctx->langrp = MAP_newPrimMap();
styctx->tokgrp = MAP_newMap(styctx->gloty);
styctx->ebnfmbr = MAP_newMap(styctx->gloty);
styctx->metagrp = MAP_newPrimMap();
styctx->tokflg = MAP_newMap(styctx->gloty);
if( styctx->root == (Styx_T)NULL )
styctx->embed = MAP_newPrimMap();
if (styctx->verbose) (*prMsg)("Pass 1\n");
Pass1(styctx,s); /* Pass 1: uniqueness */
if (styctx->verbose) (*prMsg)("Pass 2\n");
Pass2(styctx,s); /* Pass 2: references */
}
if( (styctx->errorCnt=PT_diag_errorCnt(styctx->diag)) > 0 )
{
PT_diag_msg
(
(PT_Term)NULL,styctx->diag,"Totally %d errors.\n",
PT_diag_errorCnt(styctx->diag)
);
}
else
{
/* QLX translator */
if( !GLS_EMPTY(qlxdfns) )
{
if (styctx->verbose) (*prMsg)("begin scanner creation\n");
if( MAP_count(styctx->grp) <= 1 )
styctx->Scn = trans_QlxDfns(styctx,s);
else
styctx->Scn = trans_QlxGroups(styctx);
if (styctx->verbose) (*prMsg)("end scanner creation\n");
}
else
{
--tblcnt; (*prMsg)("Note: No scanner specified.\n");
}
if( GLS_EMPTY(qlxdfns) || styctx->Scn != (Scn_T)NULL )
{
if (styctx->verbose) (*prMsg)("Pass 3\n");
Pass3(styctx,s); /* Pass 3: keyword */
if( styctx->root == (Styx_T)NULL &&
styctx->embed != (MAP(_,_))NULL &&
(styctx->errorCnt=PT_diag_errorCnt(styctx->diag)) == 0 )
{
MAP_forItrAsg(dom,rng,itr,styctx->embed)
{
indcnt += MAP_count(rng->indtokkeys);
}
if( indcnt >= 3 )
PT_diag_err(s,styctx->diag,"too many (de)indent token keywords");
}
if( (styctx->errorCnt=PT_diag_errorCnt(styctx->diag)) == 0 )
{
/* CFG translator */
if( styxOptCfg_cfg(optcfg,&dfns,_) && ! GLS_EMPTY(dfns) )
{
Cfg = trans_Dfns(styctx,s);
if( (styctx->errorCnt=PT_diag_errorCnt(styctx->diag)) == 0 )
{
styctx->PTab = PLR_createTab(Cfg,styctx->verbose,styctx->diagnose);
}
PLR_delCfg(Cfg);
if( styctx->PTab != (PLR_Tab)NULL )
{
if( ! acfg_init(styctx->PTab,
&styctx->aPol,&styctx->aNtm,&styctx->aPrd,True) )
{
acfg_quit(styctx->PTab,styctx->aPol,styctx->aNtm,styctx->aPrd);
PLR_delTab(styctx->PTab); styctx->PTab = (PLR_Tab)NULL;
}
}
else (*prMsg)("Parse table creation failed.\n");
if( styctx->PTab == (PLR_Tab)NULL && styctx->Scn != (Scn_T)NULL )
{
Scn_free(styctx->Scn); styctx->Scn = (Scn_T)NULL;
}
}
else
{
--tblcnt; (*prMsg)("Note: No parser specified.\n");
}
}
else
if( styctx->Scn != (Scn_T)NULL )
{
Scn_free(styctx->Scn); styctx->Scn = (Scn_T)NULL;
}
}
else
{
(*prMsg)("Scan table creation failed.\n");
}
}
if( styctx->errorCnt > 0 )
rc = styctx->errorCnt;
else
if( tblcnt > 0 && styctx->Scn == (Scn_T)NULL &&
styctx->PTab == (PLR_Tab)NULL )
rc = -1;
if( styctx->root == (Styx_T)NULL )
{
if( styctx->embed != (MAP(_,_))NULL )
{
MAP_forItrAsg(dom,rng,itr,styctx->embed)
{
STYX_compile_free(rng,rc);
}
}
STYX_compile_free(styctx,rc);
}
return rc;
}
int STYX_compile_file(Styx_T styctx, c_string stydfn, c_string incpath)
/* compiles STYX definition in file 'stydfn' and
creates the corresponding scan & parse table;
uses 'incpath' as include path
RC > 0: number of syntax and semantic errors
RC = -1: table creation failed
RC = 0: successful compilation
*/
{ Scn_Stream cStream; int rc = 0;
BUG_NULL(styctx);
cStream = Stream_file(styctx->styapp->Scn,"",stydfn,"");
rc = STYX_compile(styctx,cStream,incpath);
Stream_free(cStream);
return rc;
}
int STYX_compile_string(Styx_T styctx, c_string stydfn, c_string incpath)
/* compiles STYX definition in string 'stydfn' and
creates the corresponding scan & parse table;
uses 'incpath' as include path
RC > 0: number of syntax and semantic errors
RC = -1: table creation failed
RC = 0: successful compilation
*/
{ Scn_Stream cStream; int rc = 0;
BUG_NULL(styctx);
cStream = Stream_string(styctx->styapp->Scn,stydfn);
rc = STYX_compile(styctx,cStream,incpath);
Stream_free(cStream);
return rc;
}
/*I----------------------- Table image & source generation ------------------- */
void STYX_createTabIMG(Styx_T styctx, c_string Environ)
/* unloads scan & parse table to images
[$'Environ'/].lim
[$'Environ'/].pim (optional)
*/
{
assert0
(
styctx != (Styx_T)NULL && styctx->errorCnt == 0,
"image creation failed"
);
if( styctx->Scn != (Scn_T)NULL )
Scn_put(Environ,styctx->Scn);
if( styctx->PTab != (PLR_Tab)NULL &&
(styctx->conflicts || PLR_conflictCnt(styctx->PTab) == 0 ) )
PLR_putTab(Environ,styctx->PTab);
}
void STYX_appendTabIMG(Styx_T styctx, BinImg_T lim, BinImg_T pim)
/* unloads scan & parse table to images 'lim' and
optional 'pim'
*/
{
assert0
(
styctx != (Styx_T)NULL && styctx->errorCnt == 0,
"image creation failed"
);
if( styctx->Scn != (Scn_T)NULL && lim != (BinImg_T)NULL )
Scn_fput_bin(lim,styctx->Scn);
if( styctx->PTab != (PLR_Tab)NULL && pim != (BinImg_T)NULL &&
(styctx->conflicts || PLR_conflictCnt(styctx->PTab) == 0 ) )
PLR_fputTab_bin(pim,styctx->PTab);
}
void STYX_createTabC(Styx_T styctx, c_string Environ)
/* creates scan & parse table sources
[$'Environ'/]_lim.c
[$'Environ'/]_pim.c (optional)
*/
{ c_bool shortform = C_False;
assert0
(
styctx != (Styx_T)NULL && styctx->errorCnt == 0,
"image creation failed"
);
if( strcmp(styctx->lprefix,styctx->language) )
shortform = C_True;
if( styctx->Scn != (Scn_T)NULL )
Scn_C_Modul(Environ,styctx->Scn,shortform);
if( styctx->PTab != (PLR_Tab)NULL &&
(styctx->conflicts || PLR_conflictCnt(styctx->PTab) == 0 ) )
PLR_CTab_Modul(Environ,styctx->PTab,shortform);
}
void STYX_exportTab(Styx_T styctx, c_string Environ, c_string Template)
/* exports scan table definition, optional based on a given template definition
[$'Environ'/].ltbl
[$'Environ'/].ptbl (optional)
*/
{
assert0
(
styctx != (Styx_T)NULL && styctx->errorCnt == 0,
"export failed"
);
if( styctx->Scn != (Scn_T)NULL )
Scn_Src_Modul(Environ,styctx->Scn,Template);
if( styctx->PTab != (PLR_Tab)NULL &&
(styctx->conflicts || PLR_conflictCnt(styctx->PTab) == 0 ) )
PLR_Src_Modul(Environ,styctx->PTab,Template);
}
void STYX_appendTabC
(
Styx_T styctx,
FILE* lfp, c_string lfid, FILE* pfp, c_string pfid
)
/* appends scan & parse table sources to files 'lfp' and
optional 'pfp';
'lfid', 'pfid' --> optional file names
*/
{
assert0
(
styctx != (Styx_T)NULL && styctx->errorCnt == 0,
"image creation failed"
);
if( styctx->Scn != (Scn_T)NULL && lfp != (FILE*)NULL )
Scn_C_Source(lfp,lfid,styctx->Scn);
if( styctx->PTab != (PLR_Tab)NULL && pfp != (FILE*)NULL &&
(styctx->conflicts || PLR_conflictCnt(styctx->PTab) == 0 ) )
PLR_CTab_Source(pfp,pfid,styctx->PTab);
}
/* --------------------- Interface generation (auxiliary) -------------------- */
static void nChar(Styx_T styctx, int n, char c)
/* n * c */
{ int i; FILE* f = styctx->SysOut;
for( i = 0; i < n; i++) fprintf(f,"%c",c);
}
static void fileComment(Styx_T styctx, string filename, string s)
/* layout a file comment */
{ FILE* f = styctx->SysOut;
c_string cp = styctx->cprefix, cs = styctx->csuffix;
fprintf(f,"%s ",cp); nChar(styctx,LineLen-6,'-'); fprintf(f," %s",cs);
FNL(f);
fprintf(f,"%s ",cp); nChar(styctx,LineLen-6,' '); fprintf(f," %s",cs);
FNL(f);
fprintf(f,"%s [%s]",cp,filename);
nChar(styctx,(LineLen-6-strlen(s)+0)/2-2-strlen(filename),' ');
fprintf(f,"%s",s);
nChar(styctx,(LineLen-6-strlen(s)+1)/2,' ');
fprintf(f," %s",cs);
FNL(f);
fprintf(f,"%s ",cp); nChar(styctx,LineLen-6,' '); fprintf(f," %s",cs);
FNL(f);
fprintf(f,"%s ",cp); nChar(styctx,LineLen-6,'-'); fprintf(f," %s",cs);
FNL(f); FNL(f);
}
static void sectionComment(Styx_T styctx, string s)
/* layout a section comment */
{ FILE* f = styctx->SysOut;
c_string cp = styctx->cprefix, cs = styctx->csuffix;
FNL(f);
fprintf(f,"%sI",cp);
nChar(styctx,(LineLen-6-strlen(s)-2+0)/2,'-');
fprintf(f," %s ",s);
nChar(styctx,(LineLen-6-strlen(s)-2+1)/2,'-');
fprintf(f," %s",cs);
FNL(f);
}
/*I--------------------- Abstract interface generation ----------------------- */
static bool isOptionNtm(Styx_T styctx, int clsidx)
/* whether the nonterminal class represents an option */
{
if( styctx->aPol[clsidx] == -1 && ! HS_EMPTY_SET(styctx->aPrd[clsidx]))
{ HS_Elm elm; HS_Itr itr;
HS_FORALL(elm,itr,styctx->aPrd[clsidx])
{ PLR_Tab PTab = styctx->PTab;
if( noneProd(PLR_prodName(PTab,intCAST(elm))) ||
someProd(PLR_prodName(PTab,intCAST(elm))) )
{
HS_DROP_ITR(itr);
return C_True;
}
else
{
HS_DROP_ITR(itr);
return C_False;
}
}
}
return C_False;
}
static int getOptionMbr(Styx_T styctx, int clsidx)
/* get the token or nonterminal symbol of the option class 'clsidx' */
{
if( ! HS_EMPTY_SET(styctx->aPrd[clsidx]))
{ HS_Elm elm; HS_Itr itr;
HS_FORALL(elm,itr,styctx->aPrd[clsidx])
{ PLR_Tab PTab = styctx->PTab;
int prod = intCAST(elm);
if( someProd(PLR_prodName(PTab,prod)) )
{ int cnt = PLR_prodSymCnt(PTab,prod), i;
for( i=0; i < cnt; ++i )
{ int sym = PLR_prodSymbol(PTab,prod,i), typ = PLR_symType(PTab,sym);
if( CFG_TOK_NTM(typ) )
{
HS_DROP_ITR(itr);
return sym;
}
}
}
}
}
C_BUG; return -1;
}
static void genNtmMbrComment(Styx_T styctx, int clsidx)
/* generates nonterminal member comment */
{ FILE* f = styctx->SysOut;
PLR_Tab PTab = styctx->PTab;
if( styctx->aPol[clsidx] == -1 )
{
fprintf(f,"%s",PLR_symName(PTab,PLR_ntClass(PTab,clsidx)));
}
else
{
if( styctx->aPol[clsidx] >= 0 )
genNtmMbrComment(styctx,styctx->aPol[clsidx]);
else
{
if( ABS(styctx->aPol[clsidx]+2) == PLR_tokenCnt(PTab) )
fprintf(f,"GLS_Tok");
else
{
fprintf(f,"%s",PLR_symName(PTab,ABS(styctx->aPol[clsidx]+2)));
}
}
fprintf(f,"*");
}
}
static void genMemberComment(Styx_T styctx, int sym)
/* generates production member comment */
{ FILE* f = styctx->SysOut;
PLR_Tab PTab = styctx->PTab;
int typ = PLR_symType(PTab,sym);
if( CFG_TOK(typ) ) fprintf(f,"%s",PLR_symName(PTab,sym));
if( CFG_NTM(typ) )
{ int clsidx = PLR_ntClassId(PTab,sym-PLR_tokenCnt(PTab));
if( styctx->version < 1 || !isOptionNtm(styctx,clsidx) )
{
genNtmMbrComment(styctx,clsidx);
}
else
{
sym = getOptionMbr(styctx,clsidx); // token or nonterminal !!!
genMemberComment(styctx,sym);
fprintf(f,"?");
}
}
}
static void genProdComment(Styx_T styctx, int i, int indent)
/* generates production comment */
{ FILE* f = styctx->SysOut;
PLR_Tab PTab = styctx->PTab;
int cnt = PLR_prodSymCnt(PTab,i), j;
c_bool flg = C_True;
if( indent ) fprintf(f," %*s",indent,"");
fprintf(f,"%s",PLR_prodName(PTab,i));
for( j=0; j < cnt; ++j )
{ int sym = PLR_prodSymbol(PTab,i,j), typ = PLR_symType(PTab,sym);
if( CFG_TOK_NTM(typ) )
{
if( flg == True ) { flg = False; fprintf(f,"("); }
else fprintf(f,", ");
genMemberComment(styctx,sym);
}
}
fprintf(f,"%s", ( flg ) ? "" : ")");
}
static void genTokenCom(Styx_T styctx)
/* generates comment for tokens */
{ FILE* f = styctx->SysOut;
PLR_Tab PTab = styctx->PTab;
int cnt = PLR_tokenCnt(PTab), i;
c_bool flg = C_True;
fprintf(f,"TOKENS"); FNL(f);
FNL(f);
fprintf(f," ");
for( i=0; i < cnt; ++i )
{
if( CFG_TOK(PLR_symType(PTab,i)) &&
HS_MBR_ELM(stringToSymbol(PLR_symName(PTab,i)),styctx->tkset) )
{
if( flg == True ) flg = False;
else fprintf(f,", ");
fprintf(f,"%s",PLR_symName(PTab,i));
}
}
FNL(f);
}
static void genTypesCom(Styx_T styctx, string filename)
/* generates comment for types */
{ FILE* f = styctx->SysOut;
PLR_Tab PTab = styctx->PTab;
int scnt = PLR_startCnt(PTab), ncnt = PLR_nontermCnt(PTab), i;
styctx->maxlen = MAX(styctx->maxlen,strlen(PLR_language(PTab)));
for (i = 0; i < PLR_nontermCnt(PTab); i++) if (PLR_ntClassId(PTab,i) == i)
styctx->maxlen = MAX
(
styctx->maxlen,
strlen(PLR_symName(PTab,PLR_ntClass(PTab,i)))
+ strlen(styctx->lprefix)
);
fileComment(styctx,filename,"Abstract Grammar");
fprintf(f,"LANGUAGE %s",PLR_language(PTab)); FNL(f);
FNL(f);
genTokenCom(styctx);
FNL(f);
fprintf(f,"TYPES"); FNL(f);
FNL(f);
fprintf(f," %-*s = ",styctx->maxlen,PLR_language(PTab));
/* 'start' productions */
for (i = 0; i < scnt; i++)
{
genProdComment(styctx,PLR_prodCnt(PTab)-scnt+i,(!i)?0:styctx->maxlen+3);
if( i < scnt - 1 ) fprintf(f,";"); FNL(f);
}
/* normal productions */
for (i = 0; i < ncnt; i++)
if (PLR_ntClassId(PTab,i) == i &&
styctx->aPol[i] == -1 && ! HS_EMPTY_SET(styctx->aPrd[i]) &&
(styctx->version < 1 || !isOptionNtm(styctx,i))
)
{ HS_Itr itr; HS_Elm elm; int cnt = 0, indent = 0;
FNL(f);
fprintf
(
f," %-*s = ",styctx->maxlen,PLR_symName(PTab,PLR_ntClass(PTab,i))
);
/* Here is some stuff to report class equivalence. */
/* We dont use it, but must eventually activate it. */
/*
{ int j; int ntcls = PLR_ntClass(PTab,i);
for (j = 0; j < ncnt; j++)
{ int nt = PLR_NTI_TO_NTS(PTab,j), equiv = PLR_NTS_TO_NTC(PTab,nt);
if( ntcls == equiv ) fprintf(f," %s",PLR_symName(PTab,nt));
}
}
*/
HS_FORALL(elm,itr,styctx->aPrd[i])
{
genProdComment(styctx,intCAST(elm),indent);
++cnt; if( cnt < HS_CARD(styctx->aPrd[i]) ) fprintf(f,";"); FNL(f);
if( ! indent ) indent = styctx->maxlen + 3;
}
}
FNL(f);
/*
fprintf(f," X*%*s = nil; cons(X,X*)",MAX(0,styctx->maxlen-2),""); FNL(f);
FNL(f);
*/
}
void STYX_createABS(Styx_T styctx, c_string Environ)
/* create abstract interface [$'Environ'/].abs */
{ string filename = (c_string)NULL;
assert0
(
styctx != (Styx_T)NULL && styctx->errorCnt == 0 &&
styctx->PTab != (PLR_Tab)NULL,
"missing parse table"
);
styctx->SysOut = OpenPath(Environ,PLR_language(styctx->PTab),".abs","wt");
styctx->cprefix = StrCopy("/*");
styctx->csuffix = StrCopy("*/");
filename = Str_printf("%s.abs",PLR_language(styctx->PTab));
genTypesCom(styctx,filename);
fclose(styctx->SysOut); styctx->SysOut = (FILE*)NULL;
FreeMem(styctx->cprefix); styctx->cprefix = (c_string)NULL;
FreeMem(styctx->csuffix); styctx->csuffix = (c_string)NULL;
FreeMem(filename);
}
void STYX_appendABS(Styx_T styctx, FILE* fp, c_string fid)
/* append abstract interface to file 'fp';
'fid' --> optional file name
*/
{
assert0
(
styctx != (Styx_T)NULL && styctx->errorCnt == 0 &&
styctx->PTab != (PLR_Tab)NULL && fp != (FILE*)NULL,
"missing parse table or file"
);
styctx->SysOut = fp;
styctx->cprefix = StrCopy("/*");
styctx->csuffix = StrCopy("*/");
genTypesCom(styctx,fid);
styctx->SysOut = (FILE*)NULL;
FreeMem(styctx->cprefix); styctx->cprefix = (c_string)NULL;
FreeMem(styctx->csuffix); styctx->csuffix = (c_string)NULL;
}
/*I--------------------- C interface generation ------------------------------ */
static void genCNtmArgTyp(Styx_T styctx, int clsidx)
/* generates nonterminal argument type name */
{ FILE* f = styctx->SysOut;
PLR_Tab PTab = styctx->PTab;
if( styctx->aPol[clsidx] == -1 )
{
if( styctx->version < 1 || !isOptionNtm(styctx,clsidx) )
{
fprintf
(
f,"%s%s",styctx->lprefix,PLR_symName(PTab,PLR_ntClass(PTab,clsidx))
);
}
else
{ int sym = getOptionMbr(styctx,clsidx); // token or nonterminal !!!
int typ = PLR_symType(PTab,sym);
fprintf(f,"GLS_Opt(");
if( CFG_TOK(typ) ) fprintf(f,"GLS_Tok");
else // nonterminal !!!
{ int optclsidx = PLR_ntClassId(PTab,sym-PLR_tokenCnt(PTab));
genCNtmArgTyp(styctx,optclsidx);
}
fprintf(f,")");
}
}
else
{
fprintf(f,"GLS_Lst(");
if( styctx->aPol[clsidx] >= 0 )
genCNtmArgTyp(styctx,styctx->aPol[clsidx]);
else fprintf(f,"GLS_Tok");
fprintf(f,")");
}
}
static void genCProd(Styx_T styctx, int i)
/* generates for Production i */
{ FILE* f = styctx->SysOut;
PLR_Tab PTab = styctx->PTab;
int nt = PLR_prodNonTerm(PTab,i),
clsidx = PLR_ntClassId(PTab,nt-PLR_tokenCnt(PTab)),
ntcls = PLR_ntClass(PTab,clsidx),
num = 0, cnt, len, j;
c_bool flg = True;
HS_Itr itr; HS_Elm elm;
len = 7 + strlen(styctx->lprefix) + strlen(PLR_symName(PTab,ntcls))
+ 1 + strlen(PLR_prodName(PTab,i)) + 1;
FNL(f);
fprintf
(
f,"c_bool %s%s_%s(%s%s x",
styctx->lprefix, PLR_symName(PTab,ntcls), PLR_prodName(PTab,i),
styctx->lprefix, PLR_symName(PTab,ntcls)
);
cnt = PLR_prodSymCnt(PTab,i);
for( j=0; j < cnt; ++j )
{ int sym = PLR_prodSymbol(PTab,i,j), typ = PLR_symType(PTab,sym);
if( CFG_TOK(typ) )
{
if( num > 1 && ! ( num % 2 ) )
fprintf(f,",\n%*sGLS_Tok* x%d",len,"",++num);
else
fprintf(f,", GLS_Tok* x%d",++num);
}
if( CFG_NTM(typ) )
{
if( num > 1 && ! ( num % 2 ) ) fprintf(f,",\n%*s",len,"");
else fprintf(f,", ");
genCNtmArgTyp(styctx,PLR_ntClassId(PTab,sym-PLR_tokenCnt(PTab)));
fprintf(f,"* x%d",++num);
}
}
fprintf(f,")");
FNL(f); fprintf(f,"{");
FNL(f); fprintf(f," assert0( ");
HS_FORALL(elm,itr,styctx->aNtm[clsidx])
{
if( flg )
{
flg = False;
}
else
{
FNL(f); fprintf(f," ||");
}
if (styctx->genabs)
fprintf(f," PT_Abs_nonterm(x) == CfgSyms[%d]",intCAST(elm));
else
fprintf(f," PT_THISNTM((PT_Term)x, CfgSyms[%d])",intCAST(elm));
}
fprintf(f,", \"%s expected\" );",PLR_symName(PTab,ntcls));
FNL(f);
if (styctx->genabs)
fprintf
(
f," if( PT_Abs_product(x) != PrdSyms[%d] ) return False;",i
);
else
fprintf
(
f," if( ! PT_THISPRD((PT_Term)x, PrdSyms[%d]) ) return False;",i
);
if( num )
{ bool xflg = False;
if( !styctx->genabs )
{
FNL(f); fprintf(f," { PT_Term y;");
}
XARON_STEP:
if( !styctx->genabs )
{
if( ! xflg )
{
FNL(f); fprintf(f," if( ! PT_isXaron(x) )");
}
else
{
FNL(f); fprintf(f," else");
}
FNL(f); fprintf(f," {");
}
for( num = 0, j=0; j < cnt; ++j )
{ int sym = PLR_prodSymbol(PTab,i,j), typ = PLR_symType(PTab,sym);
if( CFG_TOK_NTM(typ) )
{
FNL(f);
if (!styctx->genabs)
{
if( ! xflg )
fprintf
(
f," x = (%s%s)GLS_keycom_Skip(PT_%s(x));",
styctx->lprefix, PLR_symName(PTab,ntcls),
num ? "next" : "parts"
);
else
{
fprintf
(
f," x = XGLS_keycom_Skip(%s(x));",
num ? "rst" : "XPT_parts"
);
fprintf
(
f," y = fst(%s%s,x);",styctx->lprefix,PLR_symName(PTab,ntcls)
);
}
FNL(f);
}
++num;
fprintf
(
f, " %sif( (%sCPtr)x%d != (%sCPtr)NULL )",
styctx->genabs?"":" ",
styctx->genabs?"Huge":"Std", num, styctx->genabs?"Huge":"Std"
);
if (!styctx->genabs) { FNL(f); fprintf(f," "); }
if( CFG_TOK(typ) )
fprintf(f," *x%d = (GLS_Tok)", num);
else
{
fprintf(f," *x%d = (", num);
genCNtmArgTyp(styctx,PLR_ntClassId(PTab,sym-PLR_tokenCnt(PTab)));
fprintf(f,")");
}
if (styctx->genabs)
fprintf(f,"PT_Abs_part(x,%d);",num-1);
else
fprintf(f,"GLS_ign_Skip(%s);",( ! xflg ) ? "x" : "y");
}
}
if( !styctx->genabs )
{
FNL(f); fprintf(f," }");
xflg = ( ! xflg ) ? True : False;
if( xflg ) goto XARON_STEP;
FNL(f); fprintf(f," }");
}
}
FNL(f); fprintf(f," return True;");
FNL(f); fprintf(f,"}");
FNL(f);
}
static void genCNonTerm(Styx_T styctx, int i)
/* generates for nonterminal class i */
{ int nt = PLR_ntClass(styctx->PTab,i); HS_Elm elm; HS_Itr itr;
sectionComment(styctx,PLR_symName(styctx->PTab,nt));
HS_FORALL(elm,itr,styctx->aPrd[i]) genCProd(styctx,intCAST(elm));
}
static void genCTermTyp(Styx_T styctx, int i)
/* generates for terminal i */
{ FILE* f = styctx->SysOut;
PLR_Tab PTab = styctx->PTab;
FNL(f);
fprintf(f,"c_bool %s_%s(GLS_Tok x)",styctx->tkclsnam,PLR_symName(PTab,i));
FNL(f); fprintf(f,"{");
FNL(f);
if (styctx->genabs)
fprintf(f," return PT_Abs_token(x) == CfgSyms[%d];",i);
else
fprintf(f," return( PT_THISTOK((PT_Term)x, CfgSyms[%d]) );",i);
FNL(f); fprintf(f,"}");
FNL(f);
}
static void genCStartTrm(Styx_T styctx)
/* generates for startsymbol class term */
{ FILE* f = styctx->SysOut;
PLR_Tab PTab = styctx->PTab;
int nt = PLR_prodNonTerm(PTab,PLR_prodCnt(PTab)-PLR_startCnt(PTab));
FNL(f);
fprintf
(
f,"c_bool %s_%s(PT_%sTerm x, %s* x1)",
styctx->lprefix, PLR_language(PTab),
styctx->genabs?"Abs_":"", PLR_language(PTab)
);
FNL(f); fprintf(f,"{");
FNL(f);
if (styctx->genabs)
fprintf(f," if( PT_Abs_nonterm(x) == CfgSyms[%d] )",nt);
else
fprintf(f," if( PT_THISNTM(x, CfgSyms[%d]) )",nt);
FNL(f); fprintf(f," {");
FNL(f);
fprintf
(
f," if( (%sCPtr)x1 != (%sCPtr)NULL ) *x1 = (%s)x;",
styctx->genabs?"Huge":"Std",styctx->genabs?"Huge":"Std",
PLR_language(PTab)
);
FNL(f); fprintf(f," return True;");
FNL(f); fprintf(f," }");
FNL(f); fprintf(f," return False;");
FNL(f); fprintf(f,"}");
FNL(f);
}
static void genCNtmTrm(Styx_T styctx, int i)
/* generates for nonterminal class term i */
{ FILE* f = styctx->SysOut;
PLR_Tab PTab = styctx->PTab;
int nt = PLR_ntClass(PTab,i);
c_bool flg = True;
HS_Elm elm; HS_Itr itr;
FNL(f);
fprintf
(
f,"c_bool %s_%s(PT_%sTerm x, %s%s* x1)",
styctx->lprefix, PLR_symName(PTab,nt), styctx->genabs?"Abs_":"",
styctx->lprefix, PLR_symName(PTab,nt)
);
FNL(f); fprintf(f,"{");
FNL(f); fprintf(f," if( ");
HS_FORALL(elm,itr,styctx->aNtm[i])
{
if( flg )
{
flg = False;
}
else
{
FNL(f); fprintf(f," ||");
}
if (styctx->genabs)
fprintf(f," PT_Abs_nonterm(x) == CfgSyms[%d]",intCAST(elm));
else
fprintf(f," PT_THISNTM(x, CfgSyms[%d])",intCAST(elm));
}
fprintf(f," )");
FNL(f); fprintf(f," {");
FNL(f);
fprintf
(
f," if( (%sCPtr)x1 != (%sCPtr)NULL ) *x1 = (%s%s)x;",
styctx->genabs?"Huge":"Std",styctx->genabs?"Huge":"Std",
styctx->lprefix, PLR_symName(PTab,nt)
);
FNL(f); fprintf(f," return True;");
FNL(f); fprintf(f," }");
FNL(f); fprintf(f," return False;");
FNL(f); fprintf(f,"}");
FNL(f);
}
static void genCStart(Styx_T styctx, int i)
/* generates for start production i */
{ FILE* f = styctx->SysOut;
PLR_Tab PTab = styctx->PTab;
int prod = PLR_prodCnt(PTab)-PLR_startCnt(PTab)+i,
nt = PLR_prodNonTerm(PTab,prod),
ntstart = PLR_startSymbol(PTab,i),
ntclsid = PLR_ntClassId(PTab,ntstart-PLR_tokenCnt(PTab));
FNL(f);
fprintf
(
f,"c_bool %s_%s(%s x, ",
PLR_language(PTab), PLR_prodName(PTab,prod), PLR_language(PTab)
);
genCNtmArgTyp(styctx,ntclsid);
fprintf(f,"* x1)");
/* for backward compatibility purposes ... */
FNL(f);
fprintf
(
f,"#define %s_Start_%d %s_%s",
PLR_language(PTab), i, PLR_language(PTab), PLR_prodName(PTab,prod)
);
/* ... for backward compatibility purposes */
FNL(f); fprintf(f,"{");
FNL(f);
if (styctx->genabs)
fprintf
(
f," assert0( PT_Abs_nonterm(x) == CfgSyms[%d], \"%s expected\" );",
nt, PLR_language(PTab)
);
else
fprintf
(
f," assert0( PT_THISNTM((PT_Term)x, CfgSyms[%d]), \"%s expected\" );",
nt, PLR_language(PTab)
);
FNL(f);
if (styctx->genabs)
fprintf
(
f," if( PT_Abs_product(x) != PrdSyms[%d] ) return False;", prod
);
else
fprintf
(
f," if( ! PT_THISPRD((PT_Term)x, PrdSyms[%d]) ) return False;", prod
);
FNL(f);
fprintf
(
f," if( (%sCPtr)x1 != (%sCPtr)NULL )",
styctx->genabs?"Huge":"Std",styctx->genabs?"Huge":"Std"
);
FNL(f); fprintf(f," *x1 = (");
genCNtmArgTyp(styctx,ntclsid);
if (styctx->genabs)
fprintf(f,")PT_Abs_part(x,0);");
else
fprintf
(
f,")GLS_ign_Skip(PT_nthSymbol((PT_Term)x, CfgSyms[%d], %d, True));",
ntstart,1
);
FNL(f); fprintf(f," return True;");
FNL(f); fprintf(f,"}");
FNL(f);
}
static void genCTypes(Styx_T styctx)
/* generates the types */
{ FILE* f = styctx->SysOut;
PLR_Tab PTab = styctx->PTab;
int i;
sectionComment(styctx,"Types & Constants");
FNL(f);
fprintf
(
f,"Abstract%sType( %-*s );", styctx->genabs?"Huge":"",
styctx->maxlen, PLR_language(PTab)
);
FNL(f);
for (i = 0; i < PLR_nontermCnt(PTab); i++)
{
if (PLR_ntClassId(PTab,i) == i && styctx->aPol[i] == -1 &&
(styctx->version < 1 || !isOptionNtm(styctx,i)) )
{
FNL(f);
fprintf
(
f,"Abstract%sType( %s%-*s );", styctx->genabs?"Huge":"",
styctx->lprefix, (int)(styctx->maxlen - strlen(styctx->lprefix)),
PLR_symName(PTab,PLR_ntClass(PTab,i))
);
}
}
FNL(f);
/* terminal types */
sectionComment(styctx,"Access to Tokens");
for (i = 0; i < PLR_tokenCnt(PTab); i++)
if( CFG_TOK(PLR_symType(PTab,i)) &&
HS_MBR_ELM(stringToSymbol(PLR_symName(PTab,i)),styctx->tkset) )
genCTermTyp(styctx,i);
/* nonterminal types */
sectionComment(styctx,"Access to Terms");
genCStartTrm(styctx);
for (i = 0; i < PLR_nontermCnt(PTab); i++)
if (PLR_ntClassId(PTab,i) == i && styctx->aPol[i] == -1 &&
(styctx->version < 1 || !isOptionNtm(styctx,i)) )
genCNtmTrm(styctx,i);
/* special type "access" */
sectionComment(styctx,PLR_language(PTab));
for (i = 0; i < PLR_startCnt(PTab); i++)
genCStart(styctx,i);
for (i = 0; i < PLR_nontermCnt(PTab); i++)
if (PLR_ntClassId(PTab,i) == i && styctx->aPol[i] == -1 &&
(styctx->version < 1 || !isOptionNtm(styctx,i)) )
genCNonTerm(styctx,i);
}
static void genCSymbolQuit(Styx_T styctx)
/* generates symbol objects: quit function */
{ FILE* f = styctx->SysOut;
FNL(f); fprintf(f,"void %s_quitSymbols()",styctx->lprefix);
FNL(f); fprintf(f,"{");
FNL(f); fprintf(f," --initcount_%s;",styctx->lprefix);
FNL(f); fprintf(f," if( initcount_%s == 0 )",styctx->lprefix);
FNL(f); fprintf(f," {");
FNL(f); fprintf
(
f,
" assert0(CfgSyms != (symbol*)NULL,\"%sSymbols not initialized\");",
styctx->lprefix
);
FNL(f); fprintf(f," if( CfgSyms != (symbol*)NULL ) FreeMem(CfgSyms);");
FNL(f); fprintf(f," CfgSyms = (symbol*)NULL;");
FNL(f); fprintf(f," if( PrdSyms != (symbol*)NULL ) FreeMem(PrdSyms);");
FNL(f); fprintf(f," PrdSyms = (symbol*)NULL;");
FNL(f); fprintf(f," }");
FNL(f); fprintf(f,"}");
FNL(f);
}
static void genCSymbolInit(Styx_T styctx)
/* generates symbol objects: initializing function */
{ FILE* f = styctx->SysOut;
PLR_Tab PTab = styctx->PTab;
int i;
FNL(f); fprintf(f,"void %s_initSymbols()",styctx->lprefix);
FNL(f); fprintf(f,"{");
FNL(f); fprintf(f," if( initcount_%s == 0 )",styctx->lprefix);
FNL(f); fprintf(f," {");
FNL(f); fprintf(f," GLS_init();");
FNL(f); fprintf
(
f,
" assert0(CfgSyms == (symbol*)NULL,\"%sSymbols already initialized\");",
styctx->lprefix
);
FNL(f); fprintf
(
f," CfgSyms = (symbol*)NewMem(sizeof(symbol)*%d);",
PLR_symbolCnt(PTab)
);
FNL(f); fprintf
(
f," PrdSyms = (symbol*)NewMem(sizeof(symbol)*%d);",
PLR_prodCnt(PTab)
);
FNL(f);
for( i=0; i < PLR_symbolCnt(PTab); ++i )
{ string t = LIT_c_str_lit(PLR_symName(PTab,i));
FNL(f); fprintf
(
f," CfgSyms[%d] = stringToSymbol(%s);", i,t
);
FreeMem(t);
}
FNL(f);
for( i=0; i < PLR_prodCnt(PTab); ++i )
{
FNL(f); fprintf
(
f," PrdSyms[%d] = stringToSymbol(\"%s\");",
i,PLR_prodName(PTab,i)
);
}
FNL(f); fprintf(f," }");
FNL(f); fprintf(f," ++initcount_%s;",styctx->lprefix);
FNL(f); fprintf(f,"}");
FNL(f);
}
static void genCSymbolAccess(Styx_T styctx)
/* generates symbol objects: initializing and quit functions */
{ FILE* f = styctx->SysOut;
sectionComment(styctx,"symbol objects - init & quit"); FNL(f);
fprintf(f,"static symbol* CfgSyms = (symbol*)NULL;"); FNL(f);
fprintf(f,"static symbol* PrdSyms = (symbol*)NULL;"); FNL(f);
fprintf(f,"static int initcount_%s = 0;",styctx->lprefix); FNL(f);
genCSymbolInit(styctx);
genCSymbolQuit(styctx);
}
static void genCInterface(Styx_T styctx, c_string filename)
/* generates the interface */
{ FILE* f = styctx->SysOut;
styctx->maxlen = 0;
styctx->cprefix = StrCopy("/*");
styctx->csuffix = StrCopy("*/");
fileComment(styctx,filename,"Language Interface");
fprintf(f,"#include \"ptm.h\""); FNL(f);
fprintf(f,"#include \"gls%s.h\"",styctx->genabs?"_abs":""); FNL(f);
genCSymbolAccess(styctx);
genCTypes(styctx);
FreeMem(styctx->cprefix); styctx->cprefix = (c_string)NULL;
FreeMem(styctx->csuffix); styctx->csuffix = (c_string)NULL;
}
static void STYX_createC
(
Styx_T styctx, c_string Environ, c_bool genabs
)
{ c_string filename = (c_string)NULL,
base_ext = genabs?ANTEXT:INTEXT;
assert0
(
styctx != (Styx_T)NULL && styctx->errorCnt == 0 &&
styctx->PTab != (PLR_Tab)NULL,
"missing parse table"
);
if( styctx->conflicts || PLR_conflictCnt(styctx->PTab) == 0 )
{
styctx->genabs = genabs;
filename = Str_printf("%s_%s.c",styctx->lprefix,base_ext);
styctx->SysOut = OpenPath(Environ,filename,"","wt");
genCInterface(styctx,filename);
fclose(styctx->SysOut); styctx->SysOut = (FILE*)NULL;
styctx->genabs = C_False;
FreeMem(filename);
}
}
void STYX_createIntC(Styx_T styctx, c_string Environ)
/* create C interface [$'Environ'/]_int.c */
{
STYX_createC(styctx,Environ,C_False);
}
void STYX_createAntC(Styx_T styctx, c_string Environ)
/* create special abstract C interface [$'Environ'/]_ant.c */
{
STYX_createC(styctx,Environ,C_True);
}
static void STYX_appendC
(
Styx_T styctx, FILE* fp, c_string fid, c_bool genabs
)
{
assert0
(
styctx != (Styx_T)NULL && styctx->errorCnt == 0 &&
styctx->PTab != (PLR_Tab)NULL && fp != (FILE*)NULL,
"missing parse table or file"
);
if( styctx->conflicts || PLR_conflictCnt(styctx->PTab) == 0 )
{
styctx->genabs = genabs;
styctx->SysOut = fp;
genCInterface(styctx,fid);
styctx->SysOut = (FILE*)NULL;
styctx->genabs = C_False;
}
}
void STYX_appendIntC(Styx_T styctx, FILE* fp, c_string fid)
/* append C interface to file 'fp';
'fid' --> optional file name
*/
{
STYX_appendC(styctx,fp,fid,C_False);
}
void STYX_appendAntC(Styx_T styctx, FILE* fp, c_string fid)
/* append C interface to file 'fp';
'fid' --> optional file name
*/
{
STYX_appendC(styctx,fp,fid,C_True);
}
styx-2.0.1/libstyx/scn_gen.c 0000666 0001750 0001750 00000120261 10536022632 012725 0000000 0000000 /* ------------------------------------------------------------------------ */
/* */
/* [scn_gen.c] Scanner Generator */
/* */
/* Copyright (c) 1993 by D\olle, Manns */
/* ------------------------------------------------------------------------ */
/* TODO */
/* - Write a document on the source */
#include "scn_io.h"
#include "list.h"
#include "ctx_app.h"
#include "scn_imp.h"
/*!
The module [scn_gen] supports the construction of regular sets and
produces the scanner definitions as base for the
scan streams.
The complexity of the scanner is linear. A consequence of this design-goal
is its restriction to a one-character-lookahead.
The construction of regular sets is reentrant.
There also exists a reentrant version of the scanner production.
*/
/*I------------------------- Type of regular sets ------------------------- */
AbstractType(RegSet_T); /* Regular Set */
/* -- Graph for finite automation -- */
#define RegSet_IMP(X) ((regset_t)(X))
#define RegSet_ADT(X) ((RegSet_T)(X))
ConcreteType(regset_t)
{
int id;
List(faNode) Nodes; /* !empty; fst == start */
};
ConcreteType(faNode)
{
int id;
regset_t Belongs;
List(faNode) Source; /* list of "source" nodes */
int term; /* terminal state if > 0 */
List(dfaEdge) Edges;
int flag1;
int flag2;
};
ConcreteType(dfaEdge)
{
wc_char dfa_lower;
wc_char dfa_upper;
faNode dfa_toNode;
};
ConcreteType(nfaEdge)
{
wc_char nfa_lower;
wc_char nfa_upper;
List(faNode) nfa_toNodes;
};
/* -- Edge constructor -- */
static dfaEdge newDfaEdge(wc_char lower, wc_char upper, faNode toNode)
{ dfaEdge res = New(dfaEdge);
res->dfa_lower = lower;
res->dfa_upper = upper;
res->dfa_toNode = toNode;
return res;
}
static nfaEdge newNfaEdge(wc_char lower, wc_char upper, List(faNode) toNodes)
{ nfaEdge res = New(nfaEdge);
res->nfa_lower = lower;
res->nfa_upper = upper;
res->nfa_toNodes = toNodes;
return res;
}
/*I-------------------------- Disposing ----------------------------------- */
static void freeNothing(Abs_T dummy)
{
}
static void freeNfaEdge(nfaEdge x)
{
freeList(x->nfa_toNodes, freeNothing);
FreeMem(x);
}
static void freeDfaNode(faNode x)
/* frees dfa node */
{
freeList(x->Source, freeNothing);
freeList(x->Edges, FreeMem);
FreeMem(x);
}
void RegSet_Free(RegSet_T g)
/* frees regular set 'g' */
{
freeList(RegSet_IMP(g)->Nodes, (void (*)(Abs_T x)) freeDfaNode);
FreeMem(g);
}
/*I-------------------------- RegSet Constructors ------------------------- */
/*!
The resulting regular sets when applying one of the following functions
have to be released.
*/
/* -- basic graph constructors -- */
static int RegSet_TId = 1;
RegSet_T RegSet_Epsilon(void)
/* epsilon "" */
{ faNode s0 = New(faNode);
regset_t res = New(regset_t);
#if defined( _MSDOS ) || defined( _WIN32 )
res->id = InterlockedIncrement(&RegSet_TId);
#else
res->id = RegSet_TId ++;
#endif
res->Nodes = cons(s0,NULL);
s0->id = 0;
s0->Belongs = res;
s0->Source = NULL;
s0->term = True; /* terminal */
s0->Edges = NULL;
s0->flag1 = 0;
s0->flag2 = 0;
return RegSet_ADT(res);
}
RegSet_T RegSet_Empty(void)
/* empty set '' */
{ faNode s0 = New(faNode);
regset_t res = New(regset_t);
#if defined( _MSDOS ) || defined( _WIN32 )
res->id = InterlockedIncrement(&RegSet_TId);
#else
res->id = RegSet_TId ++;
#endif
res->Nodes = cons(s0,NULL);
s0->id = 0;
s0->Belongs = res;
s0->Source = NULL;
s0->term = False; /* non - terminal */
s0->Edges = NULL;
s0->flag1 = 0;
s0->flag2 = 0;
return RegSet_ADT(res);
}
RegSet_T RegSet_Range(wc_char dfa_lower, wc_char dfa_upper)
/* character range L .. U */
{ faNode s0 = New(faNode);
faNode s1 = New(faNode);
regset_t res = New(regset_t);
c_bug
(
((unsigned long)dfa_lower) <= ((unsigned long)dfa_upper),
"RegSet_Range(%ld,%ld) must be a range",
((unsigned long)dfa_lower),((unsigned long)dfa_upper)
);
#if defined( _MSDOS ) || defined( _WIN32 )
res->id = InterlockedIncrement(&RegSet_TId);
#else
res->id = RegSet_TId ++;
#endif
res->Nodes = cons(s0,cons(s1,NULL));
s0->id = 0;
s0->Belongs = res;
s0->Source = NULL;
s0->term = False; /* non - terminal */
s0->Edges = cons(newDfaEdge(dfa_lower,dfa_upper,s1),NULL);
s0->flag1 = 0;
s0->flag2 = 0;
s1->id = 1;
s1->Belongs = res;
s1->Source = NULL;
s1->term = True; /* terminal */
s1->Edges = NULL;
s1->flag1 = 0;
s1->flag2 = 0;
return RegSet_ADT(res);
}
RegSet_T RegSet_Char(wc_char c)
/* character 'c' */
{
return RegSet_Range(c,c);
}
/* -- Graph Combinator -- */
static int lex(int A, int B) { return A ? A : B; }
static bool compNodes(faNode a, faNode b)
/* order Nodes */
{
return lex( a->Belongs->id - b->Belongs->id, a->id - b->id );
}
static List(faNode) insertState(faNode x, List(faNode) y)
/* inserts a state into a source id */
/* we keep them ordered for identification */
{
return empty(y) ? cons(x,y)
: compNodes(x,fst(faNode,y)) == 0 ? y
: compNodes(x,fst(faNode,y)) < 0 ? cons(x,y)
: ((*rst_ref(y) = insertState(x,rst(y))), y);
}
static List(nfaEdge) copyEdges
(
List(dfaEdge) x, RegSet_T lambdaFrom, RegSet_T lambdaTo
)
/* copies an DFA-Edge to a NFA-Edge extending lambda edges */
{
if (empty(x))
return NULL;
else
{ List(faNode) src = NULL;
faNode nod = fst(dfaEdge,x)->dfa_toNode;
src = insertState(nod,src);
if (nod->Belongs == RegSet_IMP(lambdaFrom) && nod->term > 0)
src = insertState(fst(faNode,RegSet_IMP(lambdaTo)->Nodes),src);
return cons(newNfaEdge(fst(dfaEdge,x)->dfa_lower,
fst(dfaEdge,x)->dfa_upper,
src ),
copyEdges(rst(x), lambdaFrom,lambdaTo) );
}
}
static List(faNode) nodesUnion(List(faNode) x, List(faNode) y)
{
if ( empty(x) && empty(y))
return NULL;
if ( empty(x) && !empty(y))
return cons(fst(faNode,y),nodesUnion(NULL,rst(y)));
if (!empty(x) && empty(y))
return cons(fst(faNode,x),nodesUnion(rst(x),NULL));
if (compNodes(fst(faNode,x),fst(faNode,y)) < 0)
return cons(fst(faNode,x),nodesUnion(rst(x),y));
else
if (compNodes(fst(faNode,x),fst(faNode,y)) > 0)
return cons(fst(faNode,y),nodesUnion(x,rst(y)));
else
return cons(fst(faNode,x),nodesUnion(rst(x),rst(y)));
}
static bool equalStates(List(faNode) x, List(faNode) y)
{
for (; !empty(x) && !empty(y); x=rst(x), y=rst(y))
if (fst(faNode,x) != fst(faNode,y))
return False;
return empty(x) && empty(y);
}
static List(nfaEdge) consMerge(nfaEdge x, List(nfaEdge) y)
/* joins two edges if possible */
{
if (!empty(y) &&
x->nfa_upper+1 == fst(nfaEdge,y)->nfa_lower &&
equalStates(x->nfa_toNodes,fst(nfaEdge,y)->nfa_toNodes) )
{
fst(nfaEdge,y)->nfa_lower = x->nfa_lower;
freeNfaEdge(x);
return y;
}
else
return cons(x,y);
}
static List(nfaEdge) mergeEdges(List(nfaEdge) x, List(nfaEdge) y)
/* merges NFA-Edges x with NFA-Edges y */
/* Note that both lists are freed */
{ nfaEdge xe, ye; List(nfaEdge) xy, res;
if (empty(x)) return y;
if (empty(y)) return x;
xy = x; xe = fst(nfaEdge,x); x = rst(x); FreeMem(xy);
xy = y; ye = fst(nfaEdge,y); y = rst(y); FreeMem(xy);
if (xe->nfa_upper > ye->nfa_upper)
{
{ nfaEdge a = xe, b = ye; xe = b; ye = a; }
{ List(nfaEdge) a = x, b = y; x = b; y = a; }
}
if (xe->nfa_upper < ye->nfa_lower)
return consMerge(xe,mergeEdges(x,cons(ye,y)));
/* we have a true intersection here */
res = consMerge
(
newNfaEdge(MAX(xe->nfa_lower,ye->nfa_lower),
xe->nfa_upper,
nodesUnion(xe->nfa_toNodes, ye->nfa_toNodes) ),
mergeEdges(x,
xe->nfa_upper < ye->nfa_upper
? cons(newNfaEdge((wc_char)(xe->nfa_upper+1),
ye->nfa_upper,
nodesUnion(ye->nfa_toNodes, NULL)
),y )
: y )
);
if (xe->nfa_lower > ye->nfa_lower)
{ nfaEdge a = xe, b = ye; xe = b; ye = a; }
if (xe->nfa_lower < ye->nfa_lower)
res = consMerge(newNfaEdge(xe->nfa_lower, (wc_char)(ye->nfa_lower-1),
nodesUnion(xe->nfa_toNodes,NULL) ), res );
freeNfaEdge(xe); freeNfaEdge(ye);
return res;
}
/* -- */
static faNode identifySource(RegSet_T g, List(faNode) x)
/* identify state in g with Source equal to x */
{ List(faNode) *t; int i; faNode s0;
for(i = 0, t = &RegSet_IMP(g)->Nodes; !empty(*t); i += 1, t = rst_ref(*t))
if (equalStates( fst(faNode,*t)->Source, x))
{ freeList(x, freeNothing); return fst(faNode,*t); }
s0 = New(faNode);
s0->id = i;
s0->Belongs = RegSet_IMP(g);
s0->Source = x;
s0->term = False;
s0->Edges = NULL;
s0->flag1 = 0;
s0->flag2 = 0;
*t = cons(s0,NULL);
return s0;
}
static List(faNode) NfaToDfaEdges(RegSet_T g, List(nfaNode) x)
/* translates NfaEdges to DdfaEdges identifying or adding states to g */
{ List(nfaNode) t;
for(t = x; !empty(t); t = rst(t))
{ nfaEdge e = fst(nfaEdge,t);
((dfaEdge)e)->dfa_toNode = identifySource(g, e->nfa_toNodes);
}
return (List(faNode)) x;
}
static List(faNode) RegSet_Starts
(
List(RegSet_T) graphs,
RegSet_T lambdaFrom,
RegSet_T lambdaTo
)
/* returns the list of start nodes of graphs */
/* frees x */
{ List(RegSet_T) x; List(faNode) y; faNode n;
if (empty(graphs)) return NULL;
x = rst(graphs);
n = fst(faNode,fst(regset_t,graphs)->Nodes);
FreeMem(graphs);
y = RegSet_Starts(x, lambdaFrom,lambdaTo);
if (n->Belongs == lambdaFrom && n->term > 0)
y = insertState(fst(faNode,RegSet_IMP(lambdaTo)->Nodes),y);
return insertState(n,y);
}
static RegSet_T RegSet_Merge
(
List(RegSet_T) graphs, RegSet_T lambdaFrom, RegSet_T lambdaTo
)
{ faNode s0 = New(faNode);
List(faNode) Todo;
regset_t res = New(regset_t);
#if defined( _MSDOS ) || defined( _WIN32 )
res->id = InterlockedIncrement(&RegSet_TId);
#else
res->id = RegSet_TId ++;
#endif
res->Nodes = cons(s0,NULL);
s0->id = 0;
s0->Belongs = res;
s0->Source = RegSet_Starts(graphs,lambdaFrom,lambdaTo);
s0->term = False;
s0->Edges = NULL;
s0->flag1 = 0;
s0->flag2 = 0;
for (Todo = res->Nodes; !empty(Todo); Todo = rst(Todo))
{ List(faNode) Nds; List(nfaEdge) NfaEdges = NULL;
for( Nds = fst(faNode,Todo)->Source; !empty(Nds); Nds = rst(Nds))
NfaEdges = mergeEdges
(
NfaEdges,
copyEdges(fst(faNode,Nds)->Edges,lambdaFrom,lambdaTo)
);
fst(faNode,Todo)->Edges = NfaToDfaEdges(res, NfaEdges);
}
return RegSet_ADT(res);
}
/* -- graph reduction -- */
/* Ziel: von allen Zustaenden aus kann ein terminaler Zustand erreicht */
/* werden. */
/* Methode: entferne alle anderen */
#define reachesNxt flag1
#define reachesTrm flag2
static void reachNodes(regset_t reg)
/* build the closure of terminal nodes via egdes */
{ List(faNode) nodes; List(dfaEdges) edges; bool changed = True;
while (changed)
{ changed = False;
for (nodes = reg->Nodes; !empty(nodes); nodes = rst(nodes))
{ faNode nod = fst(faNode,nodes);
for (edges = nod->Edges; !empty(edges); edges = rst(edges))
nod->reachesNxt |= fst(dfaEdge,edges)->dfa_toNode->reachesTrm;
}
for (nodes = reg->Nodes; !empty(nodes); nodes = rst(nodes))
{ faNode nod = fst(faNode,nodes);
changed |= (nod->reachesNxt != nod->reachesTrm);
nod->reachesTrm |= nod->reachesNxt;
}
}
}
static List(dfaEdge) combineRanges(List(dfaEdge) edges)
/* combines ranges if possible */
{ dfaEdge e1, e2; List(dfaEdge) rest;
if (empty(edges) || empty(rst(edges))) return edges;
rest = combineRanges(rst(edges));
*rst_ref(edges) = rest;
e1 = fst(dfaEdge,edges);
e2 = fst(dfaEdge,rst(edges));
if (e1->dfa_upper+1 != e2->dfa_lower || e1->dfa_toNode != e2->dfa_toNode)
return edges;
/* combine */
e2->dfa_lower = e1->dfa_lower;
FreeMem(e1); FreeMem(edges);
return rest;
}
static void reduceGraph(RegSet_T g)
/* reduce graph g */
{ List(faNode) nods, *nodsp; int i;
/* initialize marks */
for (nods = RegSet_IMP(g)->Nodes; !empty(nods); nods = rst(nods))
{ faNode nod = fst(faNode,nods);
nod->reachesTrm = (nod->term > 0);
nod->reachesNxt = (nod->term > 0);
}
/* mark */
reachNodes(RegSet_IMP(g));
fst(faNode,RegSet_IMP(g)->Nodes)->reachesTrm = True;
/* remove all edges leading to blind states */
for (nods = RegSet_IMP(g)->Nodes; !empty(nods); nods = rst(nods))
{ faNode nod = fst(faNode,nods); List(dfaEdge) *edges;
for (edges = &nod->Edges; !empty(*edges); )
{ dfaEdge edge = fst(dfaEdge,*edges);
if (!edge->dfa_toNode->reachesTrm)
{ List(dfaEdge) here = *edges;
*edges = rst(*edges); FreeMem(edge); FreeMem(here);
}
else
edges = rst_ref(*edges);
}
nod->Edges = combineRanges(nod->Edges);
}
/* remove all blind states */
for (i = 0, nodsp = &RegSet_IMP(g)->Nodes; !empty(*nodsp); )
{ faNode nod = fst(faNode,*nodsp);
if (!nod->reachesTrm)
{ List(faNode) here = *nodsp; *nodsp = rst(*nodsp); FreeMem(here); FreeMem(nod); }
else
{ nod->id = i; i += 1; nodsp = rst_ref(*nodsp); }
}
}
/* -- graph minimation -- */
/* Ziel: der Graph enthaelt keine aequivalenten Zustaende */
/* Methode: entferne alle aequivalenten Zustaende */
#define currEquiv flag1
#define prevEquiv flag2
static faNode findNode(RegSet_T g, int NodeId)
{ List(faNode) nods;
for (nods = RegSet_IMP(g)->Nodes; !empty(nods); nods = rst(nods))
if ( fst(faNode,nods)->id == NodeId )
return fst(faNode,nods);
C_BUG; return NULL; /* dummy */
}
static bool sameEquiv(List(faNode) nods)
/* copy curr to prev; return true if all same */
{ bool res = True;
for (; !empty(nods); nods = rst(nods))
{ faNode nod = fst(faNode,nods);
res = res && (nod->prevEquiv == nod->currEquiv);
nod->prevEquiv = nod->currEquiv;
}
return res;
}
static bool sameEquivClass(List(dfaEdge) edgs1, List(dfaEdge) edgs2)
/* return if both edge-lists are equivalent relative to prevEquiv */
{ dfaEdge edg1, edg2 ;
Loop1:
if (empty(edgs1) && empty(edgs2)) return True;
if (empty(edgs1) || empty(edgs2)) return False;
edg1 = fst(dfaEdge,edgs1);
edg2 = fst(dfaEdge,edgs2);
if (edg1->dfa_lower != edg2->dfa_lower) return False;
Loop2:
if (edg1->dfa_toNode->prevEquiv != edg2->dfa_toNode->prevEquiv) return False;
if (edg1->dfa_upper == edg2->dfa_upper)
{
edgs1 = rst(edgs1); edgs2 = rst(edgs2);
goto Loop1;
}
else
if (edg1->dfa_upper < edg2->dfa_upper)
{
if (empty(rst(edgs1)) ||
edg1->dfa_upper+1 != ((dfaEdge)rst(edgs1))->dfa_lower)
return False;
edgs1 = rst(edgs1); edg1 = fst(dfaEdge,edgs1);
goto Loop2;
}
else
{
if (empty(rst(edgs2)) ||
edg2->dfa_upper+1 != ((dfaEdge)rst(edgs2))->dfa_lower)
return False;
edgs2 = rst(edgs2); edg2 = fst(dfaEdge,edgs2);
goto Loop2;
}
}
static void minimizeGraph(RegSet_T g)
/* reduce graph g */
{ List(faNode) nods, nods1, nods2, *nodsp; int i;
/* initialize equivalence */
for (nods1 = RegSet_IMP(g)->Nodes; !empty(nods1); nods1 = rst(nods1))
{ faNode nod1 = fst(faNode,nods1), nod2;
for (nods2 = RegSet_IMP(g)->Nodes; !empty(nods2); nods2 = rst(nods2))
{ nod2 = fst(faNode,nods2); if (nod1->term == nod2->term) break; }
nod2 = fst(faNode,nods2);
nod1->prevEquiv = -1; nod1->currEquiv = nod2->id;
}
while (!sameEquiv(RegSet_IMP(g)->Nodes))
{ /* next equivalence */
for (nods1 = RegSet_IMP(g)->Nodes; !empty(nods1); nods1 = rst(nods1))
{ faNode nod1 = fst(faNode,nods1), nod2;
for (nods2 = RegSet_IMP(g)->Nodes; !empty(nods2); nods2 = rst(nods2))
{ nod2 = fst(faNode,nods2);
if (nod1->prevEquiv == nod2->prevEquiv &&
sameEquivClass(nod1->Edges, nod2->Edges))
break;
}
nod2 = fst(faNode,nods2);
nod1->currEquiv = nod2->id;
}
}
/* patch the edges */
for (nods = RegSet_IMP(g)->Nodes; !empty(nods); nods = rst(nods))
{ faNode nod = fst(faNode,nods); List(dfaEdge) edges;
for (edges = nod->Edges; !empty(edges); edges = rst(edges))
{ dfaEdge edge = fst(dfaEdge,edges);
edge->dfa_toNode = findNode(g,edge->dfa_toNode->currEquiv);
}
nod->Edges = combineRanges(nod->Edges);
}
/* drop all equivalents beside first */
for (i = 0, nodsp = &RegSet_IMP(g)->Nodes; !empty(*nodsp); )
{ faNode nod = fst(faNode,*nodsp);
if (nod->currEquiv != nod->id)
{
List(faNode) here = *nodsp; *nodsp = rst(*nodsp);
FreeMem(here); freeDfaNode(nod);
}
else
{ nod->id = i; i += 1; nodsp = rst_ref(*nodsp); }
}
}
static bool hasTerminal(List(faNode) x, RegSet_T a)
/* whether a terminal state of 'a' is in source list 'x' */
{
for (; !empty(x); x = rst(x))
{ faNode nod = fst(faNode,x);
if (nod->Belongs == RegSet_IMP(a) && nod->term > 0)
return True;
}
return False;
}
/* -- graph operations -- */
RegSet_T RegSet_Copy(RegSet_T a)
/* copies regular set 'a' */
{ RegSet_T res; List(faNode) lst;
res = RegSet_Merge( cons(a,NULL), NULL,NULL );
for (lst = RegSet_IMP(res)->Nodes; !empty(lst); lst = rst(lst))
{ faNode nod = fst(faNode,lst);
nod->term = hasTerminal(nod->Source,a);
freeList(nod->Source, freeNothing); nod->Source = NULL;
}
return res;
}
RegSet_T RegSet_Union(RegSet_T a, RegSet_T b)
/* union a | b */
{ RegSet_T res; List(faNode) lst;
if (a == b) return RegSet_Copy(a);
res = RegSet_Merge( cons(a,cons(b, NULL)), NULL,NULL );
for (lst = RegSet_IMP(res)->Nodes; !empty(lst); lst = rst(lst))
{ faNode nod = fst(faNode,lst);
nod->term = hasTerminal(nod->Source,a) || hasTerminal(nod->Source,b);
freeList(nod->Source, freeNothing); nod->Source = NULL;
}
reduceGraph(res); minimizeGraph(res);
return res;
}
RegSet_T RegSet_Intersection(RegSet_T a, RegSet_T b)
/* intersection a ^ b */
{ RegSet_T res; List(faNode) lst;
if (a == b) return RegSet_Copy(a);
res = RegSet_Merge( cons(a,cons(b, NULL)), NULL,NULL );
for (lst = RegSet_IMP(res)->Nodes; !empty(lst); lst = rst(lst))
{ faNode nod = fst(faNode,lst);
nod->term = hasTerminal(nod->Source,a) && hasTerminal(nod->Source,b);
freeList(nod->Source, freeNothing); nod->Source = NULL;
}
reduceGraph(res); minimizeGraph(res);
return res;
}
RegSet_T RegSet_Difference(RegSet_T a, RegSet_T b)
/* difference a - b */
{ RegSet_T res; List(faNode) lst;
if (a == b) return RegSet_Empty();
res = RegSet_Merge( cons(a,cons(b, NULL)), NULL,NULL );
for (lst = RegSet_IMP(res)->Nodes; !empty(lst); lst = rst(lst))
{ faNode nod = fst(faNode,lst);
nod->term = hasTerminal(nod->Source,a) && !hasTerminal(nod->Source,b);
freeList(nod->Source, freeNothing); nod->Source = NULL;
}
reduceGraph(res); minimizeGraph(res);
return res;
}
RegSet_T RegSet_Concat(RegSet_T a, RegSet_T b)
/* concatenation a b */
{ RegSet_T res,c; List(faNode) lst;
c = (a == b) ? RegSet_Copy(a) : b;
res = RegSet_Merge( cons(a,NULL), a,c );
for (lst = RegSet_IMP(res)->Nodes; !empty(lst); lst = rst(lst))
{ faNode nod = fst(faNode,lst);
nod->term = hasTerminal(nod->Source,b);
freeList(nod->Source, freeNothing); nod->Source = NULL;
}
if (a==b) RegSet_Free(c);
reduceGraph(res);
minimizeGraph(res);
return res;
}
RegSet_T RegSet_Star(RegSet_T a)
/* iteration { a } */
{ RegSet_T res; List(faNode) lst;
res = RegSet_Merge( cons(a,NULL), a,a );
for (lst = RegSet_IMP(res)->Nodes; !empty(lst); lst = rst(lst))
{ faNode nod = fst(faNode,lst);
nod->term = hasTerminal(nod->Source,a) ||
fst(faNode,nod->Source) == fst(faNode,RegSet_IMP(a)->Nodes);
freeList(nod->Source, freeNothing); nod->Source = NULL;
}
reduceGraph(res); minimizeGraph(res);
return res;
}
/* -- combinations -- */
RegSet_T RegSet_CsetN(wc_string s,int len)
/* character set '...'[0:len) */
{
if (len > 0)
{ RegSet_T a = RegSet_Char((wc_char)(0xffffffffUL & ((unsigned long)s[0])));
RegSet_T b = RegSet_CsetN(s+1,len-1);
RegSet_T c = RegSet_Union(a, b);
RegSet_Free(a); RegSet_Free(b);
return c;
}
else
return RegSet_Empty();
}
RegSet_T RegSet_Cset(wc_string s)
/* character set '...' */
{
return RegSet_CsetN(s,WCStrLen(s));
}
RegSet_T RegSet_StringN(wc_string s,int len)
/* character sequence / string "..."[0:len) */
{
if (len > 0)
{ RegSet_T a = RegSet_Char((wc_char)(0xffffffffUL & ((unsigned long)s[0])));
RegSet_T b = RegSet_StringN(s+1,len-1);
RegSet_T c = RegSet_Concat(a, b);
RegSet_Free(a); RegSet_Free(b);
return c;
}
else
return RegSet_Epsilon();
}
RegSet_T RegSet_String(wc_string s)
/* character sequence / string "..." */
{
return RegSet_StringN(s,WCStrLen(s));
}
RegSet_T RegSet_Option(RegSet_T a)
/* option [ a ] */
{ RegSet_T b = RegSet_Epsilon();
RegSet_T c = RegSet_Union(a,b);
RegSet_Free(b);
return c;
}
RegSet_T RegSet_Plus(RegSet_T a)
/* iteration a + */
{ RegSet_T b = RegSet_Star(a);
RegSet_T c = RegSet_Concat(a,b);
RegSet_Free(b);
return c;
}
RegSet_T RegSet_Plus_ntimes(RegSet_T a, int n)
/* iteration { a } n-times, n >= 0 */
{ RegSet_T res = RegSet_Epsilon();
int i;
for( i=0; i < n; ++i )
{ RegSet_T c = RegSet_Concat(res,a);
RegSet_Free(res);
res = c;
}
return res;
}
RegSet_T RegSet_Plus_range(RegSet_T a, int lwr, int upr)
/* iteration { a } lwr-times .. upr-times, lwr >= 0, upr >= 0 */
{ RegSet_T res = RegSet_Plus_ntimes(a,lwr);
int i;
for( i=lwr+1; i <= upr; ++i )
{ RegSet_T b = RegSet_Option(a);
RegSet_T c = RegSet_Concat(res,b);
RegSet_Free(b);
RegSet_Free(res);
res = c;
}
return res;
}
bool RegSet_isChar(RegSet_T a)
/* a = 'x' ? */
{ faNode s0 = fst(faNode,RegSet_IMP(a)->Nodes);
bool res = !empty(rst(RegSet_IMP(a)->Nodes))
&& empty(rst(rst(RegSet_IMP(a)->Nodes)))
&& !empty(s0->Edges) && empty(rst(s0->Edges));
dfaEdge e = res ? fst(dfaEdge,s0->Edges) : NULL;
return res && e->dfa_lower == e->dfa_upper;
}
wc_char RegSet_charVal(RegSet_T a)
/* x; assertion: a = 'x' */
{ wc_char res;
bug0( RegSet_isChar(a), "single character set requiered" );
res = fst(dfaEdge,fst(faNode,RegSet_IMP(a)->Nodes)->Edges)->dfa_lower;
return res;
}
/*I----------------------- Scanner production ----------------------------- */
/* -- The Production Of The Scanner -- */
struct DefinedGraphs
{
string name;
int usage;
RegSet_T value;
};
#define MAX_ENTRIES 100
ExternalType(ScnDfn_T) /* Scanner production handle */
{
struct DefinedGraphs Table[MAX_ENTRIES];
int topEntry;
string Scn_name;
scn_t dyckpat[MAX_ENTRIES];
bool ConflictFlag;
void (*prMsg)(c_string msg);
};
static ConcreteImp(ScnDfn_T) CurScnDfn; /* current scanner production */
static bool Scn_defining = False;
static void Scn_dfnBegin_aux(ScnDfn_T scndfn, string name, c_bool* defining)
{
bug0(!(*defining),"already defining a scanner");
scndfn->Scn_name = StrCopy(name);
*defining = C_True;
scndfn->prMsg = (void (*)(c_string msg))NULL;
scndfn->topEntry = 1;
scndfn->dyckpat[0] = (scn_t)NULL;
scndfn->Table[0].name = SCN_TOK_Other;
scndfn->Table[0].usage = 0;
scndfn->Table[0].value = (RegSet_T)NULL;
/*
scndfn->topEntry = 2;
scndfn->dyckpat[1] = (scn_t)NULL;
scndfn->Table[1].name = StrCopy("[empty]");
scndfn->Table[1].usage = 0;
scndfn->Table[1].value = RegSet_Epsilon();
*/
}
void Scn_dfnBegin(string name)
/* begins a scanner definition;
uses 'name' as identifier
*/
{
Scn_dfnBegin_aux(&CurScnDfn,name,&Scn_defining);
}
ScnDfn_T Scn_dfnBegin_reentrant(string name)
/* reentrant version of Scn_dfnBegin */
{ ScnDfn_T scndfn = New(ScnDfn_T);
c_bool defining = C_False;
Scn_dfnBegin_aux(scndfn,name,&defining);
return scndfn;
}
void Scn_setMsgFun(void (*prMsg)(c_string msg))
/* defines 'prMsg' as default message function */
{
CurScnDfn.prMsg = prMsg;
}
void Scn_setMsgFun_reentrant(ScnDfn_T curdfn, void (*prMsg)(c_string msg))
/* reentrant version of Scn_setMsgFun */
{
BUG_NULL(curdfn);
curdfn->prMsg = prMsg;
}
static void Scn_dfnToken_aux
(
ScnDfn_T scndfn,
string name, byte tok_flags, RegSet_T value,
c_bool defining
)
{ int i;
bug0(defining,"missing Scn_dfnBegin");
for (i = 1; i < scndfn->topEntry; i++)
bug1(strcmp(scndfn->Table[i].name,name), "duplicate name \'%s\'", name);
bug0(scndfn->topEntry < MAX_ENTRIES, "too many tokens defined");
scndfn->Table[scndfn->topEntry].name = StrCopy(name);
scndfn->Table[scndfn->topEntry].usage = tok_flags;
if( value != (RegSet_T)NULL )
scndfn->Table[scndfn->topEntry].value = RegSet_Copy(value);
else
scndfn->Table[scndfn->topEntry].value = (RegSet_T)NULL;
scndfn->dyckpat[scndfn->topEntry] = (scn_t)NULL;
scndfn->topEntry += 1;
}
void Scn_dfnToken(string name, byte tok_flags, RegSet_T value)
/* adds a new token to the scanner under production
'name' : identifier
'flags': attributes ( see [scn_base] )
'value': regular set
*/
{
Scn_dfnToken_aux(&CurScnDfn,name,tok_flags,value,Scn_defining);
}
void Scn_dfnToken_reentrant
(
ScnDfn_T curdfn, string name, byte tok_flags, RegSet_T value
)
/* reentrant version of Scn_dfnToken */
{
BUG_NULL(curdfn);
Scn_dfnToken_aux(curdfn,name,tok_flags,value,C_True);
}
void Scn_dfnDyckToken
(
string name, byte tok_flags,
RegSet_T left, Scn_T dyck
)
/* adds a new dyck token to the scanner under production;
consumes 'dyck'
'name' : identifier
'flags': attributes ( see [scn_base] )
'left' : regular set for left paranthesis
'dyck' : dyck scanner ( left, inner and right token )
*/
{ scn_t scn = Scn_IMP(dyck);
Scn_dfnToken_aux(&CurScnDfn,name,tok_flags,left,Scn_defining);
CurScnDfn.dyckpat[CurScnDfn.topEntry-1] =
/*( scn == (scn_t)NULL ) ? (scn_t)NULL :*/ scn;
}
void Scn_dfnDyckToken_reentrant
(
ScnDfn_T curdfn, string name, byte tok_flags,
RegSet_T left, Scn_T dyck
)
/* reentrant version of Scn_dfnToken */
{ scn_t scn = Scn_IMP(dyck);
BUG_NULL(curdfn);
Scn_dfnToken_aux(curdfn,name,tok_flags,left,C_True);
curdfn->dyckpat[curdfn->topEntry-1] =
/*( scn == (scn_t)NULL ) ? (scn_t)NULL :*/ scn;
}
static void pConflicts(ScnDfn_T scndfn, List(faNode) nodes)
{
if (length(nodes) > 1)
{ void (*prMsg)(c_string msg) = scndfn->prMsg;
if( prMsg == (void (*)(c_string msg))NULL )
prMsg = prMsg_stderr;
scndfn->ConflictFlag = True;
(*prMsg)("Conflict between ");
for (;!empty(nodes); nodes = rst(nodes))
{ faNode node = fst(faNode,nodes);
(*prMsg)("'");
(*prMsg)(scndfn->Table[node->Belongs->id].name);
(*prMsg)("'");
if (length(nodes) > 1)
{
if (length(nodes) == 2)
(*prMsg)(" and ");
else
(*prMsg)(", ");
}
}
(*prMsg)(".\n");
}
}
static List(faNode) terminalSource(List(faNode) nodes)
/* removes all non-terminal states from the source of a node */
{
if(empty(nodes))
return nodes;
else
{ List(faNode) r = terminalSource(rst(nodes));
if( fst(faNode,nodes)->term )
{ *rst_ref(nodes) = r; return nodes; }
else
{ FreeMem(nodes); return r; }
}
}
static void terminalScanner(ScnDfn_T scndfn, RegSet_T graph)
/* removes all non-terminal states from the sources of a graph */
{ List(faNode) nodes = RegSet_IMP(graph)->Nodes;
for (; !empty(nodes); nodes = rst(nodes))
{ faNode node = fst(faNode,nodes);
node->Source = terminalSource(node->Source);
node->term = empty(node->Source)
? 0
: fst(faNode,node->Source)->Belongs->id;
pConflicts(scndfn,node->Source);
}
}
/* new version of scanner table production */
static Scn_T ScnTable (ScnDfn_T scndfn, RegSet_T scanner)
{ int i, j, edgcnt, dyckcnt, states = length(RegSet_IMP(scanner)->Nodes);
long *StaEdg;
short *StaFin;
wc_char *EdgeC;
long *EdgeS;
List(faNode) nodes; List(dfaEdge) edges;
wc_char clow;
scn_t res;
/* count edges */
edgcnt = 0;
for (nodes = RegSet_IMP(scanner)->Nodes; !empty(nodes); nodes = rst(nodes))
{ faNode node = fst(faNode,nodes);
clow = 0;
for (edges = node->Edges; !empty(edges); edges = rst(edges))
{ dfaEdge edge = fst(dfaEdge,edges);
edgcnt += (clow < edge->dfa_lower)+1;
clow = edge->dfa_upper+1;
}
if (clow < SCN_CHAR_SET_SIZE) edgcnt += 1;
}
/*
assert0
(
(((long)edgcnt) & 0xFFFF0000L) == 0,
"Too many edges. Reduce token complexity"
);
*/
/* count dyck tokens */
dyckcnt = 0;
for( i=0; i < scndfn->topEntry; ++i )
if( scndfn->dyckpat[i] != (scn_t)NULL )
++dyckcnt;
/* make edges and states */
StaEdg = (long* )NewMem( (states+1) * sizeof(long ) );
StaFin = (short* )NewMem( states * sizeof(short ) );
EdgeC = (wc_char*)NewMem( edgcnt * sizeof(wc_char) );
EdgeS = (long* )NewMem( edgcnt * sizeof(long ) );
edgcnt = 0;
for (nodes = RegSet_IMP(scanner)->Nodes; !empty(nodes); nodes = rst(nodes))
{ faNode node = fst(faNode,nodes);
StaEdg[node->id] = edgcnt;
StaFin[node->id] = node->term;
clow = 0;
for (edges = node->Edges; !empty(edges); edges = rst(edges))
{ dfaEdge edge = fst(dfaEdge,edges);
if (clow < edge->dfa_lower)
{
EdgeC[edgcnt] = clow; EdgeS[edgcnt] = 0; edgcnt += 1;
}
EdgeC[edgcnt] = edge->dfa_lower;
EdgeS[edgcnt] = edge->dfa_toNode->id+1;
clow = edge->dfa_upper+1;
edgcnt += 1;
}
if (clow < SCN_CHAR_SET_SIZE)
{
EdgeC[edgcnt] = clow; EdgeS[edgcnt] = 0; edgcnt += 1;
}
for (i = 0; i < (edgcnt-StaEdg[node->id])/2; i ++)
{ wc_char t;
t = EdgeC[StaEdg[node->id]+i];
EdgeC[StaEdg[node->id]+i] = EdgeC[edgcnt-1-i];
EdgeC[edgcnt-1-i] = t;
t = (wc_char)EdgeS[StaEdg[node->id]+i];
EdgeS[StaEdg[node->id]+i] = EdgeS[edgcnt-1-i];
EdgeS[edgcnt-1-i] = t;
}
}
StaEdg[states] = edgcnt;
/* make scanner structure */
res = New(scn_t);
res->Name = scndfn->Scn_name;
res->States = states;
res->Tokens = scndfn->topEntry;
res->StaEdg = StaEdg;
res->StaFin = StaFin;
res->EdgeC = EdgeC;
res->EdgeS = EdgeS;
res->TokId = (string*)NewMem((scndfn->topEntry) * sizeof(string));
res->Flags = (byte *)NewMem((scndfn->topEntry) * sizeof(byte));
res->Groups = 0;
res->GrpScn = (scn_t*)NULL;
res->Switch = (short*)NULL;
res->dyckcnt = dyckcnt;
res->dyckidx = dyckcnt > 0
? (short*)NewMem(dyckcnt * sizeof(short))
: (short*)NULL;
res->dyckpat = dyckcnt > 0
? (scn_t*)NewMem(dyckcnt * sizeof(scn_t))
: (scn_t*)NULL;
for (i = 0; i < scndfn->topEntry; i++)
res->TokId[i] = StrCopy(scndfn->Table[i].name);
for (i = 0; i < scndfn->topEntry; i++)
res->Flags[i] = scndfn->Table[i].usage;
for (i=0, j=0; i < scndfn->topEntry && j < dyckcnt; i++)
{
if( scndfn->dyckpat[i] != (scn_t)NULL )
{
res->dyckpat[j] = scndfn->dyckpat[i];
res->dyckidx[j] = (short)i;
j++;
}
}
/* free temporaries */
RegSet_Free(scanner);
/* done */
return Scn_ADT(res);
}
/* -- graph printer -- */
static void pGraphList
(
List(Abs_T) x, int Indent,
void (*pMember)(Abs_T x, StdCPtr any), StdCPtr any
)
{ void (*prMsg)(c_string msg) = ((ScnDfn_T)any)->prMsg;
char buf[STD_BUFFLEN+1]; int i;
if( prMsg == (void (*)(c_string msg))NULL )
prMsg = prMsg_stdout;
(*prMsg)("[");
if (Indent >= 0 && !empty(x))
{
sprintf(buf,"\n%*s",Indent,"");
(*prMsg)(buf);
}
for (i = 0; !empty(x); x = rst(x), i +=1 )
{
(*pMember)(fst(Abs_T,x),any);
if (!empty(rst(x)))
if (Indent >= 0 || (i+1) % 4 == 0)
{ (*prMsg)(",");
sprintf(buf,"\n%*s",(Indent>=0?Indent:7),"");
(*prMsg)(buf);
}
else
(*prMsg)(", ");
else
if (Indent >= 0)
{
sprintf(buf,"\n%*s",Indent,"");
(*prMsg)(buf);
}
}
(*prMsg)("]");
}
static void pSource(faNode x, ScnDfn_T scndfn)
{ void (*prMsg)(c_string msg) = scndfn->prMsg;
char buf[STD_BUFFLEN+1];
if( prMsg == (void (*)(c_string msg))NULL )
prMsg = prMsg_stdout;
sprintf(buf,"%d(", x->Belongs->id);
(*prMsg)(buf);
(*prMsg)(scndfn->Table[x->Belongs->id].name);
(*prMsg)(")");
}
static void pChar(wc_char wc, ScnDfn_T scndfn)
{ byte c = (byte)wc;
void (*prMsg)(c_string msg) = scndfn->prMsg;
char buf[STD_BUFFLEN+1];
if( prMsg == (void (*)(c_string msg))NULL )
prMsg = prMsg_stdout;
if( ((wc_char)c) == wc )
switch (c)
{
case ' ' : sprintf(buf,"\\_"); break;
case '\f' : sprintf(buf,"\\p"); break;
case '\n' : sprintf(buf,"\\n"); break;
case '\r' : sprintf(buf,"\\r"); break;
case '\\' :
case '\'' :
case '\"' :
case '`' : sprintf(buf,"\\%c",c); break;
//default : if (32 < c && c < 127)
default : if ( isascii(c) && isprint(c) )
sprintf(buf,"%c",c);
else
sprintf(buf,"%02x",c);
}
else
sprintf(buf,"%08lx",(long unsigned int)wc);
(*prMsg)(buf);
}
static void pEdge(dfaEdge x, ScnDfn_T scndfn)
{ void (*prMsg)(c_string msg) = scndfn->prMsg;
char buf[STD_BUFFLEN+1];
if( prMsg == (void (*)(c_string msg))NULL )
prMsg = prMsg_stdout;
(*prMsg)("(");
if (x->dfa_lower != x->dfa_upper)
{ pChar(x->dfa_lower,scndfn); (*prMsg)(" - "); }
else
(*prMsg)(" ");
pChar(x->dfa_upper,scndfn);
sprintf(buf," : %2d)", x->dfa_toNode->id );
(*prMsg)(buf);
}
static void pNfaEdge(nfaEdge x, ScnDfn_T scndfn)
{ byte cl = (byte)x->nfa_lower,
cu = (byte)x->nfa_upper;
void (*prMsg)(c_string msg) = scndfn->prMsg;
char buf[STD_BUFFLEN+1];
if( prMsg == (void (*)(c_string msg))NULL )
prMsg = prMsg_stdout;
if( ((wc_char)cl) == x->nfa_lower && ((wc_char)cu) == x->nfa_upper )
{
(*prMsg)("({\'");
pChar(x->nfa_lower,scndfn);
(*prMsg)("\'..\'");
pChar(x->nfa_upper,scndfn);
(*prMsg)("\'}");
}
else
{
sprintf
(
buf,"({%08lx..%08lx}, ",
(long unsigned int)x->nfa_lower, (long unsigned int)x->nfa_upper
);
(*prMsg)(buf);
}
pGraphList(x->nfa_toNodes,-1,(void (*)(Abs_T x,StdCPtr any))pSource,scndfn);
(*prMsg)(")");
}
static void pNfaEdges(List(nfaEdge) x, ScnDfn_T scndfn)
{
pGraphList(x,-1,(void (*)(Abs_T x,StdCPtr any))pNfaEdge,scndfn);
}
static void pNode(faNode x, ScnDfn_T scndfn)
{ void (*prMsg)(c_string msg) = scndfn->prMsg;
char buf[STD_BUFFLEN+1];
if( prMsg == (void (*)(c_string msg))NULL )
prMsg = prMsg_stdout;
sprintf(buf,"%2d %2d ", x->id, x->term);
(*prMsg)(buf);
sprintf(buf,"(%2d %2d) ", x->flag1, x->flag2);
(*prMsg)(buf);
pGraphList(x->Source,-1,(void (*)(Abs_T x,StdCPtr any))pSource,scndfn);
(*prMsg)("\n ");
pGraphList(x->Edges,-1,(void (*)(Abs_T x,StdCPtr any))pEdge,scndfn);
}
void RegSet_Print(RegSet_T x)
/* prints regular set to stdout; for debugging */
{ void (*prMsg)(c_string msg) = CurScnDfn.prMsg;
char buf[STD_BUFFLEN+1];
if( prMsg == (void (*)(c_string msg))NULL )
prMsg = prMsg_stdout;
sprintf(buf,"RegSet_T %d =\n",RegSet_IMP(x)->id);
(*prMsg)(buf);
pGraphList
(
RegSet_IMP(x)->Nodes,0,(void (*)(Abs_T x,StdCPtr any))pNode,&CurScnDfn
);
(*prMsg)("\n");
}
void RegSet_Print_reentrant(ScnDfn_T curdfn, RegSet_T x)
/* reentrant version of RegSet_Print */
{ void (*prMsg)(c_string msg);
char buf[STD_BUFFLEN+1];
BUG_NULL(curdfn);
prMsg = curdfn->prMsg;
if( prMsg == (void (*)(c_string msg))NULL )
prMsg = prMsg_stdout;
sprintf(buf,"RegSet_T %d =\n",RegSet_IMP(x)->id);
(*prMsg)(buf);
pGraphList(RegSet_IMP(x)->Nodes,0,(void (*)(Abs_T x,StdCPtr any))pNode,curdfn);
(*prMsg)("\n");
}
static Scn_T Scn_dfnEnd_aux
(
ScnDfn_T scndfn, c_bool diagnose, c_bool* defining
)
{ int i; List(RegSet_Ts) graphs = NULL;
RegSet_T scanner; Scn_T scn;
bug0((*defining),"no definition");
for (i = 1; i < scndfn->topEntry; i++)
{
if( scndfn->Table[i].value != (RegSet_T)NULL )
{
graphs = cons(scndfn->Table[i].value,graphs);
fst(regset_t,graphs)->id = i;
}
}
scndfn->ConflictFlag = False;
scanner = RegSet_Merge(graphs, NULL,NULL);
terminalScanner(scndfn,scanner);
bug0(!scndfn->ConflictFlag,"aborted due to conflicts");
if (diagnose) RegSet_Print_reentrant(scndfn,scanner);
scn = ScnTable(scndfn,scanner);
for (i = 1; i < scndfn->topEntry; i++)
{
FreeMem(scndfn->Table[i].name);
if( scndfn->Table[i].value != (RegSet_T)NULL )
RegSet_Free(scndfn->Table[i].value);
}
*defining = C_False;
return scn;
}
Scn_T Scn_dfnEnd(bool diagnose)
/* completes and creates scanner definition
diagnose --> prints scanner definiton
*/
{
return Scn_dfnEnd_aux(&CurScnDfn,diagnose,&Scn_defining);
}
Scn_T Scn_dfnEnd_reentrant(ScnDfn_T curdfn, bool diagnose)
/* reentrant version of Scn_dfnEnd;
consumes 'curdfn'
*/
{ c_bool defining = C_True;
Scn_T scn = (Scn_T)NULL;
BUG_NULL(curdfn);
scn = Scn_dfnEnd_aux(curdfn,diagnose,&defining);
FreeMem(curdfn);
return scn;
}
/*I----------------------- Scanner group production ------------------------ */
#define MAX_GROUP_ENTRIES 50
Scn_T ScnGrp_dfnBegin(c_string name)
/* begins a scanner group definition;
uses 'name' as identifier
*/
{ scn_t res;
res = New(scn_t);
res->Name = StrCopy(name);
res->States = 0;
res->Tokens = 0;
res->StaEdg = (long* )NULL;
res->StaFin = (short* )NULL;
res->EdgeC = (wc_char* )NULL;
res->EdgeS = (long* )NULL;
res->TokId = (string* )NULL;
res->Flags = (byte* )NULL;
res->Groups = 0;
res->GrpScn = (scn_t* )NewMem(sizeof(scn_t)*MAX_GROUP_ENTRIES);
res->Switch = (short* )NULL;
res->dyckcnt = 0;
res->dyckidx = (short* )NULL;
res->dyckpat = (scn_t* )NULL;
return res;
}
void ScnGrp_dfnScanner(Scn_T group, Scn_T scanner)
/* adds 'scanner' to 'group'; consumes 'scanner' */
{ scn_t g = Scn_IMP(group), s = Scn_IMP(scanner);
int i;
BUG_NULL(g); BUG_NULL(s);
bug1(s->Groups == 0,"scanner group '%s' not allowed",s->Name);
bug1(s->Switch == (short*)NULL,"scanner '%s' already in group",s->Name);
bug0(g->Groups < MAX_GROUP_ENTRIES,"too many scanner defined");
for( i=0; i < g->Groups; ++i )
{
bug1
(
strcmp(g->GrpScn[i]->Name,s->Name),
"scanner with name '%s' already defined",s->Name
);
}
g->GrpScn[g->Groups] = s;
g->Groups += 1;
s->Switch = (short*)NewMem(sizeof(short)*s->Tokens);
for( i=0; i < s->Tokens; ++i ) s->Switch[i] = -1;
}
void ScnGrp_dfnSwitch(Scn_T group, c_string from, c_string token, c_string to)
/* adds context switch information for 'group';
'token' in scanner 'from' switches to scanner 'to'
*/
{ scn_t g = Scn_IMP(group);
int sfidx = -1, stidx = -1, i;
BUG_NULL(g);
for( i=0; i < g->Groups; ++i )
{
if( !strcmp(g->GrpScn[i]->Name,from) )
sfidx = i;
if( !strcmp(g->GrpScn[i]->Name,to) )
stidx = i;
if( sfidx >= 0 && stidx >= 0 ) break;
}
assert0( sfidx >= 0 && stidx >= 0, "scanner not found" );
for( i=0; i < g->GrpScn[sfidx]->Tokens; ++i )
{
if( !strcmp(g->GrpScn[sfidx]->TokId[i],token) )
{
g->GrpScn[sfidx]->Switch[i] = stidx; break;
}
}
assert0( i < g->GrpScn[sfidx]->Tokens, "token not found" );
}
int ScnGrp_dfnEnd(Scn_T group)
/* completes definition for 'group';
returns number of unreachable scanners
*/
{ scn_t g = Scn_IMP(group);
short* glink; int res = 0, i, j;
BUG_NULL(g);
glink = (short*)NewMem(sizeof(short)*g->Groups);
for( i=0; i < g->Groups; ++i )
{
glink[i] = ( i == 0 );
}
for( i=0; i < g->Groups; ++i )
{
for( j=0; j < g->GrpScn[i]->Tokens; ++j )
{
if( g->GrpScn[i]->Switch[j] >= 0 )
glink[g->GrpScn[i]->Switch[j]] = 1;
}
}
for( i=0; i < g->Groups; ++i )
{
if( glink[i] == 0 ) ++res;
}
FreeMem(glink);
return res;
}
styx-2.0.1/libstyx/reg_exp.c 0000666 0001750 0001750 00000037227 12103501533 012745 0000000 0000000 /* ------------------------------------------------------------------------ */
/* */
/* [reg_exp.c] Regular Expression Evaluation */
/* */
/* Copyright (c) 1999 by D\olle, Manns */
/* ------------------------------------------------------------------------ */
#include "standard.h"
#include "symbols.h"
#include "scn_base.h"
#include "scn_imp.h"
#include "scn_gen.h"
#include "literal.h"
#include "otab.h"
#include "hmap.h"
#include "hset.h"
#include "sink.h"
#include "gstream.h"
#include "rexp_lim.h"
/*!
[reg_exp] implements a regular expression evaluator based on the
following regular expression syntax.
Literal
- printable extended ascii character without quotes
( quotes = { "'`\ } )
- \ quote
- \r, \n, \t
- \ hexdigit hexdigit
( single byte character )
- \ (x|X) hexdigit hexdigit hexdigit hexdigit hexdigit hexdigit hexdigit hexdigit
( ucs4 character )
Construction
| Character set | ' Literal ... ' |
| String | " Literal ... " |
| Any character | . |
| Character range |
Expression .. Expression
( single character expressions ) |
| Subexpression | ( Expression ) |
| Option | [ Expression ] |
| | Expression ? |
| Iteration ( 0.. ) | { Expression } |
| | Expression * |
| Iteration ( 1.. ) | Expression + |
| Iteration ( n ) | Expression Number |
| Iteration ( n..m ) | Expression Number, Number |
| Union | Expression | Expression |
| Difference | Expression - Expression |
| Concatenation | Expression Expression |
*/
/*I-------------------- Types ------------------------------------------- */
ExternalType(Reg_T) // Abstract regular expression evaluation type
{
Scn_T pRScn; // common Regular Expression Scanner
Scn_T pVScn; // special Regular Expression Scanner
};
/*I-------------------- Creating & Disposing ---------------------------- */
static RegSet_T REG_String(c_string s)
{ RegSet_T reg; long len; c_bool ucs4;
wc_string tstring = LIT_styx_lit_str(&len,s,&ucs4);
reg = RegSet_StringN(tstring,len);
FreeMem(tstring);
return reg;
}
static RegSet_T REG_Cset(c_string s)
{ RegSet_T reg; long len; c_bool ucs4;
wc_string tstring = LIT_styx_lit_str(&len,s,&ucs4);
reg = RegSet_CsetN(tstring,len);
FreeMem(tstring); return reg;
}
static RegSet_T REG_self(RegSet_T pRegSet)
{
return pRegSet;
}
static RegSet_T REG_plus(RegSet_T pRegSet)
{ RegSet_T pRes = RegSet_Plus(pRegSet);
RegSet_Free(pRegSet);
return pRes;
}
static RegSet_T REG_option(RegSet_T pRegSet)
{ RegSet_T pRes = RegSet_Option(pRegSet);
RegSet_Free(pRegSet);
return pRes;
}
static RegSet_T REG_star(RegSet_T pRegSet)
{ RegSet_T pRes = RegSet_Star(pRegSet);
RegSet_Free(pRegSet);
return pRes;
}
static RegSet_T REG_concat(RegSet_T pLeft, RegSet_T pRight)
{
if( pLeft == (RegSet_T)NULL ) return pRight;
else
if( pRight == (RegSet_T)NULL ) return pLeft;
else
{ RegSet_T pRes = RegSet_Concat(pLeft,pRight);
RegSet_Free(pLeft); RegSet_Free(pRight);
return pRes;
}
}
static RegSet_T REG_diff(RegSet_T pLeft, RegSet_T pRight)
{ RegSet_T pRes = RegSet_Difference(pLeft,pRight);
RegSet_Free(pLeft); RegSet_Free(pRight);
return pRes;
}
static RegSet_T REG_union(RegSet_T pLeft, RegSet_T pRight)
{ RegSet_T pRes = RegSet_Union(pLeft,pRight);
RegSet_Free(pLeft); RegSet_Free(pRight);
return pRes;
}
static RegSet_T REG_range(RegSet_T pLeft, RegSet_T pRight)
{ RegSet_T pRes = (RegSet_T)NULL;
wc_char al, bu, x;
if(RegSet_isChar(pLeft) && RegSet_isChar(pRight))
{
al = RegSet_charVal(pLeft);
bu = RegSet_charVal(pRight);
if (al > bu)
{
x = al; al = bu; bu = x;
}
pRes = RegSet_Range(al,bu);
}
RegSet_Free(pLeft); RegSet_Free(pRight);
return pRes;
}
static RegSet_T REG_sigma(void)
/* FIXME: charset size */
{
return RegSet_Range((wc_char)0,(wc_char)((wc_char)(SCN_CHAR_SET_SIZE)-(wc_char)1));
}
static RegSet_T REG_plus_limited(RegSet_T pRegSet, int nMax)
{ RegSet_T pRes = RegSet_Plus_ntimes(pRegSet,nMax);
RegSet_Free(pRegSet);
return pRes;
}
static RegSet_T REG_plus_range(RegSet_T pRegSet, int nMin, int nMax)
{ RegSet_T pRes = (RegSet_T)NULL;
if( pRegSet != (RegSet_T)NULL )
{ int nI;
pRes = REG_plus_limited(RegSet_Copy(pRegSet),nMin);
for( nI=nMin+1; nI <= nMax; ++nI )
{ RegSet_T pTmp = REG_option(RegSet_Copy(pRegSet));
pRes = REG_concat(pRes,pTmp);
}
RegSet_Free(pRegSet);
}
return pRes;
}
static void REG_freeExps(ROW(RegSet_T) pRegRow)
{ long lCnt = OT_CNT(pRegRow), lI;
for( lI=0; lI < lCnt; ++lI )
RegSet_Free(OT_GET(RegSet_T,pRegRow,lI));
OT_CLEAR(pRegRow);
}
static RegSet_T REG_consExps(ROW(RegSet_T) pRegRow)
{ RegSet_T pRes = (RegSet_T)NULL, pRegSet;
long lCnt = OT_CNT(pRegRow), lI;
if( lCnt == 0 ) pRes = RegSet_Empty();
else
for( lI=0; lI < lCnt; ++lI )
{
pRegSet = OT_GET(RegSet_T,pRegRow,lI);
if( lI > 0 && pRes == (RegSet_T)NULL )
RegSet_Free(pRegSet);
else pRes = REG_concat(pRes,pRegSet);
}
OT_CLEAR(pRegRow);
return pRes;
}
static void REG_getLimits(c_string szToken, int* pnMin, int* pnMax)
{ int nI;
*pnMax = *pnMin = atoi(szToken);
for( nI=0; szToken[nI] != '\0'; ++nI )
if( szToken[nI] == ',' ) break;
if( szToken[nI] != '\0' )
for( ; szToken[nI] != '\0'; ++nI )
if( isdigit(szToken[nI]) ) break;
if( szToken[nI] != '\0' )
*pnMax = atoi(&szToken[nI]);
}
static RegSet_T REG_Exp(Scn_Stream pStream, int cEnd)
{ ROW(RegSet_T) pRegRow = OT_CREATE_ADT(RegSet_T);
RegSet_T (*pBRegFun)(RegSet_T pL, RegSet_T pR) = NULL;
RegSet_T (*pURegFun)(RegSet_T pRegSet) = NULL;
RegSet_T pRes = (RegSet_T)NULL, pRegSet1, pRegSet2;
long lRng = 0;
int cSym = 0;
for(Stream_next(pStream); Stream_ctid(pStream) > 0; Stream_next(pStream))
{ c_string szTxt = symbolToString(Stream_csym(pStream));
/*
if( !Stream_unicode(pStream) ) printf("TXT=%s\n",szTxt);
else GS_fprint_utf8(STDOUT,szTxt,C_True);
*/
if (Stream_ctid(pStream) == 4)
{ int nMin = -1, nMax = -1;
if( OT_CNT(pRegRow) == 0 ) break;
REG_getLimits(szTxt,&nMin,&nMax);
pRegSet1 = OT_TOP(RegSet_T,pRegRow); OT_POP(pRegRow);
pRegSet1 = REG_plus_range(pRegSet1,nMin,nMax);
if( pRegSet1 == (RegSet_T)NULL ) break;
OT_PUSH(pRegSet1,pRegRow);
}
else
if (Stream_ctid(pStream) == 1)
{
if( szTxt[0] == '+' || szTxt[0] == '*' || szTxt[0] == '?' )
{
if( OT_CNT(pRegRow) == 0 ) break;
pRegSet1 = OT_TOP(RegSet_T,pRegRow); OT_POP(pRegRow);
pRegSet1 = szTxt[0]=='+'
? REG_plus(pRegSet1)
: szTxt[0]=='*'
? REG_plus(pRegSet1) : REG_option(pRegSet1);
if( pRegSet1 == (RegSet_T)NULL ) break;
OT_PUSH(pRegSet1,pRegRow);
}
else
if( szTxt[0] == '.' && szTxt[1] == '.' )
{
if( OT_CNT(pRegRow) == 0 ) break;
lRng = OT_CNT(pRegRow)+1;
}
else
if( szTxt[0] == '|' || szTxt[0] == '-' )
{
if( OT_CNT(pRegRow) == 0 ) break;
pBRegFun = szTxt[0] == '|' ? REG_union : REG_diff;
pRegSet1 = REG_consExps(pRegRow);
if( pRegSet1 == (RegSet_T)NULL ) break;
pRegSet2 = REG_Exp(pStream,cEnd);
if( pRegSet2 == (RegSet_T)NULL ) break;
pRegSet1 = (*pBRegFun)(pRegSet1,pRegSet2);
if( pRegSet1 == (RegSet_T)NULL ) break;
OT_PUSH(pRegSet1,pRegRow);
if( cEnd >= 0 ) { cSym = cEnd; break; }
}
else
if( szTxt[0] == '.' )
{
pRegSet1 = REG_sigma();
if( pRegSet1 == (RegSet_T)NULL ) break;
OT_PUSH(pRegSet1,pRegRow);
}
else
{
if( szTxt[0] == '(' ) pURegFun = REG_self;
else
if( szTxt[0] == '{' ) pURegFun = REG_star;
else
if( szTxt[0] == '[' ) pURegFun = REG_option;
else
if( szTxt[0] == ')' || szTxt[0] == '}' || szTxt[0] == ']' )
{
cSym = (int)(szTxt[0]==')'?'(':szTxt[0]=='}'?'{':'['); break;
}
else C_BUG;
pRegSet1 = REG_Exp(pStream, (int)szTxt[0]);
if( pRegSet1 == (RegSet_T)NULL ) break;
pRegSet1 = (*pURegFun)(pRegSet1);
if( pRegSet1 == (RegSet_T)NULL ) break;
OT_PUSH(pRegSet1,pRegRow);
}
}
else
{
pRegSet1 = ( Stream_ctid(pStream) == 2 )
? REG_Cset(szTxt) : REG_String(szTxt);
if( pRegSet1 == (RegSet_T)NULL ) break;
OT_PUSH(pRegSet1,pRegRow);
}
if( lRng == OT_CNT(pRegRow) )
{
pRegSet1 = OT_TOP(RegSet_T,pRegRow); OT_POP(pRegRow);
pRegSet2 = OT_TOP(RegSet_T,pRegRow); OT_POP(pRegRow);
pRegSet1 = REG_range(pRegSet1,pRegSet2);
if( pRegSet1 == (RegSet_T)NULL ) break;
OT_PUSH(pRegSet1,pRegRow);
lRng = 0;
}
}
if( Stream_ctid(pStream) == -1 ) cSym = -1;
/*
printf("RNG=%ld,SYM=%ld,END=%ld\n",lRng,cSym,cEnd);
*/
if( lRng > 0 || cSym != cEnd ) REG_freeExps(pRegRow);
else pRes = REG_consExps(pRegRow);
OT_DEL_T(pRegRow);
return pRes;
}
static Scn_T REG_Scanner
(
Scn_T pRScn, c_string szRegExp, long lLen, c_string szCharSet, c_byte ucFlags
)
{ Scn_Stream pStream = (Scn_Stream)NULL;
RegSet_T pRegSet = (RegSet_T)NULL;
Scn_T pVScn = (Scn_T)NULL;
if( STR_EMPTY(szCharSet) )
{
if( lLen < 0 )
pStream = Stream_string(pRScn, szRegExp);
else
{ c_string szTmp = SubStrCopy(szRegExp,lLen);
pStream = Stream_string(pRScn, szTmp);
FreeMem(szTmp);
}
}
else
{ Scn_Stream_Itr pItr = (Scn_Stream_Itr)NULL;
GStream_T pGS = (GStream_T)NULL;
pGS = GS_stream_string_new(szRegExp,lLen<0?strlen(szRegExp)+1:lLen,szCharSet);
if( pGS != (GStream_T)NULL )
pItr = Stream_Itr_new
(
GS_stream_get_wcrc, GS_fun_destruct(pGS), GS_ucs4_to_utf8,
GS_fun_seek(pGS), pGS, ""
);
if( pItr != (Scn_Stream_Itr)NULL )
{
pStream = Stream_bgn(pRScn,pItr);
Stream_Itr_free(pItr);
}
}
if( pStream != (Scn_Stream)NULL )
{
Stream_defEofId(pStream, -1);
Stream_defErrId(pStream, 0);
Stream_defTokId(pStream, "Opr" , 1);
Stream_defTokId(pStream, "Set" , 2);
Stream_defTokId(pStream, "Seq" , 3);
Stream_defTokId(pStream, "OprEx", 4);
pRegSet = REG_Exp(pStream, -1);
Stream_close(pStream);
Stream_free(pStream);
if( pRegSet != (RegSet_T)NULL )
{
Scn_dfnBegin("REG");
Scn_dfnToken("exp",ucFlags,pRegSet);
pVScn = Scn_dfnEnd(False);
RegSet_Free(pRegSet);
}
}
return pVScn;
}
void REG_drop(Reg_T pReg)
/* removes regular expression evaluator 'pReg' */
{
if( pReg != (Reg_T)NULL )
{
Scn_free(pReg->pRScn);
if( pReg->pVScn != (Scn_T)NULL ) Scn_free(pReg->pVScn);
FreeMem(pReg);
}
}
Reg_T REG_create
(
c_string szRegExp, long lLen,
c_string szCharSet, c_bool bIgnCase
)
#define REG_CREATE(exp) REG_create((exp),-1,(c_string)NULL,C_False)
#define IREG_CREATE(exp) REG_create((exp),-1,(c_string)NULL,C_True)
/* creates a regular expression evaluator from string 'szRegExp'
'lLen' : -1 or string size in bytes, incl. terminating bytes
'szCharSet': NULL,"" or character set name
( UCS4, UTF-8, MS:CodePage / GNU:iconv-based )
'szCharSet' = NULL,"" --> single byte string
'lLen' = -1 --> null-terminated single byte or utf8 string
RC: evaluator or NULL
*/
{ Reg_T pReg = New(Reg_T);
c_byte ica = (c_byte)(bIgnCase?SCN_FLG_IgnoreCase:0);
Scn_get_rexp(&pReg->pRScn);
pReg->pVScn = REG_Scanner(pReg->pRScn,szRegExp,lLen,szCharSet,ica);
if( pReg->pVScn == (Scn_T)NULL )
{
REG_drop(pReg); return (Reg_T)NULL;
}
return pReg;
}
c_bool REG_recreate
(
Reg_T pReg, c_string szRegExp, long lLen,
c_string szCharSet, c_bool bIgnCase
)
#define REG_RECREATE(reg,exp) REG_recreate((reg),(exp),-1,(c_string)NULL,C_False)
#define IREG_RECREATE(reg,exp) REG_recreate((reg),(exp),-1,(c_string)NULL,C_True)
/* updates regular expression evaluator 'pReg'
from string 'szRegExp'
( 'lLen', 'szCharSet' --> see function 'REG_create' )
RC: true <--> OK
*/
{ c_byte ica = (c_byte)(bIgnCase?SCN_FLG_IgnoreCase:0);
BUG_NULL(pReg);
if( pReg->pVScn != (Scn_T)NULL )
Scn_free(pReg->pVScn);
pReg->pVScn = REG_Scanner(pReg->pRScn,szRegExp,lLen,szCharSet,ica);
return( pReg->pVScn != (Scn_T)NULL );
}
/*I------------------------- Evaluation --------------------------------- */
c_string REG_match
(
Reg_T pReg,
c_string szTxt, long lTxtLen, c_string szCharSet,
long* lPatLen
)
#define REG_MATCH(reg,txt,len) REG_match((reg),(txt),-1,(c_string)NULL,(len))
/* applies regular expression evaluator 'pReg' to string 'szTxt'
( 'lTxtLen', 'szCharSet' --> see function 'REG_create' )
RC: start postion of first matched value in 'szTxt' or NULL
'lPatLen' != NULL --> length of first matched value in bytes
*/
{ c_string szRes = (c_string)NULL, szTok;
long lIdx = 0, lTmp;
GStream_T pGS = (GStream_T)NULL;
BUG_NULL(pReg);
if( pReg->pVScn != (Scn_T)NULL && szTxt != (c_string)NULL )
{ Scn_Stream pStream = (Scn_Stream)NULL;
if( STR_EMPTY(szCharSet) )
{
if( lTxtLen < 0 )
pStream = Stream_string(pReg->pVScn, szTxt);
else
{ c_string szTmp = SubStrCopy(szTxt,lTxtLen);
pStream = Stream_string(pReg->pVScn, szTmp);
FreeMem(szTmp);
}
}
else
{ Scn_Stream_Itr pItr = (Scn_Stream_Itr)NULL;
if( lTxtLen < 0 ) lTxtLen = strlen(szTxt)+1;
pGS = GS_stream_string_new(szTxt,lTxtLen,szCharSet);
if( pGS != (GStream_T)NULL )
pItr = Stream_Itr_new
(
GS_stream_get_wcrc, GS_fun_destruct(pGS), GS_ucs4_to_utf8,
GS_fun_seek(pGS), pGS, ""
);
if( pItr != (Scn_Stream_Itr)NULL )
{
pStream = Stream_bgn(pReg->pVScn,pItr);
Stream_Itr_free(pItr);
}
}
if( pStream != (Scn_Stream)NULL )
{
Stream_concat_other(pStream);
Stream_defEofId(pStream, -1);
Stream_defErrId(pStream, 0);
Stream_defTokId(pStream, "exp", 1);
for(Stream_next(pStream); Stream_ctid(pStream) >= 0; Stream_next(pStream))
{
szTok = symbolToString(Stream_csym(pStream));
if (Stream_ctid(pStream) == 1)
{
if( lPatLen != (long*)NULL )
{
if( STR_EMPTY(szCharSet) ) *lPatLen = strlen(szTok);
else
{
if( GS_stream_bytepos(pGS,(unsigned int*)((StdCPtr)&lTmp)) != 0 )
break;
assert0(lTmp <= lTxtLen,"");
*lPatLen = lTmp - lIdx;
}
}
szRes = szTxt + lIdx;
break;
}
else
{
if( STR_EMPTY(szCharSet) ) lIdx += strlen(szTok);
else
{
if( GS_stream_bytepos(pGS,(unsigned int*)((StdCPtr)&lIdx)) != 0 )
break;
assert0(lIdx <= lTxtLen,"");
}
}
}
Stream_close(pStream);
Stream_free(pStream);
}
}
return szRes;
}
styx-2.0.1/libstyx/prs_gen.c 0000666 0001750 0001750 00000243321 12107732160 012751 0000000 0000000 /* ------------------------------------------------------------------------ */
/* */
/* [prs_gen.c] LALR(1) Parser Generator */
/* */
/* Copyright (c) 1993 by D\olle, Manns */
/* ------------------------------------------------------------------------ */
#include "prs_dfn.h"
/*!
The module [prs_gen] performs two main tasks.
1) A set of functions will be used to dynamically create a BNF-like context
free grammar definition. ( reentrant )
It is possible to define multiple startsymbols and comment tokens.
2) The latter function create the corresponding parse table and nonterminal
classes.
The parse table is the input for the parse function.
This creation process is not reentrant. You must synchronize the access
to the function within threads.
*/
/*!!
The following rules define the abstract syntax. On this base the nonterminal
classes are created.
A) well-formed productions:
1. let X :nil#* : <0 members>
2. let X :cons#*: Y Z <2 members: Y = member && Z = nonterminal>
3. let X :ign#+ : Y <1 nonterminal>
4. let X :name : X1 .. Xn = 0 && name =/= { ign#+, nil#*, cons#* }>
Extension for options (styx version >= 1):
5. let X :none : <0 members>
6. let X :some : Y <1 member>
7. let X :name : X1 .. Xn = 0 && name =/= { ign#+, nil#*, cons#*, none, some }>
B) construction of the token/nonterminal classes:
1. X <=> X reflexiv
2. X <=> Y --> Y <=> X symmetric
3. X <=> Y && Y <=> Z --> X <=> Z transitiv
4. let X :ign#+: Y --> X <=> Y
5. let X :cons#*: Y Z --> X <=> Z
6. X <=> Y && let X :idx: X1 .. Xn && let Y :idy: Y1 .. Ym && idx = idy
--> n = m && forall i, 1 <= i <= n: Type(Xi) = Type(Yi) && Xi <=> Yi,
where Type(Z) = { token, nonterminal }
7. all tokens are equivalent.
C) token/nonterminal classes:
[X] = { Y | Y <=> X }
class representants:
- tokens: "Tok"
- startsymbols: language name
- nonterminals: less nonterminal name according the lexical order
D) correctness:
1. X <=> Y --> Type(X) = Type(Y), where Type(Z) = { token, nonterminal }
2. let X^ :id: a && let X^ :id: b --> a <=> b
3. let X^ :nil#*: a || let X^ :cons#*: b
--> not exists P: P = let X^ :id: c && id =/= { ign#+, nil#*, cons#* }
[ 1,2: checked during construction ]
Extension for options (styx version >= 1):
4. let X^ :none: a || let X^ :some: b
--> not exists P: P = let X^ :id: c && id =/= { ign#+, none, some }
5. let X^ :none: a
--> exists P: P = let X^ :some: b
6. let X^ :some: a
--> exists P: P = let X^ :none: b
E) abstract context free grammar:
NT |--> NT^
T |--> T^ ( NT^ T^ are the class representants )
for all "normal" productions there will be one interface function
of type 'bool' which returns whether the argument term represents
a production of this kind and in the positive case all required members.
*/
/*D
Aenderungen fuer einen reflexiven Parser
Nonterminals waeren zugleich Terminals.
1) Die First-Sets der Nonterminals muessten um die jeweilige
Nonterminal-Huelle erweitert werden.
2) Nonterminals werden moegliche Lookaheads.
( Set[KFGSYMCNT+STARTCNT] )
3) Die GoTo-Tabellen entfallen, und die Shift/Reduktions-Tabellen
beziehen sich auch auf Nonterminals.
*/
#include "olist.h"
#include "otab.h"
#include "binset.h"
#include "prs_imp.h"
/*==================== Types / Constants / Globals ===========================*/
/*I------------------------------ Types ------------------------------------- */
AbstractType(PLR_Cfg); /* Abstract context free grammar type */
typedef struct _PSDFN {
/* production symbol ( definition interface ) */
bool istoken; /* symbol is a token */
int symbol; /* symbol */
int dsymbol; /* dynamic symbol */
long sRow; /* line position */
long sCol; /* col position */
} PSDFN;
typedef struct _PRDFN {
/* production ( definition interface ) */
string pname; /* production */
int method; /* reduction method */
int pid; /* nonterminal */
OT_Tab psymbol; /* symbols */
int idx; /* position index */
} PRDFN;
typedef struct _CRULE {
/* conflict rule ( definition interface ) */
int StateIdx; /* state index */
int StateSym; /* state symbol */
int TokenIdx; /* token index */
OT_Tab ProdIdx; /* production indexes */
} CRULE;
typedef struct _KFGDFN {
/* context free grammar ( definition interface ) */
string language; /* language */
int version; /* styx version */
OT_Tab Token; /* token */
OT_Tab TkIdx; /* token indexes */
OT_Tab NtIdx; /* nonterminal indexes */
OT_Tab NonTerm; /* nonterminals */
OT_Tab StartNt; /* startsymbols */
OT_Tab TokKind; /* token kind */
OT_Tab ErrorNt; /* error recovery nt's */
OT_Tab Prod; /* productions */
OT_Tab Conflict; /* productions */
} KFGDFN;
typedef struct _KFGNT {
/* nonterminal */
int altcnt; /* productions */
int fstalt; /* first produktion */
OT_Tab states; /* occurrence in StateTab as symbol */
BS_Set first; /* FIRST set */
} KFGNT;
typedef struct _PSTATE {
/* parser state */
int symbol; /* with symbol marked vertice or -1 ( start state ) */
OL_Lst states; /* follow states */
OL_Lst kern; /* kernel elements */
OT_Tab looks; /* lookaheads */
} PSTATE;
/*D
Darstellung der Kernelemente
Ein (Kern-)Element wird durch einen Index in eine
vektorisierte Matrix [ProdCnt, MaxSymCnt+1] dargestellt,
wobei die 1. Dimension die Nr. der Produktion und
die 2. Dimension die Punkt-Position angibt.
( Position vor dem durch die 2. Dimension numerierten
Symbol oder MaxSymCnt+1 zur Kennzeichnung einer
Reduktionsproduktion )
*/
typedef struct _PrsGen_T {
bool profile; /* Profile Printing */
int ProdCnt; /* Anzahl der Grammatik-Produktionen */
int MaxSymCnt; /* max. Anzahl Produktionssymbole */
int MaxSymNamLen; /* max. Laenge der Symbol Namen */
int conflictCnt; /* Anzahl Konflikte */
int cruleCnt; /* Anzahl geregelter Konflikte */
int version; /* styx version */
OT_Tab* NtEquiv; /* Equivalence Tables of Nonterminals */
KFGHEAD* Kfg; /* Grammatik-Kopfdaten */
KFGNT* NonTermTab; /* Nonterminals der Grammatik */
KFGPROD* ProdTab; /* Produktionen der Grammatik */
OT_Tab ProdIdx; /* Produktionsindex neu -> alt */
OT_Tab GoToKern; /* Kerne der Folgezustaende */
/* ( Tabelle von Kernelement-Listen ) */
OT_Tab KernTab; /* Indizes Kernelemente */
OT_Tab StateTab; /* Parser-Zustaende */
BS_Set LambdaSet; /* LAMBDA-Set { Nt *=> lambda } */
BS_Set TokenSet; /* FIRST-Set of current Symbol-List */
BS_Set NonTermSet; /* Set for marking Nonterminals */
BS_Set NtRelSet; /* Nt-LALR(0)-Huelle */
BS_Set StateSet; /* Set for Propagation of Lookaheads */
BS_Set* PLaheads; /* Lookahead-Sets fuer die aktuellen */
/* Huellen-Elemente */
void (*prMsg)(c_string msg); /* external message function */
} PrsGen_T;
/* ------------------------ Constants and Globals --------------------------- */
/* NOTE:
* Most of the following macros expect a variable named 'PrsGen',
* which points to the current generation structure.
*/
#define MAX_OBJECTS 10000
#define MAX_PR_ICOLS 10
#define MAX_PR_SCOLS 5
#define PLR_C_IMP(cfg) ( (KFGDFN*)(cfg) )
#define NTIDX(nt) ( ( nt ) - PrsGen->Kfg->TkCnt )
#define NTSYMBOL(idx) ( ( idx ) + PrsGen->Kfg->TkCnt )
#define NTCLASS(idx) ( PrsGen->Kfg->NtClass[idx] )
#define NTEQUIV(idx) ( PrsGen->NtEquiv[idx] )
#define FIRSTNTPROD(nt) ( PrsGen->NonTermTab[NTIDX(nt)].fstalt )
#define LASTNTPROD(nt) ( FIRSTNTPROD(nt) + PrsGen->NonTermTab[NTIDX(nt)].altcnt - 1 )
#define FIRSTSET(nt) ( PrsGen->NonTermTab[NTIDX(nt)].first )
#define NONTERMCNT ( PrsGen->Kfg->NtCnt + PrsGen->Kfg->StartCnt )
#define TERMCNT ( PrsGen->Kfg->TkCnt + PrsGen->Kfg->StartCnt )
#define KFGSYMCNT ( PrsGen->Kfg->TkCnt + PrsGen->Kfg->NtCnt )
#define ACCEPTTK(i) ( ( i ) + PrsGen->Kfg->TkCnt )
#define TKACCEPT(tk) ( ( tk ) - PrsGen->Kfg->TkCnt )
#define NTACCEPT(nt) ( ( nt ) - PrsGen->Kfg->NtCnt )
#define KERNMATRIX ( PrsGen->ProdCnt * ( PrsGen->MaxSymCnt + 1 ) )
#define KERNELEMENT(li,r) ( ( ( li ) * ( PrsGen->MaxSymCnt + 1 ) ) + ( r ) )
/* li = Prod.index 0 .. ProdCnt-1 */
/* r = Pkt.position 1 .. MaxSymCnt+1 */
#define PRODUCTION(e) ( (OT_GET(unsigned long,PrsGen->KernTab,(e)-1)) >> 16 )
#define POSITION(e) ( (OT_GET(unsigned long,PrsGen->KernTab,(e)-1)) & 0xFFFFUL )
#define NEW_PSYMTAB OT_CREATE(PSDFN,cpyPsym,delPsym,primEqual)
#define INS_PSYM(p,t) OT_T_INS(t,p)
#define GET_PSYM(t,i) OT_GET(PSDFN*,t,i)
#define NEW_PRODTAB OT_CREATE(PSDFN,cpyProd,delProd,primEqual)
#define INS_PROD(p,t) OT_T_INS(t,p)
#define GET_PROD(t,i) OT_GET(PRDFN*,t,i)
#define SRT_PRODS(t) OT_SORT(t,cmpProd)
#define SRT_PRODS_2(t) OT_SORT(t,cmpProd2)
#define FND_PROD(t,ti,k) OT_B_FIND(t,ti,(k),cmpProd)
#define NEW_STATETAB OT_CREATE(PSTATE,cpyState,delState,primEqual)
#define INS_STATE(s,t) OT_T_INS(t,s)
#define GET_STATE(t,i) OT_GET(PSTATE*,t,i)
#define NEW_CONFLICTTAB OT_CREATE(CRULE,cpyConflict,delConflict,primEqual)
#define INS_CONFLICT(c,t) OT_T_INS(t,c)
#define GET_CONFLICT(t,i) OT_GET(CRULE*,t,i)
#define NEW_KLISTTAB OT_CREATE(OL_Lst,primCopy,OL_delL,OL_equal)
#define INS_KLIST(l,t) OT_T_INS(t,l)
#define GET_KLIST(t,i) OT_GET(OL_Lst,t,i)
#define NEW_LOOKTAB OT_CREATE(BS_Set,primCopy,delLook,BS_equal)
#define INS_LOOK(l,t) OT_T_INS(t,l)
#define INSN_LOOK(l,t,n) OT_P_INS(t,l,n)
#define GET_LOOK(t,i) OT_GET(BS_Set,t,i)
#define NEW_INTTAB OT_CREATE_ADT(int)
#define INS_INTTE(e,t) OT_T_INS(t,e)
#define UPD_INTTE(e,t,i) OT_UPD(int,t,i,e)
#define GET_INTTE(t,i) OT_GET(int,t,i)
#define INTTE_ARRAY(t) OT_COPY_V(int*,t,sizeof(int),cpyInt)
#define NEW_STRTAB OT_CREATE(string,StrCopy,FreeMem,strEqual)
#define INS_STRTE(e,t) OT_T_INS(t,e)
#define GET_STRTE(t,i) OT_GET(string,t,i)
#define SRT_STRTES(t) OT_SORT(t,cmpStr)
#define FND_STRTE(t,ti,k) OT_B_FIND(t,ti,(k),strcmp)
#define NEW_INTLIST OL_CREATE_ADT(INT)
#define INSC_INTLE(e,l) OL_C_INS(INT,l,e)
#define INST_INTLE(e,l) OL_T_INS(INT,l,e)
#define INSS_INTLE(e,l) OL_S_INS(INT,l,e,primLessEqual)
#define FND_INTLE(e,l) OL_FIND(l,e,primGreatEqual)
#define FST_INTLE(l) OL_FIRST(INT,l)
#define NXT_INTLE(l) OL_NEXT(INT,l)
#define CURR_INTLE(l) OL_CURR(INT,l)
#define PRT_INTLES(l,n) OL_PRINT_EX(l,printINTObj,PrsGen,MAX_PR_ICOLS,(n))
#define ACT_ERROR ( PrsGen->ProdCnt + 1 )
#define ACT_ACCEPT ( PrsGen->ProdCnt + 2 )
#define PROD_OFFSET ( PrsGen->ProdCnt + TERMCNT )
#define PROD_NORMAL -3
#define PROD_FALSE -2
#define PROD_NIL -1
static int indent = 2; /* read-only access */
/*============================= Auxiliary ====================================*/
/* Parameter Check: CALL Function */
static int cmpStr(OT_Obj left, OT_Obj right)
/* left key - right key */
{
return( strcmp((string)left,(string)right) );
}
static OT_Obj cpyTObj(OT_Obj obj, int size)
/* copy obj */
{
return( (OT_Obj)BytCopy(obj,size) );
}
static OT_Obj cpyPsym(OT_Obj psym)
/* copy production symbol */
{
return( cpyTObj(psym,sizeof(PSDFN)) );
}
static OT_Obj cpyProd(OT_Obj prod)
/* copy production */
{
return( cpyTObj(prod,sizeof(PRDFN)) );
}
static OT_Obj cpyState(OT_Obj state)
/* copy state */
{
return( cpyTObj(state,sizeof(PSTATE)) );
}
static OT_Obj cpyConflict(OT_Obj conflict)
/* copy conflict */
{
return( cpyTObj(conflict,sizeof(CRULE)) );
}
static int cmpProd(OT_Obj left, OT_Obj right)
/* left key - right key */
{
return ( ((PRDFN*)left)->pid - ((PRDFN*)right)->pid );
}
static int cmpProd2(OT_Obj left, OT_Obj right)
/* left key - right key */
{
int res = ( ((PRDFN*)left)->pid - ((PRDFN*)right)->pid );
if( res != 0 ) return res;
return ( ((PRDFN*)left)->idx - ((PRDFN*)right)->idx );
}
static int cmpElements(OT_Obj left, OT_Obj right)
/* left element - right element */
{
return( intCAST(left) - intCAST(right) );
}
static int* cpyInt(OT_Obj obj)
/* copy an int object */
{ int* ptr = (int*)NewMem(sizeof(int));
*ptr = intCAST(obj); return( ptr );
}
static bool addNewMembers(BS_Set dst, BS_Set left, BS_Set right)
/* ! ( right <= left ) ==> dst = left + right */
{
if( ! BS_subset(right,left) )
{
BS_union(dst,left,right); return( True );
}
return( False );
}
static INT nextProdElement(PrsGen_T* PrsGen, INT element)
/* naechstes Kernelement ( innerhalb einer Produktion ) */
{ int idx = PRODUCTION(element) - 1, pos = POSITION(element);
return
(
( pos < PrsGen->ProdTab[idx].symcnt )
? KERNELEMENT(idx,pos+1)
: KERNELEMENT(idx,PrsGen->MaxSymCnt+1)
);
}
static INT prevProdElement(PrsGen_T* PrsGen, INT element)
/* vorhergehendes Kernelement ( innerhalb einer Produktion ) */
{ int idx = PRODUCTION(element) - 1, pos = POSITION(element);
return
(
( pos == PrsGen->MaxSymCnt+1 )
? KERNELEMENT(idx,PrsGen->ProdTab[idx].symcnt)
: KERNELEMENT(idx,pos-1)
);
}
static int symType(PrsGen_T* PrsGen, int SymId)
/* Type(SymId) */
{
return
(
( SymId >= PrsGen->Kfg->TkCnt )
? PLR_TYP_NTM : PrsGen->Kfg->TokKind[SymId]
);
}
static bool isToken(PrsGen_T* PrsGen, int SymId)
/* SymId ist ein "User"-Token */
{
return( ( SymId >= 0 && SymId < PrsGen->Kfg->TkCnt ) ? True : False );
}
static bool isNonTerm(PrsGen_T* PrsGen, int SymId)
/* SymId ist ein "User"-Nonterminal */
{
return( ( SymId >= PrsGen->Kfg->TkCnt && SymId < KFGSYMCNT ) ? True : False );
}
static int cntProdMembers(PrsGen_T* PrsGen, KFGPROD* prod)
/* number of tokens and nonterminals of 'prod' */
{ int cnt, typ, i;
for( cnt=0, i=0; i < prod->symcnt; ++i )
{
typ = symType(PrsGen,prod->symbols[i]);
cnt += CFG_TOK_NTM(typ);
}
return( cnt );
}
static int nextProdMember(PrsGen_T* PrsGen, KFGPROD* prod, int startidx)
/* next token/nonterminal of 'prod' */
{ int typ, i;
for( i=startidx; i < prod->symcnt; ++i )
{
typ = symType(PrsGen,prod->symbols[i]);
if( CFG_TOK_NTM(typ) ) return( i );
}
return( prod->symcnt );
}
static void forallNtClasses
(
PrsGen_T* PrsGen, void (*act)(PrsGen_T* PrsGen, int ntclass)
)
/* performs 'act' on all nonterminal classes */
{ int i;
for( i=0; i < PrsGen->Kfg->NtCnt; ++i )
if( i == NTCLASS(i) ) (*act)(PrsGen,i);
}
static void forallEquivNts
(
PrsGen_T* PrsGen, int ntclass,
void (*act)(PrsGen_T* PrsGen,int ntidx, int data), int data
)
/* performs 'act' on all equivalent nonterminals of 'ntclass' */
{ int cnt = OT_CNT(NTEQUIV(ntclass)), i;
for( i=0; i < cnt; ++i )
(*act)(PrsGen,OT_GET(int,NTEQUIV(ntclass),i),data);
}
/*====================== Creation of the Parse Tables ========================*/
/* Parameter Check: CALL Function */
/* ------------------------ Nonterminal Classes ----------------------------- */
static int wellProd(PrsGen_T* PrsGen, KFGPROD* prod)
/* whether 'prod' is well-formed */
{ int res = PROD_FALSE, typ, cnt, i;
if( nilProd(prod->pname) )
{
if( cntProdMembers(PrsGen,prod) ) return( PROD_FALSE );
else return( PROD_NIL );
}
else
if( consProd(prod->pname) )
{
for( cnt=0, i=0; i < prod->symcnt; ++i )
{
typ = symType(PrsGen,prod->symbols[i]);
cnt += CFG_TOK_NTM(typ);
if( cnt == 2 && CFG_NTM(typ) ) res = prod->symbols[i];
}
if( cnt != 2 ) return( PROD_FALSE );
else return( res );
}
else
if( ignProd(prod->pname) )
{
for( cnt=0, i=0; i < prod->symcnt; ++i )
{
typ = symType(PrsGen,prod->symbols[i]);
cnt += CFG_TOK_NTM(typ);
if( cnt == 1 && CFG_NTM(typ) ) res = prod->symbols[i];
}
if( cnt != 1 ) return( PROD_FALSE );
else return( res );
}
else
if( PrsGen->version >= 1 && noneProd(prod->pname) )
{
if( cntProdMembers(PrsGen,prod) ) return( PROD_FALSE );
else return( PROD_NORMAL );
}
else
if( PrsGen->version >= 1 && someProd(prod->pname) )
{
for( cnt=0, i=0; i < prod->symcnt; ++i )
{
typ = symType(PrsGen,prod->symbols[i]);
cnt += CFG_TOK_NTM(typ);
}
if( cnt != 1 ) return( PROD_FALSE );
else return( PROD_NORMAL );
}
else return( PROD_NORMAL );
}
static void checkListProds(PrsGen_T* PrsGen, int ntclass)
/* checks condition 3 for 'ntclass' */
{ bool isList = C_False; bool isOther = C_False;
int cnt = OT_CNT(NTEQUIV(ntclass)), i;
for( i=0; i < cnt; ++i )
{ int nti = OT_GET(int,NTEQUIV(ntclass),i), j;
for( j = FIRSTNTPROD(NTSYMBOL(nti)); j <= LASTNTPROD(NTSYMBOL(nti)); ++j )
{ KFGPROD* prod = &PrsGen->ProdTab[j];
/*
printf("%s.%s.%s\n",PrsGen->Kfg->SNames[NTSYMBOL(ntclass)],PrsGen->Kfg->SNames[prod->id],prod->pname);
*/
if( nilProd(prod->pname) || consProd(prod->pname) ) isList = C_True;
else
if( ! ignProd(prod->pname) ) isOther = C_True;
bug1
(
! ( isList && isOther ),
"[%s] consists of list/non list productions",
PrsGen->Kfg->SNames[prod->id]
);
}
}
}
static void checkOptProds(PrsGen_T* PrsGen, int ntclass)
/* checks condition 4 for 'ntclass' */
{ bool isNone = C_False; bool isOther = C_False; bool isSome = C_False;
int cnt = OT_CNT(NTEQUIV(ntclass)), i;
for( i=0; i < cnt; ++i )
{ int nti = OT_GET(int,NTEQUIV(ntclass),i), j;
for( j = FIRSTNTPROD(NTSYMBOL(nti)); j <= LASTNTPROD(NTSYMBOL(nti)); ++j )
{ KFGPROD* prod = &PrsGen->ProdTab[j];
/*
printf("%s.%s.%s\n",PrsGen->Kfg->SNames[NTSYMBOL(ntclass)],PrsGen->Kfg->SNames[prod->id],prod->pname);
*/
if( noneProd(prod->pname) ) isNone = C_True;
else
if( someProd(prod->pname) ) isSome = C_True;
else
if( ! ignProd(prod->pname) ) isOther = C_True;
bug1
(
! ( (isNone || isSome) && isOther ),
"[%s] consists of option/non option productions",
PrsGen->Kfg->SNames[prod->id]
);
}
}
bug1
(
( (isNone && isSome) || (!isNone && !isSome) ),
"[%s] incomplete option productions",
PrsGen->Kfg->SNames[NTSYMBOL(ntclass)]
);
}
static void changeNtClass(PrsGen_T* PrsGen, int ntidx, int newClass)
/* Class(ntidx) = newClass */
{
NTCLASS(ntidx) = newClass;
}
static bool setEquivNts(PrsGen_T* PrsGen, int ntidx1, int ntidx2)
/* sets nonterminals 'ntidx1' and 'ntidx2' equivalent */
{ int ntc1 = NTCLASS(ntidx1), ntc2 = NTCLASS(ntidx2);
if( ntc1 == ntc2 ) return( False );
else
{
if( strcmp(PrsGen->Kfg->SNames[NTSYMBOL(ntc2)],
PrsGen->Kfg->SNames[NTSYMBOL(ntc1)]) < 0 )
{
forallEquivNts(PrsGen,ntc1,changeNtClass,ntc2);
OT_APPEND(NTEQUIV(ntc2),NTEQUIV(ntc1));
OT_DEL_T(NTEQUIV(ntc1));
}
else
{
forallEquivNts(PrsGen,ntc2,changeNtClass,ntc1);
OT_APPEND(NTEQUIV(ntc1),NTEQUIV(ntc2));
OT_DEL_T(NTEQUIV(ntc2));
}
return( True );
}
}
static bool setEquivProdNts(PrsGen_T* PrsGen, int ntidx1, int ntidx2)
/* determines equivalent production nonterminals of 'ntidx1' and 'ntidx2' */
{ bool change = False;
if( NTCLASS(ntidx1) == NTCLASS(ntidx2) )
{ int i, j;
for( i = FIRSTNTPROD(NTSYMBOL(ntidx1));
i <= LASTNTPROD(NTSYMBOL(ntidx1)); ++i )
{
for( j = FIRSTNTPROD(NTSYMBOL(ntidx2));
j <= LASTNTPROD(NTSYMBOL(ntidx2)); ++j )
{ KFGPROD pi = PrsGen->ProdTab[i], pj = PrsGen->ProdTab[j];
if( ( !strcmp(pi.pname,pj.pname) ) ||
( nilProd(pi.pname) && nilProd(pj.pname) ) ||
( consProd(pi.pname) && consProd(pj.pname) ) )
{ int k = nextProdMember(PrsGen,&pi,0),
l = nextProdMember(PrsGen,&pj,0);
c_bug
(
cntProdMembers(PrsGen,&pi) == cntProdMembers(PrsGen,&pj),
"symbols of productions '%s::%s', '%s::%s' not equivalent",
PrsGen->Kfg->SNames[pi.id],pi.pname,
PrsGen->Kfg->SNames[pj.id],pj.pname
);
while( k < pi.symcnt && l < pj.symcnt )
{ int ksym = pi.symbols[k], lsym = pj.symbols[l], typ;
c_bug
(
( typ = symType(PrsGen,ksym) ) == symType(PrsGen,lsym),
"token/nonterminal conflict in productions '%s::%s', '%s::%s'",
PrsGen->Kfg->SNames[pi.id],pi.pname,
PrsGen->Kfg->SNames[pj.id],pj.pname
);
if( CFG_NTM(typ) && setEquivNts(PrsGen,NTIDX(ksym),NTIDX(lsym)) )
{
change = True;
}
k = nextProdMember(PrsGen,&pi,k+1);
l = nextProdMember(PrsGen,&pj,l+1);
}
}
}
}
}
return( change );
}
static bool pass1NtPartition(PrsGen_T* PrsGen, KFGPROD* prod)
/* changes the nonterminal partition according 'prod' */
{ int res;
switch( res = wellProd(PrsGen,prod) )
{
case PROD_NORMAL:
case PROD_NIL:
return( False );
case PROD_FALSE:
c_bug
(
False,"production '%s::%s' not well-formed",
PrsGen->Kfg->SNames[prod->id],prod->pname
);
return( False );
default:
return( setEquivNts(PrsGen,NTIDX(prod->id),NTIDX(res)) );
}
}
static void pass2NtPartition(PrsGen_T* PrsGen)
/* completes & checks the definition of the nonterminal partition */
{ bool change = True;
while( change )
{ int i;
change = False;
for( i=0; i < PrsGen->Kfg->NtCnt; ++i )
{ OT_Tab cls; int cnt, j, k;
if( i == NTCLASS(i) && ( cnt = OT_CNT(cls = NTEQUIV(i)) ) > 1 )
for( j=0; j < cnt; ++j ) for( k=j/*+1*/; k < cnt; ++k )
if( setEquivProdNts(PrsGen,OT_GET(int,cls,j),OT_GET(int,cls,k)) )
change = True;
}
}
forallNtClasses(PrsGen,checkListProds);
if( PrsGen->version >= 1 )
{
forallNtClasses(PrsGen,checkOptProds);
}
}
/* ------------------------ Release Globals --------------------------------- */
static void delEquivNts(PrsGen_T* PrsGen, int ntclass)
/* deletes the equivalence table of 'ntclass' */
{
OT_DEL_T(NTEQUIV(ntclass));
}
static void delLook(StdCPtr SetEl)
/* Loeschen eines Lookahead-Sets */
{
BS_delS((BS_Set)SetEl);
}
static void delPsym(StdCPtr PsymEl)
/* Loeschen eines Produktionssymbol */
{
FreeMem((PSDFN*)PsymEl);
}
static void delProd(StdCPtr ProdEl)
/* Loeschen einer Produktion */
{
FreeMem(((PRDFN*)ProdEl)->pname);
OT_DEL_T(((PRDFN*)ProdEl)->psymbol);
FreeMem((PRDFN*)ProdEl);
}
static void delState(StdCPtr StateEl)
/* Loeschen eines Parserzustands */
{
OL_DEL_L(((PSTATE*)StateEl)->states);
OL_DEL_L(((PSTATE*)StateEl)->kern);
OT_DEL_T(((PSTATE*)StateEl)->looks);
FreeMem((PSTATE*)StateEl);
}
static void delConflict(StdCPtr ConflictEl)
/* Loeschen einer Produktion */
{
OT_DEL_T(((CRULE*)ConflictEl)->ProdIdx);
FreeMem((CRULE*)ConflictEl);
}
static void delCreateGlobals(PrsGen_T* PrsGen)
/* Loeschen nicht mehr benoetigter Grammatik-Objekte */
{ int i;
forallNtClasses(PrsGen, delEquivNts);
FreeMem(PrsGen->NtEquiv);
BS_delS(PrsGen->LambdaSet);
BS_delS(PrsGen->TokenSet);
BS_delS(PrsGen->NonTermSet);
BS_delS(PrsGen->NtRelSet);
BS_delS(PrsGen->StateSet);
for( i=0; i < NONTERMCNT; ++i )
BS_delS(PrsGen->NonTermTab[i].first);
for( i=0; i < NONTERMCNT; ++i )
OT_DEL_T(PrsGen->NonTermTab[i].states);
FreeMem(PrsGen->NonTermTab);
OT_DEL_T(PrsGen->KernTab);
OT_DEL_T(PrsGen->GoToKern);
OT_DEL_T(PrsGen->StateTab);
OT_DEL_T(PrsGen->ProdIdx);
}
/* ----------------------- Grammar Description ------------------------------ */
static void setKfgGlobals(PrsGen_T* PrsGen, PLR_Cfg Cfg)
/* Initialisierung der globalen Variablen/Grammatik-Kopfdaten */
/* ( inhaltliche Pruefung bei der Grammatik-Definition ) */
{ int i;
BUG_RNG0(OT_CNT(PLR_C_IMP(Cfg)->Token),MAX_OBJECTS);
BUG_RNG1(OT_CNT(PLR_C_IMP(Cfg)->NonTerm),MAX_OBJECTS);
BUG_RNG1(OT_CNT(PLR_C_IMP(Cfg)->StartNt),MAX_OBJECTS);
PrsGen->MaxSymNamLen = 0;
PrsGen->Kfg = (KFGHEAD*)NewMem(sizeof(KFGHEAD));
PrsGen->Kfg->language = StrCopy(PLR_C_IMP(Cfg)->language);
PrsGen->Kfg->TkCnt = (int)OT_CNT(PLR_C_IMP(Cfg)->Token);
PrsGen->Kfg->NtCnt = (int)OT_CNT(PLR_C_IMP(Cfg)->NonTerm);
PrsGen->Kfg->StartCnt = (int)OT_CNT(PLR_C_IMP(Cfg)->StartNt);
BUG_RNG1(KFGSYMCNT+PrsGen->Kfg->StartCnt,MAX_OBJECTS);
PrsGen->Kfg->SNames = (string*)NewMem(sizeof(string)*KFGSYMCNT);
for( i=0; i < PrsGen->Kfg->TkCnt; ++i )
{
PrsGen->Kfg->SNames[i] = StrCopy(GET_STRTE(PLR_C_IMP(Cfg)->Token,i));
PrsGen->MaxSymNamLen = MAX(PrsGen->MaxSymNamLen,strlen(PrsGen->Kfg->SNames[i]));
}
for( i = PrsGen->Kfg->TkCnt; i < KFGSYMCNT; ++i )
{
PrsGen->Kfg->SNames[i] =
StrCopy(GET_STRTE(PLR_C_IMP(Cfg)->NonTerm,i-PrsGen->Kfg->TkCnt));
PrsGen->MaxSymNamLen = MAX(PrsGen->MaxSymNamLen,strlen(PrsGen->Kfg->SNames[i]));
}
PrsGen->Kfg->StartIds = INTTE_ARRAY(PLR_C_IMP(Cfg)->StartNt);
for( i=0; i < PrsGen->Kfg->StartCnt; ++i )
PrsGen->Kfg->StartIds[i] += PrsGen->Kfg->TkCnt;
PrsGen->Kfg->TokKind = INTTE_ARRAY(PLR_C_IMP(Cfg)->TokKind);
PrsGen->NtEquiv = (OT_Tab*)NewMem(sizeof(OT_Tab)*PrsGen->Kfg->NtCnt);
PrsGen->Kfg->NtClass = (int*)NewMem(sizeof(int)*PrsGen->Kfg->NtCnt);
PrsGen->Kfg->ErrorNt = (bool*)NewMem(sizeof(bool)*PrsGen->Kfg->NtCnt);
for( i=0; i < PrsGen->Kfg->NtCnt; ++ i )
{
NTCLASS(i) = i;
NTEQUIV(i) = OT_CREATE_ADT(int);
OT_T_INS(NTEQUIV(i),i);
PrsGen->Kfg->ErrorNt[i] = OT_GET(bool,PLR_C_IMP(Cfg)->ErrorNt,i);
}
PrsGen->LambdaSet = BS_create(NONTERMCNT);
PrsGen->NonTermSet = BS_create(NONTERMCNT);
PrsGen->NtRelSet = BS_create(NONTERMCNT * NONTERMCNT);
PrsGen->TokenSet = BS_create(TERMCNT);
PrsGen->StateTab = NEW_STATETAB;
PrsGen->KernTab = OT_CREATE_ADT(unsigned long);
PrsGen->GoToKern = NEW_KLISTTAB;
for( i=0; i < KFGSYMCNT; ++ i )
{ OL_Lst lst = NEW_INTLIST;
INS_KLIST(lst,PrsGen->GoToKern);
}
}
static void fillProdTabs(PrsGen_T* PrsGen, PLR_Cfg Cfg)
/* Initialisierung der Grammatik-Produktionsdaten, Nonterminal Partition */
{ OT_Tab PIdx, PIdx2; int i, j; bool change = False;
BUG_RNG1(OT_CNT(PLR_C_IMP(Cfg)->Prod),MAX_OBJECTS);
PrsGen->ProdCnt = (int)OT_CNT(PLR_C_IMP(Cfg)->Prod)+PrsGen->Kfg->StartCnt;
PIdx = SRT_PRODS(PLR_C_IMP(Cfg)->Prod);
PIdx2 = SRT_PRODS_2(PLR_C_IMP(Cfg)->Prod);
PrsGen->NonTermTab = (KFGNT*)NewMem(NONTERMCNT*sizeof(KFGNT));
for( i=0; i < NONTERMCNT; ++i )
{
if( i < PrsGen->Kfg->NtCnt )
{ PRDFN pkey; int pos;
pkey.pid = i;
BUG_VMIN(( pos = (int)FND_PROD(PLR_C_IMP(Cfg)->Prod,PIdx,&pkey) ),0);
PrsGen->NonTermTab[i].altcnt = 0;
PrsGen->NonTermTab[i].fstalt = pos - 1;
for( j = pos - 1; j < (int)OT_CNT(PLR_C_IMP(Cfg)->Prod); ++j )
if( GET_PROD(PLR_C_IMP(Cfg)->Prod,GET_INTTE(PIdx,j))->pid == i )
PrsGen->NonTermTab[i].altcnt += 1;
else break;
BUG_VMIN(PrsGen->NonTermTab[i].altcnt,0);
}
else
{
PrsGen->NonTermTab[i].altcnt = 1;
PrsGen->NonTermTab[i].fstalt =
(int)OT_CNT(PLR_C_IMP(Cfg)->Prod) + (i-PrsGen->Kfg->NtCnt);
}
PrsGen->NonTermTab[i].states = NEW_INTTAB;
PrsGen->NonTermTab[i].first = BS_create(TERMCNT);
}
PrsGen->ProdTab = (KFGPROD*)NewMem(PrsGen->ProdCnt*sizeof(KFGPROD));
PrsGen->ProdIdx = NEW_INTTAB;
PrsGen->MaxSymCnt = 1;
for( i=0; i < PrsGen->ProdCnt; ++i )
{
if( i < OT_CNT(PLR_C_IMP(Cfg)->Prod) )
{ PRDFN* prod = GET_PROD(PLR_C_IMP(Cfg)->Prod,GET_INTTE(PIdx2,i));
BUG_RNG0(OT_CNT(prod->psymbol),MAX_OBJECTS);
INS_INTTE((int)prod->idx,PrsGen->ProdIdx);
PrsGen->ProdTab[i].pname = StrCopy(prod->pname);
PrsGen->ProdTab[i].id = PrsGen->Kfg->TkCnt + prod->pid;
PrsGen->ProdTab[i].method = prod->method;
PrsGen->ProdTab[i].symcnt = (int)OT_CNT(prod->psymbol);
PrsGen->MaxSymCnt = ( PrsGen->ProdTab[i].symcnt > PrsGen->MaxSymCnt ) ?
PrsGen->ProdTab[i].symcnt : PrsGen->MaxSymCnt;
PrsGen->ProdTab[i].dsymidx = -1;
PrsGen->ProdTab[i].dsymsym = -1;
if( PrsGen->ProdTab[i].symcnt )
{ long r0 = GET_PSYM(prod->psymbol,0)->sRow,
c0 = GET_PSYM(prod->psymbol,0)->sCol;
PrsGen->ProdTab[i].symbols =
(int*)NewMem(PrsGen->ProdTab[i].symcnt*sizeof(int));
PrsGen->ProdTab[i].symfrms =
(int*)NewMem(PrsGen->ProdTab[i].symcnt*sizeof(int));
for( j=0; j < PrsGen->ProdTab[i].symcnt; ++j )
{
PrsGen->ProdTab[i].symbols[j] = GET_PSYM(prod->psymbol,j)->symbol;
if( ! GET_PSYM(prod->psymbol,j)->istoken )
PrsGen->ProdTab[i].symbols[j] += PrsGen->Kfg->TkCnt;
if( j > 0 )
{ long cr = GET_PSYM(prod->psymbol,j)->sRow - r0,
cc = GET_PSYM(prod->psymbol,j)->sCol - c0,
pr = GET_PSYM(prod->psymbol,j-1)->sRow - r0;
PrsGen->ProdTab[i].symfrms[j] = (int)(( cr > pr ) ? -cc : cc);
}
else PrsGen->ProdTab[i].symfrms[j] = 0;
if( GET_PSYM(prod->psymbol,j)->dsymbol >= 0 )
{
PrsGen->ProdTab[i].dsymidx = j;
PrsGen->ProdTab[i].dsymsym = GET_PSYM(prod->psymbol,j)->dsymbol;
}
}
}
else PrsGen->ProdTab[i].symbols = PrsGen->ProdTab[i].symfrms = (int*)NULL;
if( pass1NtPartition(PrsGen,&PrsGen->ProdTab[i]) ) change = True;
}
else
{ string StNt;
PrsGen->ProdTab[i].symbols = (int*)NewMem(sizeof(int));
PrsGen->ProdTab[i].symfrms = (int*)NewMem(sizeof(int));
PrsGen->ProdTab[i].id = KFGSYMCNT + (i-(int)OT_CNT(PLR_C_IMP(Cfg)->Prod));
PrsGen->ProdTab[i].method = PLR_PRD_DFT;
PrsGen->ProdTab[i].symcnt = 1;
PrsGen->ProdTab[i].symbols[0] =
PrsGen->Kfg->StartIds[i-(int)OT_CNT(PLR_C_IMP(Cfg)->Prod)];
StNt = PrsGen->Kfg->SNames[PrsGen->ProdTab[i].symbols[0]];
PrsGen->ProdTab[i].pname = (string)NewMem(7+strlen(StNt));
sprintf(PrsGen->ProdTab[i].pname,"Start_%s",StNt);
PrsGen->ProdTab[i].symfrms[0] = 0;
PrsGen->ProdTab[i].dsymidx = -1;
PrsGen->ProdTab[i].dsymsym = -1;
}
}
OT_DEL_T(PIdx);
OT_DEL_T(PIdx2);
if( change ) pass2NtPartition(PrsGen);
}
static void fillKernTab(PrsGen_T* PrsGen)
/* Bestimmung der Kernelement-Indizes */
{ unsigned long row, col, key; int i, j;
for( i=1; i <= PrsGen->ProdCnt; ++i )
{
row = ((unsigned long)i) << 16;
row = row & 0xFFFF0000UL;
for( j=1; j <= PrsGen->MaxSymCnt + 1; ++j )
{
col = j & 0x0000FFFFUL;
key = row | col;
OT_T_INS(PrsGen->KernTab,key);
}
}
}
/* ------------------------ First and Lambda Sets --------------------------- */
static bool FirstSetForSymbols(PrsGen_T* PrsGen, int SymCnt, int* Symbols)
/* Bestimmung der FIRST-Elemente fuer eine Liste von Grammatik-Symbolen */
/* ( Initialisierung des TokenSet ausserhalb ! ) */
{ bool LambdaInAll = True; int i;
for( i=0; i < SymCnt; ++i )
{
if( isToken(PrsGen,Symbols[i]) )
{
BS_setE(Symbols[i],PrsGen->TokenSet);
LambdaInAll = False; break;
}
else
{
BS_union(PrsGen->TokenSet,PrsGen->TokenSet,FIRSTSET(Symbols[i]));
if( ! BS_member( NTIDX(Symbols[i]),PrsGen->LambdaSet) )
{
LambdaInAll = False; break;
}
}
}
return( LambdaInAll );
}
static void fillFirstSets(PrsGen_T* PrsGen)
/* Bestimmung der FIRST-Elemente fuer alle Nonterminals */
{ bool newElements = True; int i;
/* FIRST-Elemente fuer die Nonterminals ( Huelle ) */
while( newElements )
{
newElements = False;
for( i = 0; i < PrsGen->ProdCnt; ++i )
{
BS_init(PrsGen->TokenSet);
if( PrsGen->ProdTab[i].symcnt )
{
FirstSetForSymbols
(
PrsGen,PrsGen->ProdTab[i].symcnt,PrsGen->ProdTab[i].symbols
);
newElements |=
addNewMembers
(
FIRSTSET(PrsGen->ProdTab[i].id),
FIRSTSET(PrsGen->ProdTab[i].id),PrsGen->TokenSet
);
}
}
}
/* FIRST-Elemente fuer die Startsymbole */
for( i = KFGSYMCNT; i < NTSYMBOL(NONTERMCNT); ++i )
{ int id = PrsGen->Kfg->StartIds[i-KFGSYMCNT];
if( BS_member(NTIDX(id),PrsGen->LambdaSet) )
BS_setE(NTACCEPT(i),FIRSTSET(i));
}
}
static void fillLambdaSet(PrsGen_T* PrsGen)
/* Bestimmung aller Nonterminals, aus denen lambda ableitbar ist */
{ BS_Set NonLambdaProds = BS_create(PrsGen->ProdCnt);
bool newElements = False; int i;
for( i=0; i < PrsGen->ProdCnt; ++i )
{
if( ! PrsGen->ProdTab[i].symcnt )
{
BS_setE(NTIDX(PrsGen->ProdTab[i].id),PrsGen->LambdaSet);
newElements = True;
}
}
while( newElements )
{
newElements = False;
for( i=0; i < PrsGen->ProdCnt; ++i )
{
if( ! BS_member(NTIDX(PrsGen->ProdTab[i].id),PrsGen->LambdaSet) &&
! BS_member(i,NonLambdaProds) )
{ int j;
for( j=0; j < PrsGen->ProdTab[i].symcnt; ++j )
{
if( isToken(PrsGen,PrsGen->ProdTab[i].symbols[j]) )
{
BS_setE(i,NonLambdaProds); break;
}
else
if( ! BS_member(NTIDX(PrsGen->ProdTab[i].symbols[j]),PrsGen->LambdaSet) )
break;
}
if( j == PrsGen->ProdTab[i].symcnt )
{
BS_setE(NTIDX(PrsGen->ProdTab[i].id),PrsGen->LambdaSet);
newElements = True;
}
}
}
}
BS_delS(NonLambdaProds);
}
/* ----------------------------- State Table -------------------------------- */
/* ------------------------- LALR(0) Elements ------------------------------- */
static void fillNtRelSet(PrsGen_T* PrsGen)
/* Bestimmung der Nonterminal-Relation und deren Huelle */
{ int i;
for( i=0; i < PrsGen->ProdCnt; ++i )
if( PrsGen->ProdTab[i].symcnt &&
isNonTerm(PrsGen,PrsGen->ProdTab[i].symbols[0]) )
BS_setGE
(
PrsGen->NtRelSet,NONTERMCNT,
NTIDX(PrsGen->ProdTab[i].id)+1,
NTIDX(PrsGen->ProdTab[i].symbols[0])+1
);
BS_closure(PrsGen->NtRelSet,PrsGen->NtRelSet,NONTERMCNT);
}
static void Huelle(PrsGen_T* PrsGen, PSTATE* state)
/* LALR(0)-Huelle einer Menge von Kernelementen */
{ INT i;
BS_init(PrsGen->NonTermSet);
for( i=0; i < OL_CNT(state->kern); ++i )
{ INT curr = ( ! i ) ? FST_INTLE(state->kern) : NXT_INTLE(state->kern);
int idx = PRODUCTION(curr) - 1, pos = POSITION(curr) - 1;
if( pos != PrsGen->MaxSymCnt &&
isNonTerm(PrsGen,PrsGen->ProdTab[idx].symbols[pos]) )
{ int row = NTIDX(PrsGen->ProdTab[idx].symbols[pos])+1, j;
for( j=1; j <= NONTERMCNT; ++j )
if( BS_member(BS_RELEL(row,j,NONTERMCNT)-1,PrsGen->NtRelSet) )
BS_setE(j-1,PrsGen->NonTermSet);
}
}
}
static void Sprung(PrsGen_T* PrsGen, OL_Lst Von)
/* Tabelle der Liste von Folge-LALR(0)-Kernen, */
/* ausgehend von den Kernelementen in Von und */
/* den Huellenelementen in NonTermSet */
{ OL_Lst Nach; INT i, j;
for( i=0; i < OL_CNT(Von); ++i )
{ INT curr = ( ! i ) ? FST_INTLE(Von) : NXT_INTLE(Von);
int idx = PRODUCTION(curr) - 1, pos = POSITION(curr) - 1;
if( pos != PrsGen->MaxSymCnt )
{ INT dmy = 0;
Nach = GET_KLIST(PrsGen->GoToKern,PrsGen->ProdTab[idx].symbols[pos]);
dmy = INSS_INTLE(nextProdElement(PrsGen,curr),Nach);
}
}
for( i=0; i < NONTERMCNT; ++i )
{
if( BS_member(i,PrsGen->NonTermSet) )
{
for( j = FIRSTNTPROD(NTSYMBOL(i)); j <= LASTNTPROD(NTSYMBOL(i)); ++j )
{
if( PrsGen->ProdTab[j].symcnt )
{ INT dmy = 0;
Nach = GET_KLIST(PrsGen->GoToKern,PrsGen->ProdTab[j].symbols[0]);
dmy = INSS_INTLE(nextProdElement(PrsGen,KERNELEMENT(j,1)),Nach);
}
}
}
}
}
static void setLambdaProdElements(PrsGen_T* PrsGen, PSTATE* curr)
/* Hinzufuegen der Lambdaproduktionen zu den LALR(0)-Elementen in curr */
{ int i, j;
for( i=0; i < NONTERMCNT; ++i )
{
if( BS_member(i,PrsGen->NonTermSet) )
{
for( j = FIRSTNTPROD(NTSYMBOL(i)); j <= LASTNTPROD(NTSYMBOL(i)); ++j )
{
if( ! PrsGen->ProdTab[j].symcnt )
{ INT element = KERNELEMENT(j,PrsGen->MaxSymCnt+1),
pos = FND_INTLE(element,curr->kern);
if( ! pos || element != CURR_INTLE(curr->kern) )
{ BS_Set lahead = BS_create(TERMCNT);
INT dmy = 0;
if( ! pos )
{
dmy = INST_INTLE(element,curr->kern); INS_LOOK(lahead,curr->looks);
}
else
{
dmy = INSC_INTLE(element,curr->kern); INSN_LOOK(lahead,curr->looks,pos);
}
}
}
}
}
}
}
static void setInitialStates(PrsGen_T* PrsGen)
/* Bestimmung der Startzustaende */
{ PSTATE newState; int i;
for( i=0; i < PrsGen->Kfg->StartCnt; ++i )
{ INT element = KERNELEMENT(PrsGen->ProdCnt-PrsGen->Kfg->StartCnt+i,1);
BS_Set lahead = BS_create(TERMCNT);
INT dmy = 0;
newState.symbol = -1;
newState.looks = NEW_LOOKTAB;
BS_setE(ACCEPTTK(i),lahead);
INS_LOOK(lahead, newState.looks);
newState.kern = NEW_INTLIST;
newState.states = NEW_INTLIST;
dmy = INST_INTLE(element, newState.kern);
INS_STATE(&newState,PrsGen->StateTab);
}
}
static bool existsFollowState(PrsGen_T* PrsGen, PSTATE* curr, OL_Lst newKLst)
/* Der Parserzustand ( LALR(0)-Kernelement-Menge ) ist bereits vorhanden */
{ INT i;
for( i=0; i < OT_CNT(PrsGen->StateTab); ++i )
{
if( OL_EQUAL(GET_STATE(PrsGen->StateTab,i)->kern,newKLst) )
{ INT pos = FND_INTLE(i,curr->states);
INT dmy = 0;
if( ! pos ) dmy = INST_INTLE(i,curr->states);
else
{
if( i != CURR_INTLE(curr->states) )
dmy = INSC_INTLE(i,curr->states);
}
return( True );
}
}
return( False );
}
static void setStates(PrsGen_T* PrsGen)
/* Bestimmung der Parserzustaende und der Mengen von LALR(0)-Kernelementen */
{ PSTATE* curr; PSTATE newState; INT i; int j;
setInitialStates(PrsGen);
for( i=0; i < OT_CNT(PrsGen->StateTab); ++i )
{
curr = GET_STATE(PrsGen->StateTab,i);
Huelle(PrsGen,curr); Sprung(PrsGen,curr->kern);
for( j=0; j < KFGSYMCNT; ++j )
{
if( OL_CNT(GET_KLIST(PrsGen->GoToKern,j)) )
{
if( ! existsFollowState(PrsGen,curr,GET_KLIST(PrsGen->GoToKern,j)) )
{ INT StateId, k;
INT dmy = 0;
newState.symbol = j;
newState.looks = NEW_LOOKTAB;
newState.states = NEW_INTLIST;
newState.kern = NEW_INTLIST;
OL_COPY_L(newState.kern,GET_KLIST(PrsGen->GoToKern,j));
OL_INIT(GET_KLIST(PrsGen->GoToKern,j));
for( k=0; k < OL_CNT(newState.kern); ++k )
{ BS_Set lahead = BS_create(TERMCNT);
INS_LOOK(lahead,newState.looks);
}
INS_STATE(&newState,PrsGen->StateTab);
StateId = OT_CNT(PrsGen->StateTab) - 1;
dmy = INST_INTLE(StateId,curr->states);
if( isNonTerm(PrsGen,j) )
INS_INTTE((int)StateId,PrsGen->NonTermTab[NTIDX(j)].states);
}
else OL_CLEAR(GET_KLIST(PrsGen->GoToKern,j));
}
}
}
for( i=0; i < OT_CNT(PrsGen->StateTab); ++i )
{
curr = GET_STATE(PrsGen->StateTab,i);
Huelle(PrsGen,curr); setLambdaProdElements(PrsGen,curr);
}
}
/* ------------------------- LALR(1) Elements ------------------------------- */
static void createProdLaheads(PrsGen_T* PrsGen)
/* Erzeugen der Lookahead-Sets der Huellen-Elemente ( Produktionen ) */
{ int i;
PrsGen->PLaheads = (BS_Set*)NewMem(sizeof(BS_Set)*PrsGen->ProdCnt);
for( i=0; i < PrsGen->ProdCnt; ++i )
PrsGen->PLaheads[i] = BS_create(TERMCNT);
}
static void initProdLaheads(PrsGen_T* PrsGen)
/* ( Re- ) Initialisierung der aktuellen Lookahead-Sets der Huellen-Elemente */
{ int i;
for( i=0; i < PrsGen->ProdCnt; ++i ) BS_init(PrsGen->PLaheads[i]);
}
static void delProdLaheads(PrsGen_T* PrsGen)
/* Loeschen der Lookahead-Sets der Huellen-Elemente */
{ int i;
for( i=0; i < PrsGen->ProdCnt; ++i ) BS_delS(PrsGen->PLaheads[i]);
FreeMem(PrsGen->PLaheads);
}
static void LaheadHuelle(PrsGen_T* PrsGen, INT element, BS_Set lahead)
/* Lookahead-Huelle fuer das Kernelement element */
{ int idx = PRODUCTION(element) - 1, pos = POSITION(element) - 1;
bool newElements = True;
if( pos != PrsGen->MaxSymCnt &&
isNonTerm(PrsGen,PrsGen->ProdTab[idx].symbols[pos]) )
/* Fuer ein Reduktionselement sind die zulaessigen Folgesymbole */
/* bereits vollstaendig bestimmt. */
/* Nur ein "Nonterminal"-Kernelement kann fuer die - indirekt - */
/* zu diesem Nonterminal gehoerenden Reduktionselemente */
/* zulaessige Folgesymbole liefern. */
{ int i, j;
BS_init(PrsGen->TokenSet);
if( pos + 1 < PrsGen->ProdTab[idx].symcnt )
{
if( FirstSetForSymbols
(PrsGen,PrsGen->ProdTab[idx].symcnt-(pos+1),
&PrsGen->ProdTab[idx].symbols[pos+1]) )
BS_union(PrsGen->TokenSet,PrsGen->TokenSet,lahead);
}
else BS_union(PrsGen->TokenSet,PrsGen->TokenSet,lahead);
for( i = 0; i < NONTERMCNT; ++i )
if( BS_member(i,PrsGen->NonTermSet) &&
NTSYMBOL(i) == PrsGen->ProdTab[idx].symbols[pos] )
for( j = FIRSTNTPROD(NTSYMBOL(i)); j <= LASTNTPROD(NTSYMBOL(i)); ++j )
BS_union(PrsGen->PLaheads[j],PrsGen->PLaheads[j],PrsGen->TokenSet);
/* Vervollstaendigung der Lookahead-Huelle fuer das aktuelle Kernelement */
while( newElements )
{
newElements = False;
for( i=0; i < PrsGen->ProdCnt; ++i )
{
if( ! BS_empty(PrsGen->PLaheads[i]) && PrsGen->ProdTab[i].symcnt )
{
BS_init(PrsGen->TokenSet);
if( PrsGen->ProdTab[i].symcnt > 1 )
{
if( FirstSetForSymbols
(PrsGen,PrsGen->ProdTab[i].symcnt-1,
&PrsGen->ProdTab[i].symbols[1]) )
BS_union(PrsGen->TokenSet,PrsGen->TokenSet,PrsGen->PLaheads[i]);
}
else BS_union(PrsGen->TokenSet,PrsGen->TokenSet,PrsGen->PLaheads[i]);
for( j=0; j < PrsGen->ProdCnt; ++j )
if( PrsGen->ProdTab[i].symbols[0] == PrsGen->ProdTab[j].id &&
addNewMembers(PrsGen->PLaheads[j],PrsGen->PLaheads[j],PrsGen->TokenSet) )
newElements = True;
}
}
}
}
}
static bool setFollowLaheads(PrsGen_T* PrsGen, PSTATE* curr)
/* Bestimmung der Lookahead-Elemente fuer jeden Folgezustand von curr */
{ bool newElements = False; INT i;
for( i=0; i < OL_CNT(curr->kern); ++i )
{ INT element = ( ! i ) ? FST_INTLE(curr->kern) : NXT_INTLE(curr->kern);
BS_Set lahead = GET_LOOK(curr->looks,i);
if( POSITION(element) != PrsGen->MaxSymCnt+1 )
{ OL_Lst readLst = NEW_INTLIST; INT j;
element = nextProdElement(PrsGen,element);
for( j=0; j < OL_CNT(curr->states); ++j )
{ INT FState = ( ! j ) ?
FST_INTLE(curr->states) : NXT_INTLE(curr->states);
PSTATE* follow = GET_STATE(PrsGen->StateTab,FState);
BS_Set FSet; INT pos, k;
OL_COPY_L(readLst,follow->kern);
pos = FND_INTLE(element,readLst);
if( pos && element == CURR_INTLE(readLst) )
{
FSet = GET_LOOK(follow->looks,pos-1);
if( addNewMembers(FSet,FSet,lahead) )
{
BS_setE(FState,PrsGen->StateSet); newElements = True;
}
}
for( k=0; k < OL_CNT(readLst); ++k )
{ INT FElement = ( ! k ) ? FST_INTLE(readLst) : NXT_INTLE(readLst);
int idx = PRODUCTION(FElement) - 1;
if( PrsGen->ProdTab[idx].symcnt )
{ INT prevE = prevProdElement(PrsGen,FElement);
if( ! BS_empty(PrsGen->PLaheads[idx]) && POSITION(prevE) == 1 &&
PrsGen->ProdTab[idx].symbols[0] == follow->symbol )
{
FSet = GET_LOOK(follow->looks,k);
if( addNewMembers(FSet,FSet,PrsGen->PLaheads[idx]) )
{
BS_setE(FState,PrsGen->StateSet); newElements = True;
}
}
}
}
}
OL_DEL_C(readLst);
}
}
return( newElements );
}
static void setLambdaProdLaheads(PrsGen_T* PrsGen, PSTATE* curr)
/* Bestimmung der Lookahead-Elemente fuer die Lambdaproduktionen in curr */
{ int i;
for( i=0; i < PrsGen->ProdCnt; ++i )
{
if( ! PrsGen->ProdTab[i].symcnt && ! BS_empty(PrsGen->PLaheads[i]) )
{ INT element = KERNELEMENT(i,PrsGen->MaxSymCnt+1),
pos = FND_INTLE(element,curr->kern);
if( pos && element == CURR_INTLE(curr->kern) )
{ BS_Set lahead = GET_LOOK(curr->looks,pos-1);
addNewMembers(lahead,lahead,PrsGen->PLaheads[i]);
}
}
}
}
static bool setLaheads(PrsGen_T* PrsGen, PSTATE* curr)
/* Bestimmung der von curr spontan generierten und sich */
/* ausbreitenden Lookahead-Elemente */
{ INT i;
Huelle(PrsGen,curr); initProdLaheads(PrsGen);
for( i=0; i < OL_CNT(curr->kern); ++i )
{ INT element = ( ! i ) ? FST_INTLE(curr->kern) : NXT_INTLE(curr->kern);
LaheadHuelle(PrsGen,element,GET_LOOK(curr->looks,i));
}
setLambdaProdLaheads(PrsGen,curr);
return( setFollowLaheads(PrsGen,curr) );
}
static void fillStateTab(PrsGen_T* PrsGen)
/* Bestimmung der Parserzustaende und der Mengen von LALR(1)-Kernelementen */
{ bool newElements = True; INT i;
void (*prMsg)(c_string msg) = PrsGen->prMsg;
if( prMsg == (void (*)(c_string msg))NULL ) prMsg = prMsg_stderr;
if( PrsGen->profile )
(*prMsg)("creating LALR(0)-Elements ...\n");
setStates(PrsGen);
BUG_RNG1(OT_CNT(PrsGen->StateTab),MAX_OBJECTS);
if( PrsGen->profile )
(*prMsg)("creating LALR(1)-Elements ...\n");
PrsGen->StateSet = BS_create(OT_CNT(PrsGen->StateTab));
createProdLaheads(PrsGen);
for( i=0; i < PrsGen->Kfg->StartCnt; ++i )
BS_setE(i,PrsGen->StateSet);
while( newElements )
{
newElements = False;
for( i=0; i < OT_CNT(PrsGen->StateTab); ++i )
{
if( BS_member(i,PrsGen->StateSet) )
{
BS_delE(i,PrsGen->StateSet);
if( setLaheads(PrsGen,GET_STATE(PrsGen->StateTab,i)) )
newElements = True;
}
}
}
delProdLaheads(PrsGen);
}
/* --------------------------- Parse Tables --------------------------------- */
static INT setStateShifts(PrsGen_T* PrsGen, INT idx, OT_Tab shifts)
/* Shift-FolgeZustaende fuer 'StateTab[idx]' */
{ OL_Lst StateLst; INT State, i;
StateLst = GET_STATE(PrsGen->StateTab,idx)->states;
for( i=0; i < OL_CNT(StateLst); ++i )
{
State = ( ! i ) ? FST_INTLE(StateLst) : NXT_INTLE(StateLst);
if( isToken( PrsGen, GET_STATE(PrsGen->StateTab,State)->symbol ) )
INS_INTTE((-(State+1)),shifts);
}
return( OT_CNT(shifts) );
}
static INT findStateShifts
(
OT_Tab shifts, OT_Tab MstShift, OT_Tab DtlShift
)
/* finden des Zustands mit identischen Shift-FolgeZustaenden ( oder -1 ) */
{ INT cnt = OT_CNT(MstShift), i, j, k;
for( i=0; i < cnt; ++i )
{ int dcnt = 0;
if( ( k = j = ( GET_INTTE(MstShift,i) - 1 ) ) >= 0 )
{
for( ; j >= 0; --j )
if( GET_INTTE(DtlShift,j) < 0 ) ++dcnt;
else break;
if( ( j = OT_CNT(shifts) ) == dcnt )
{ bool equality = True;
for( j -= 1; j >= 0; --j, --k )
if( GET_INTTE(DtlShift,k) != GET_INTTE(shifts,j) )
{
equality = False; break;
}
if( equality ) return( i );
}
}
}
return( -1 );
}
static void fillShiftTabs(PrsGen_T* PrsGen, OT_Tab MstShift, OT_Tab DtlShift)
/* Bestimmung der Shift-Tabellen */
/* MstShift : 1 Eintrag / Zustand --- DtlShift-Index des 1. Symbols oder -1 */
/* DtlShift : Liste von Eintraegen fuer jeden Zustand mit Shift-Aktionen */
/* ( -(StateIdx1+1), ..., -(StateIdxN+1) ,TokenN, ..., Token1 ) */
{ OT_Tab cshifts = NEW_INTTAB; INT cnt, i, j;
for( i=0; i < OT_CNT(PrsGen->StateTab); ++i )
{ int lalrel = -1;
if( ! ( cnt = setStateShifts(PrsGen,i,cshifts) ) ) /* keine Shift-Folgezustaende */
INS_INTTE(lalrel,MstShift);
else
{ INT idx = findStateShifts(cshifts,MstShift,DtlShift);
if( idx >= 0 ) /* vorhandene Shift-Folgezustaende */
INS_INTTE(GET_INTTE(MstShift,idx),MstShift);
else /* neue Shift-Folgezustaende */
{
lalrel = (int)(OT_CNT(DtlShift) + cnt); INS_INTTE(lalrel,MstShift);
for( j=0; j < cnt; ++j ) INS_INTTE(GET_INTTE(cshifts,j),DtlShift);
for( j=cnt-1; j >= 0; --j )
{
lalrel = GET_STATE(PrsGen->StateTab,ABS((GET_INTTE(cshifts,j)+1)))->symbol;
INS_INTTE(lalrel,DtlShift);
}
}
}
OT_CLEAR(cshifts);
}
OT_DEL_T(cshifts);
}
static void setStateGoTos(PrsGen_T* PrsGen, INT idx, OT_Tab GoToDft, bool sign)
/* GoTo-QuellZustaende fuer Zielzustand 'StateTab[idx]' */
{ OL_Lst StateLst; INT State, cnt = OT_CNT(PrsGen->StateTab), i, j;
for( i=0; i < cnt; ++i )
{
StateLst = GET_STATE(PrsGen->StateTab,i)->states;
for( j=0; j < OL_CNT(StateLst); ++j )
{
State = ( ! j ) ? FST_INTLE(StateLst) : NXT_INTLE(StateLst);
if( State == idx )
INS_INTTE(sign?(int)(-(i+1)):(int)(i+1),GoToDft);
}
}
}
static void fillGoToTabs(PrsGen_T* PrsGen, OT_Tab GoTo, OT_Tab GoToDft)
/* Bestimmung der Sprungtabellen */
/* GoTo : 1 Eintrag / Nonterminal -- Index des 1. GoToDft-Eintrags */
/* GoToDft : Folge von Eintraegen der Art */
/* (old) 'toStateIdx+1+StateCnt, [ fromStateIdx+1 ... | 0 ( Default ) ]' */
/* (new) 'toStateIdx+1+StateCnt, [ [- (Default) ] (fromStateIdx+1) ... ]' */
{ int lalrel, i;
void (*prMsg)(c_string msg) = PrsGen->prMsg;
if( prMsg == (void (*)(c_string msg))NULL ) prMsg = prMsg_stderr;
for( i=0; i < NONTERMCNT && isNonTerm(PrsGen,NTSYMBOL(i)); ++i )
{ INT cnt = OT_CNT(PrsGen->NonTermTab[i].states), j;
INS_INTTE((int)OT_CNT(GoToDft),GoTo);
if( cnt <= 1 )
{
if( cnt == 1 ) /* unique StateSymbol */
{
lalrel = (int)(OT_CNT(PrsGen->StateTab)+
GET_INTTE(PrsGen->NonTermTab[i].states,0)+1);
INS_INTTE(lalrel,GoToDft);
setStateGoTos
(
PrsGen,GET_INTTE(PrsGen->NonTermTab[i].states,0),GoToDft,True
);
}
else /* unreacheable NonTerminal */
{
(*prMsg)("Warning: unreacheable Nonterminal '");
(*prMsg)(PrsGen->Kfg->SNames[NTSYMBOL(i)]);
(*prMsg)("'\n");
INS_INTTE(0,GoToDft);
}
}
else /* more than one State with StateSymbol */
{
for( j=0; j < cnt; ++j )
{
lalrel = (int)(OT_CNT(PrsGen->StateTab)+
GET_INTTE(PrsGen->NonTermTab[i].states,j)+1);
INS_INTTE(lalrel,GoToDft);
setStateGoTos
(
PrsGen,GET_INTTE(PrsGen->NonTermTab[i].states,j),GoToDft,False
);
}
}
}
}
static int nextRedElement
(
PrsGen_T* PrsGen, PSTATE* state, int* RedElement, int idx
)
/* Position der/s ersten/naechsten Reduktionselements des Zustands oder 0 */
/* RedElement enthaelt nach Aufruf das Reduktionselement ( ProdIdx + 1 ) */
{ INT i;
for( i=idx; i < OL_CNT(state->kern); ++i )
{ INT element = ( ! i ) ? FST_INTLE(state->kern) : NXT_INTLE(state->kern);
if( POSITION(element) == PrsGen->MaxSymCnt + 1 )
return( ( *RedElement = PRODUCTION(element) ), (int)(i+1) );
}
return( 0 );
}
static int RedAction(PrsGen_T* PrsGen, int RedElement)
/* Reduktionselement ( Index der Produktion + 1 ) oder ACT_ACCEPT */
{
return ( isNonTerm(PrsGen,PrsGen->ProdTab[RedElement-1].id) )
? RedElement : ACT_ACCEPT;
}
static void fillActExpLst
(
PrsGen_T* PrsGen, OT_Tab ActExp, int RedElement,
BS_Set lahead, bool negFlg
)
/* Bestimmung der Ausnahme-Aktionen fuer das Reduktionselement */
/* Alternierende +/- Folge von Eintraegen der Art */
/* 'PROD_OFFSET + Red.Nr ( >= 1 ), Token ( >= 1 ) ...' fuer */
/* jeden Zustand mit mehreren Reduktionselementen */
{ int lalrel = RedAction(PrsGen,RedElement),
i = ( lalrel != ACT_ACCEPT ) ? 0 : PrsGen->Kfg->TkCnt;
lalrel += PROD_OFFSET;
lalrel = ( negFlg ) ? -lalrel : lalrel; INS_INTTE(lalrel,ActExp);
for( ; i < TERMCNT; ++i )
{
if( BS_member(i,lahead) )
{
lalrel = ( negFlg ) ? -(i+1) : i+1; INS_INTTE(lalrel,ActExp);
}
}
}
static void fillActTabs_OLD(PrsGen_T* PrsGen, OT_Tab ActDft, OT_Tab ActExp)
/* Bestimmung der Default/Ausnahme-Aktionstabellen */
/* ActDft : 1 Eintrag / Zustand -- ACT_ACCEPT, ACT_ERROR, Red.Nr ( >= 1 ), */
/* negativer Index des 1. ActExp-Eintrags */
/* ActExp : siehe fillActExpLst */
{ INT i;
for( i=0; i < OT_CNT(PrsGen->StateTab); ++i )
{ PSTATE* curr = GET_STATE(PrsGen->StateTab,i);
int lalrel = ACT_ERROR, FstRedElement, RedElement, pos;
int FstPos = nextRedElement(PrsGen,curr,&FstRedElement,0);
if( ! FstPos ) /* Default-Aktion: ACT_ERROR */
INS_INTTE(lalrel,ActDft);
else
{
pos = nextRedElement(PrsGen,curr,&RedElement,FstPos);
if( ! pos ) /* Default-Aktion: ACT_ACCEPT/Reduktion */
{ /* veraenderte Bedingung fuer Fehlerbehandlung */
lalrel = RedAction(PrsGen,FstRedElement);
INS_INTTE(lalrel,ActDft);
}
else /* Ausnahme-Aktionen: ACT_ACCEPT/Reduktion */
{ bool negFlg = ( ! OT_CNT(ActExp) ||
GET_INTTE(ActExp,OT_CNT(ActExp)-1) < 0 )
? False : True;
lalrel = (int)(-OT_CNT(ActExp)); INS_INTTE(lalrel,ActDft);
fillActExpLst
(
PrsGen,ActExp,FstRedElement,GET_LOOK(curr->looks,FstPos-1),negFlg
);
while( pos > 0 )
{
fillActExpLst
(
PrsGen,ActExp,RedElement,GET_LOOK(curr->looks,pos-1),negFlg
);
pos = nextRedElement(PrsGen,curr,&RedElement,pos);
}
}
}
}
}
static void fillActTabs(PrsGen_T* PrsGen, PLR_Cfg Cfg, OT_Tab ActDft, OT_Tab ActExp)
/* Bestimmung der Default/Ausnahme-Aktionstabellen */
/* ActDft : 1 Eintrag / Zustand -- ACT_ACCEPT, ACT_ERROR, Red.Nr ( >= 1 ), */
/* negativer Index des 1. ActExp-Eintrags */
/* ActExp : siehe fillActExpLst, sortierte Reduktionselemente / Produktionen */
{ INT i, j, k, l;
for( i=0; i < OT_CNT(PrsGen->StateTab); ++i )
{ PSTATE* curr = GET_STATE(PrsGen->StateTab,i);
int lalrel = ACT_ERROR, FstRedElement, RedElement, pos;
int FstPos = nextRedElement(PrsGen,curr,&FstRedElement,0);
if( ! FstPos ) /* Default-Aktion: ACT_ERROR */
INS_INTTE(lalrel,ActDft);
else
{
pos = nextRedElement(PrsGen,curr,&RedElement,FstPos);
if( ! pos ) /* Default-Aktion: ACT_ACCEPT/Reduktion */
{ /* veraenderte Bedingung fuer Fehlerbehandlung */
lalrel = RedAction(PrsGen,FstRedElement);
INS_INTTE(lalrel,ActDft);
}
else /* Ausnahme-Aktionen: ACT_ACCEPT/Reduktion */
{ bool negFlg = ( ! OT_CNT(ActExp) ||
GET_INTTE(ActExp,OT_CNT(ActExp)-1) < 0 )
? False : True;
OT_Tab redpos = NEW_INTTAB;
OT_Tab redelm = NEW_INTTAB;
OT_Tab redidx = (OT_Tab)NULL;
OT_Tab redcl = NEW_LOOKTAB;
BS_Set cl1, cl2;
int cntConflicts = OT_CNT(PLR_C_IMP(Cfg)->Conflict);
lalrel = (int)(-OT_CNT(ActExp)); INS_INTTE(lalrel,ActDft);
INS_INTTE(FstPos,redpos);
INS_INTTE(FstRedElement,redelm);
if( cntConflicts > 0 )
{
cl1 = GET_LOOK(curr->looks,FstPos-1);
cl2 = BS_create(BS_card(cl1));
cl2 = BS_copy(cl2,cl1);
INS_LOOK(cl2,redcl);
}
while( pos > 0 )
{
INS_INTTE(pos,redpos);
INS_INTTE(RedElement,redelm);
if( cntConflicts > 0 )
{
cl1 = GET_LOOK(curr->looks,pos-1);
cl2 = BS_create(BS_card(cl1));
cl2 = BS_copy(cl2,cl1);
INS_LOOK(cl2,redcl);
}
pos = nextRedElement(PrsGen,curr,&RedElement,pos);
}
redidx = OT_SORT(redelm,cmpElements);
for( j=0; j < cntConflicts; ++j )
{
CRULE* conflict = GET_CONFLICT(PLR_C_IMP(Cfg)->Conflict,j);
if( ( conflict->StateIdx == i ||
( curr->symbol >= 0 && curr->symbol == conflict->StateSym ) ) &&
OT_CNT(conflict->ProdIdx) > 0 )
{ c_bool found = C_False;
for( k=0; k < OT_CNT(conflict->ProdIdx); ++k )
{ int cidx = GET_INTTE(conflict->ProdIdx,k);
for( l=0; l < OT_CNT(redelm); ++l )
{ int ridx = GET_INTTE(redelm,l)-1;
if( ridx >= OT_CNT(PrsGen->ProdIdx) ) continue;
ridx = GET_INTTE(PrsGen->ProdIdx,ridx);
if( cidx == ridx )
{
cl1 = GET_LOOK(redcl,l);
if( BS_member(conflict->TokenIdx,cl1) )
{
if( !found )
{
found = C_True;
}
else
{
BS_delE(conflict->TokenIdx,cl1);
}
}
}
}
}
}
}
for( j=0; j < OT_CNT(redidx); ++j )
{
pos = GET_INTTE(redpos,GET_INTTE(redidx,j));
cl1 = cntConflicts > 0
? GET_LOOK(redcl,GET_INTTE(redidx,j))
: GET_LOOK(curr->looks,pos-1);
RedElement = GET_INTTE(redelm,GET_INTTE(redidx,j));
fillActExpLst
(
PrsGen,ActExp,RedElement,cl1,negFlg
);
}
OT_DEL_T(redpos);
OT_DEL_T(redelm);
OT_DEL_T(redidx);
OT_DEL_T(redcl);
}
}
}
}
static PLR_Tab fillParseTab(PrsGen_T* PrsGen, PLR_Cfg Cfg)
/* Bestimmung der Analyse-Tabellen der Grammatik */
{ PARSETAB* PTab = (PARSETAB*)NewMem(sizeof(PARSETAB));
OT_Tab MstShift = NEW_INTTAB;
OT_Tab DtlShift = NEW_INTTAB;
OT_Tab GoTo = NEW_INTTAB;
OT_Tab GoToDft = NEW_INTTAB;
OT_Tab ActDft = NEW_INTTAB;
OT_Tab ActExp = NEW_INTTAB;
PTab->Kfg = PrsGen->Kfg;
PTab->ProdCnt = PrsGen->ProdCnt;
PTab->Prod = PrsGen->ProdTab;
fillShiftTabs(PrsGen,MstShift,DtlShift);
BUG_VMIN(PTab->tabs.MstShiftCnt = (int)OT_CNT(MstShift),0);
PTab->tabs.MstShift = INTTE_ARRAY(MstShift);
OT_DEL_T(MstShift);
PTab->tabs.DtlShiftCnt = (int)OT_CNT(DtlShift);
PTab->tabs.DtlShift = INTTE_ARRAY(DtlShift);
OT_DEL_T(DtlShift);
fillGoToTabs(PrsGen,GoTo,GoToDft);
BUG_VMIN(PTab->tabs.GoToCnt = (int)OT_CNT(GoTo),0);
PTab->tabs.GoTo = INTTE_ARRAY(GoTo);
OT_DEL_T(GoTo);
BUG_VMIN(PTab->tabs.GoToDftCnt = (int)OT_CNT(GoToDft),0);
PTab->tabs.GoToDft = INTTE_ARRAY(GoToDft);
OT_DEL_T(GoToDft);
fillActTabs(PrsGen,Cfg,ActDft,ActExp);
BUG_VMIN(PTab->tabs.ActDftCnt = (int)OT_CNT(ActDft),0);
PTab->tabs.ActDft = INTTE_ARRAY(ActDft);
OT_DEL_T(ActDft);
PTab->tabs.ActExpCnt = (int)OT_CNT(ActExp);
PTab->tabs.ActExp = INTTE_ARRAY(ActExp);
OT_DEL_T(ActExp);
return( PTab );
}
/* ---------------------------- Printing ------------------------------------ */
static void printINTObj(StdCPtr obj, Any_T any, int nl, c_bool last)
/* prints an INT-object */
{ PrsGen_T* PrsGen = (PrsGen_T*)any;
char buf[STD_BUFFLEN+1];
void (*prMsg)(c_string msg) = PrsGen->prMsg;
if( prMsg == (void (*)(c_string msg))NULL ) prMsg = prMsg_stdout;
if( nl > 0 )
{
sprintf(buf,"\n%*s",nl,"");
(*prMsg)(buf);
}
sprintf(buf,"%ld%s",(long)obj,(last?"":", "));
(*prMsg)(buf);
}
static void printTokSet(PrsGen_T* PrsGen, BS_Set s)
/* prints a token set */
{ int i;
void (*prMsg)(c_string msg) = PrsGen->prMsg;
if( prMsg == (void (*)(c_string msg))NULL ) prMsg = prMsg_stdout;
(*prMsg)("{");
for( i=0; i < TERMCNT; ++i )
if( BS_member(i,s) )
{
(*prMsg)(" \"");
if( i < PrsGen->Kfg->TkCnt )
(*prMsg)(PrsGen->Kfg->SNames[i]);
else
(*prMsg)("Accept");
(*prMsg)("\" ");
}
(*prMsg)("}");
}
static void printFirstNtSets(PrsGen_T* PrsGen)
/* prints first sets */
{ int i;
void (*prMsg)(c_string msg) = PrsGen->prMsg;
if( prMsg == (void (*)(c_string msg))NULL ) prMsg = prMsg_stdout;
(*prMsg)("\n--- First Sets ---\n\n");
for( i=0; i < NONTERMCNT; ++i )
{
(*prMsg)("First ");
(*prMsg)((iKfg->NtCnt)?PrsGen->Kfg->SNames[NTSYMBOL(i)]:"Start");
(*prMsg)(BS_member(i,PrsGen->LambdaSet) ? "(lambda)" : "");
(*prMsg)(" = ");
printTokSet(PrsGen,FIRSTSET(NTSYMBOL(i)));
(*prMsg)("\n");
}
}
static void ShiftConflicts
(
PrsGen_T* PrsGen, BS_Set cl,OL_Lst states,bool printing
)
/* prints shift-reduce conflicts for current kern element */
{ bool flag = False; INT i;
char buf[STD_BUFFLEN+1];
void (*prMsg)(c_string msg) = PrsGen->prMsg;
if( prMsg == (void (*)(c_string msg))NULL ) prMsg = prMsg_stdout;
for( i=0; i < OL_CNT(states); ++i )
{ INT fs = ( ! i ) ? FST_INTLE(states) : NXT_INTLE(states);
int symbol = GET_STATE(PrsGen->StateTab,fs)->symbol;
if( isToken(PrsGen,symbol) && BS_member(symbol,cl) )
{
if( printing )
{
sprintf(buf,"\n%*sShift-Reduce-Conflict with Shift '",indent,"");
(*prMsg)(buf);
(*prMsg)(PrsGen->Kfg->SNames[symbol]);
sprintf(buf,"' to State: %ld", (long)fs);
(*prMsg)(buf);
flag = True;
}
++PrsGen->conflictCnt;
}
}
if( flag ) (*prMsg)("\n");
}
static void RedConflicts
(
PrsGen_T* PrsGen, PLR_Cfg Cfg,
int sidx, int pidx, int clidx, BS_Set cl,
OT_Tab looks,OL_Lst readLst,bool printing
)
/* prints reduce-reduce conflicts for current kern element */
{ bool flag = False; INT i, j, k;
char buf[STD_BUFFLEN+1];
PSTATE* curr = GET_STATE(PrsGen->StateTab,sidx);
void (*prMsg)(c_string msg) = PrsGen->prMsg;
if( prMsg == (void (*)(c_string msg))NULL ) prMsg = prMsg_stdout;
for( i = clidx + 1; i < OL_CNT(readLst); ++i )
{ INT fk = NXT_INTLE(readLst); int pos = POSITION(fk);
if( pos == PrsGen->MaxSymCnt + 1 &&
! BS_empty(BS_inter(PrsGen->TokenSet,cl,GET_LOOK(looks,i))) )
{ int idx = PRODUCTION(fk) - 1,
cnt = BS_cnt(PrsGen->TokenSet), ccnt = 0;
if( printing )
{ int id = PrsGen->ProdTab[idx].id;
char c = ' ';
if( id >= KFGSYMCNT )
{
id = PrsGen->Kfg->StartIds[id-KFGSYMCNT]; c = '\'';
}
sprintf(buf,"\n%*sReduce-Reduce-Conflict with Element: ",indent,"");
(*prMsg)(buf);
(*prMsg)(PrsGen->Kfg->SNames[id]);
sprintf(buf,"%c ( %3d ) :", c, pos);
(*prMsg)(buf);
(*prMsg)(PrsGen->ProdTab[idx].pname);
(*prMsg)(": ");
flag = True;
}
if( idx < OT_CNT(PrsGen->ProdIdx) && pidx < OT_CNT(PrsGen->ProdIdx) )
{ int idxold = GET_INTTE(PrsGen->ProdIdx,idx),
pidxold = GET_INTTE(PrsGen->ProdIdx,pidx);
for( j=0; j < OT_CNT(PLR_C_IMP(Cfg)->Conflict); ++j )
{
CRULE* conflict = GET_CONFLICT(PLR_C_IMP(Cfg)->Conflict,j);
if( ( conflict->StateIdx == sidx ||
( curr->symbol >= 0 && curr->symbol == conflict->StateSym ) ) &&
OT_CNT(conflict->ProdIdx) > 0 &&
BS_member(conflict->TokenIdx,PrsGen->TokenSet) )
{ int rcnt = 0;
for( k=0; k < OT_CNT(conflict->ProdIdx); ++k )
{ int cidx = GET_INTTE(conflict->ProdIdx,k);
if( cidx == idxold || cidx == pidxold )
{
++rcnt;
}
/*
if( rcnt == 1 )
{
++ccnt;
}
*/
if( rcnt >= 2 )
{
++ccnt;
break;
}
}
if( cnt == ccnt )
{
if( printing ) (*prMsg)(" - solved by conflict rules");
++PrsGen->cruleCnt;
break;
}
}
}
}
++PrsGen->conflictCnt;
}
}
if( flag ) (*prMsg)("\n");
}
static void printStateTab(PrsGen_T* PrsGen, PLR_Cfg Cfg)
/* prints state table and conflicts */
{ OL_Lst readLst = NEW_INTLIST; INT i, k; int cnt;
char buf[STD_BUFFLEN+1];
void (*prMsg)(c_string msg) = PrsGen->prMsg;
if( prMsg == (void (*)(c_string msg))NULL ) prMsg = prMsg_stdout;
(*prMsg)("\n--- State Table and Conflicts ---\n\n");
for( i=0; i < OT_CNT(PrsGen->StateTab); ++i )
{ PSTATE* curr = GET_STATE(PrsGen->StateTab,i);
sprintf(buf,"State: %3d / Symbol: ", (int)i);
(*prMsg)(buf);
if( curr->symbol == -1 ) (*prMsg)("None");
else
(*prMsg)(PrsGen->Kfg->SNames[curr->symbol]);
sprintf(buf,"\n\n%*sFollow States:",indent,"");
(*prMsg)(buf);
PRT_INTLES(curr->states,indent+2);
sprintf(buf,"\n\n%*sLALR(1) - Elements:",indent,"");
(*prMsg)(buf);
for( k=0; k < OL_CNT(curr->kern); ++k )
{ INT ck = ( ! k ) ? FST_INTLE(curr->kern) : NXT_INTLE(curr->kern);
int idx = PRODUCTION(ck) - 1,
pos = POSITION(ck),
id = PrsGen->ProdTab[idx].id, j;
BS_Set cl = GET_LOOK(curr->looks,k); char c = ' ';
OL_COPY_L(readLst,curr->kern);
if( id >= KFGSYMCNT )
{
id = PrsGen->Kfg->StartIds[id-KFGSYMCNT]; c = '\'';
}
sprintf(buf,"\n%*s",indent+2,"");
(*prMsg)(buf);
(*prMsg)(PrsGen->Kfg->SNames[id]);
sprintf(buf,"%c ( %3d ) :",c,pos);
(*prMsg)(buf);
(*prMsg)(PrsGen->ProdTab[idx].pname);
(*prMsg)(": ");
if( c != '\'' )
{ int fstcol = indent + 2 +
strlen(PrsGen->Kfg->SNames[id]) +
strlen(PrsGen->ProdTab[idx].pname) + 13;
for( j=0; j < PrsGen->ProdTab[idx].symcnt; ++j )
{
if( ! ( j % MAX_PR_SCOLS ) && j ) TAB(fstcol);
if( pos == j+1 ) fprintf(STDOUT,"^ ");
(*prMsg)(PrsGen->Kfg->SNames[PrsGen->ProdTab[idx].symbols[j]]);
(*prMsg)(" ");
}
if( pos == PrsGen->MaxSymCnt + 1 ) (*prMsg)("^");
}
else
{
if( pos == 1 ) (*prMsg)("^ ");
(*prMsg)(PrsGen->Kfg->SNames[id]);
(*prMsg)(" ");
if( pos == PrsGen->MaxSymCnt + 1 ) (*prMsg)("^");
}
sprintf(buf,"\n%*sLookaheads: ",indent+2,"");
(*prMsg)(buf);
for( j=0, cnt=0; j < TERMCNT; ++j )
{
if( BS_member(j,cl) )
{
if( ! ( cnt % MAX_PR_SCOLS ) && cnt )
{
sprintf(buf,"\n%*s",indent+14,"");
(*prMsg)(buf);
}
if( j < PrsGen->Kfg->TkCnt )
{
(*prMsg)(PrsGen->Kfg->SNames[j]);
(*prMsg)(" ");
}
else
{
sprintf(buf,"Accept[%d] ",TKACCEPT(j));
(*prMsg)(buf);
}
++cnt;
}
}
(*prMsg)("\n");
if( pos == PrsGen->MaxSymCnt + 1 )
{
RedConflicts(PrsGen,Cfg,i,idx,(int)k,cl,curr->looks,readLst,True);
ShiftConflicts(PrsGen,cl,curr->states,True);
}
}
(*prMsg)("\n");
}
OL_DEL_C(readLst);
}
static void countConflicts(PrsGen_T* PrsGen, PLR_Cfg Cfg)
/* counts conflicts */
{ OL_Lst readLst = NEW_INTLIST; INT i, k;
for( i=0; i < OT_CNT(PrsGen->StateTab); ++i )
{ PSTATE* curr = GET_STATE(PrsGen->StateTab,i);
for( k=0; k < OL_CNT(curr->kern); ++k )
{ INT ck = ( ! k ) ? FST_INTLE(curr->kern) : NXT_INTLE(curr->kern);
int idx = PRODUCTION(ck) - 1,
pos = POSITION(ck);
BS_Set cl = GET_LOOK(curr->looks,k);
OL_COPY_L(readLst,curr->kern);
if( pos == PrsGen->MaxSymCnt + 1 )
{
RedConflicts(PrsGen,Cfg,i,idx,(int)k,cl,curr->looks,readLst,False);
ShiftConflicts(PrsGen,cl,curr->states,False);
}
}
}
OL_DEL_C(readLst);
}
static void printNtClasses(PrsGen_T* PrsGen)
/* prints nonterminal classes */
{ int i;
c_string buf = (c_string)NewMem(2*PrsGen->MaxSymNamLen+80+1);
void (*prMsg)(c_string msg) = PrsGen->prMsg;
if( prMsg == (void (*)(c_string msg))NULL ) prMsg = prMsg_stdout;
(*prMsg)("\n--- Nonterminal Classes ---\n\n");
for( i=0; i < PrsGen->Kfg->NtCnt; ++i )
{
sprintf
(
buf,"%*s |--> %s\n",
PrsGen->MaxSymNamLen,PrsGen->Kfg->SNames[NTSYMBOL(i)],
PrsGen->Kfg->SNames[NTSYMBOL(NTCLASS(i))]
);
(*prMsg)(buf);
}
FreeMem(buf);
}
/*====================== Parser Generator Interface ==========================*/
/*I----------------------- Grammar definition ------------------------------- */
PLR_Cfg PLR_createCfg(string Language, int version)
/* creates a context free grammar definition named 'Language' */
{ KFGDFN* cfg;
BUG_NULL(Language);
cfg = (KFGDFN*)NewMem(sizeof(KFGDFN));
cfg->language = StrCopy(Language);
cfg->version = version;
cfg->Token = NEW_STRTAB;
cfg->TkIdx = (OT_Tab)NULL;
cfg->NonTerm = NEW_STRTAB;
cfg->NtIdx = (OT_Tab)NULL;
cfg->StartNt = NEW_INTTAB;
cfg->TokKind = NEW_INTTAB;
cfg->ErrorNt = OT_CREATE_ADT(bool);
cfg->Prod = NEW_PRODTAB;
cfg->Conflict = NEW_CONFLICTTAB;
return( cfg );
}
int PLR_addTK(PLR_Cfg Cfg, string Token, int kind)
/* adds token 'Token' of type 'kind'
( token or keyword, see [cfg_dfn] )
to definition 'Cfg'
*/
{
BUG_NULL(Cfg); BUG_NULL(Token);
BUG_VEQU(PLR_C_IMP(Cfg)->TkIdx,(OT_Tab)NULL);
BUG_VEQU(CFG_TERMINAL(kind),True);
INS_INTTE(kind,PLR_C_IMP(Cfg)->TokKind);
return( (int)INS_STRTE(Token,PLR_C_IMP(Cfg)->Token) );
}
int PLR_addNT(PLR_Cfg Cfg, string NonTerm, bool catchError)
/* adds nonterminal 'NonTerm' to definition 'Cfg'
catchError --> use 'NonTerm' as reparse point
*/
{
BUG_NULL(Cfg); BUG_NULL(NonTerm);
BUG_VEQU(PLR_C_IMP(Cfg)->NtIdx,(OT_Tab)NULL);
OT_PUSH(catchError,PLR_C_IMP(Cfg)->ErrorNt);
return( (int)INS_STRTE(NonTerm,PLR_C_IMP(Cfg)->NonTerm) );
}
void PLR_endSD(PLR_Cfg Cfg)
/* symbol definition end;
completes token and nonterminal definition
*/
{
BUG_NULL(Cfg);
BUG_RNG0(OT_CNT(PLR_C_IMP(Cfg)->Token),MAX_OBJECTS);
BUG_RNG1(OT_CNT(PLR_C_IMP(Cfg)->NonTerm),MAX_OBJECTS);
PLR_C_IMP(Cfg)->TkIdx = SRT_STRTES(PLR_C_IMP(Cfg)->Token);
PLR_C_IMP(Cfg)->NtIdx = SRT_STRTES(PLR_C_IMP(Cfg)->NonTerm);
}
int PLR_addSN(PLR_Cfg Cfg, string StartNt)
/* adds startsymbol 'StartNt' to definition 'Cfg' */
{ INT nt;
BUG_NULL(Cfg); BUG_NULL(StartNt);
BUG_VNEQ(PLR_C_IMP(Cfg)->NtIdx,(OT_Tab)NULL);
nt = FND_STRTE(PLR_C_IMP(Cfg)->NonTerm,PLR_C_IMP(Cfg)->NtIdx,StartNt);
BUG_VMIN(nt,0);
nt = GET_INTTE(PLR_C_IMP(Cfg)->NtIdx,nt-1);
return( (int)INS_INTTE((int)nt,PLR_C_IMP(Cfg)->StartNt) );
}
int PLR_addST(PLR_Cfg Cfg, string SpecTk)
/* marks 'SpecTk' as special comment token */
{ INT tk, tki; int kind;
INT dmy = 0;
BUG_NULL(Cfg); BUG_NULL(SpecTk);
BUG_VNEQ(PLR_C_IMP(Cfg)->TkIdx,(OT_Tab)NULL);
tki = FND_STRTE(PLR_C_IMP(Cfg)->Token,PLR_C_IMP(Cfg)->TkIdx,SpecTk);
BUG_VMIN(tki,0);
tk = GET_INTTE(PLR_C_IMP(Cfg)->TkIdx,tki-=1);
kind = GET_INTTE(PLR_C_IMP(Cfg)->TokKind,tk);
while( CFG_KEY(kind) && (++tki) < OT_CNT(PLR_C_IMP(Cfg)->TkIdx) )
{
tk = GET_INTTE(PLR_C_IMP(Cfg)->TkIdx,tki);
if( !strcmp(GET_STRTE(PLR_C_IMP(Cfg)->Token,tk),SpecTk) )
kind = GET_INTTE(PLR_C_IMP(Cfg)->TokKind,tk);
}
assert0(!CFG_KEY(kind),"illegal comment type");
kind = CFG_TERM_TO_COM(kind);
dmy = UPD_INTTE(kind,PLR_C_IMP(Cfg)->TokKind,tk);
return tk;
}
int PLR_addPR(PLR_Cfg Cfg, string PName, int Method, string NonTerm)
/* adds production 'NonTerm'::'PName' with layout hint 'Method'
( default=0, see [prs_dfn] ) to definition 'Cfg'
*/
{ PRDFN prod;
BUG_NULL(Cfg); BUG_NULL(PName); BUG_NULL(NonTerm);
BUG_RNG0(Method,PLR_PRD_NON);
BUG_VNEQ(PLR_C_IMP(Cfg)->NtIdx,(OT_Tab)NULL);
prod.pname = StrCopy(PName);
prod.method = Method;
prod.pid =
(int)FND_STRTE(PLR_C_IMP(Cfg)->NonTerm,PLR_C_IMP(Cfg)->NtIdx,NonTerm);
BUG_VMIN(prod.pid,0);
prod.pid = GET_INTTE(PLR_C_IMP(Cfg)->NtIdx,prod.pid-1);
prod.psymbol = NEW_PSYMTAB;
prod.idx = OT_CNT(PLR_C_IMP(Cfg)->Prod);
return( (int)INS_PROD(&prod,PLR_C_IMP(Cfg)->Prod) );
}
int PLR_addPT(PLR_Cfg Cfg, string Token, long sRow, long sCol)
/* adds (dynamic) token 'Token' to current production of definition 'Cfg';
The symbol position 'sRow', 'sCol' is used as layout hint.
*/
{ PSDFN psym; INT idx, tki; int kind;
BUG_NULL(Cfg); BUG_NULL(Token);
idx = OT_CNT(PLR_C_IMP(Cfg)->Prod) - 1;
BUG_VMIN(idx,-1);
tki = FND_STRTE(PLR_C_IMP(Cfg)->Token,PLR_C_IMP(Cfg)->TkIdx,Token);
BUG_VMIN(tki,0);
psym.symbol = GET_INTTE(PLR_C_IMP(Cfg)->TkIdx,tki-=1);
kind = GET_INTTE(PLR_C_IMP(Cfg)->TokKind,psym.symbol);
while( CFG_KEY(kind) && (++tki) < OT_CNT(PLR_C_IMP(Cfg)->TkIdx) )
{
psym.symbol = GET_INTTE(PLR_C_IMP(Cfg)->TkIdx,tki);
if( !strcmp(GET_STRTE(PLR_C_IMP(Cfg)->Token,psym.symbol),Token) )
kind = GET_INTTE(PLR_C_IMP(Cfg)->TokKind,psym.symbol);
}
assert0(!CFG_KEY(kind),"illegal token type");
psym.istoken = True;
psym.dsymbol = -1;
psym.sRow = sRow;
psym.sCol = sCol;
return( (int)INS_PSYM(&psym,GET_PROD(PLR_C_IMP(Cfg)->Prod,idx)->psymbol) );
}
int PLR_addPD(PLR_Cfg Cfg, string Token, string DToken, long sRow, long sCol)
/* adds token 'Token' as dynamic Token 'DToken' to current production of definition 'Cfg';
The symbol position 'sRow', 'sCol' is used as layout hint.
*/
{ PSDFN psym; INT idx, tki, dtki; int kind;
BUG_NULL(Cfg); BUG_NULL(Token);
idx = OT_CNT(PLR_C_IMP(Cfg)->Prod) - 1;
BUG_VMIN(idx,-1);
tki = FND_STRTE(PLR_C_IMP(Cfg)->Token,PLR_C_IMP(Cfg)->TkIdx,Token);
BUG_VMIN(tki,0);
psym.symbol = GET_INTTE(PLR_C_IMP(Cfg)->TkIdx,tki-=1);
kind = GET_INTTE(PLR_C_IMP(Cfg)->TokKind,psym.symbol);
while( CFG_KEY(kind) && (++tki) < OT_CNT(PLR_C_IMP(Cfg)->TkIdx) )
{
psym.symbol = GET_INTTE(PLR_C_IMP(Cfg)->TkIdx,tki);
if( !strcmp(GET_STRTE(PLR_C_IMP(Cfg)->Token,psym.symbol),Token) )
kind = GET_INTTE(PLR_C_IMP(Cfg)->TokKind,psym.symbol);
}
assert0(!CFG_KEY(kind),"illegal token type");
dtki = FND_STRTE(PLR_C_IMP(Cfg)->Token,PLR_C_IMP(Cfg)->TkIdx,DToken);
BUG_VMIN(dtki,0);
psym.dsymbol = GET_INTTE(PLR_C_IMP(Cfg)->TkIdx,dtki-=1);
kind = GET_INTTE(PLR_C_IMP(Cfg)->TokKind,psym.dsymbol);
while( CFG_KEY(kind) && (++dtki) < OT_CNT(PLR_C_IMP(Cfg)->TkIdx) )
{
psym.dsymbol = GET_INTTE(PLR_C_IMP(Cfg)->TkIdx,dtki);
if( !strcmp(GET_STRTE(PLR_C_IMP(Cfg)->Token,psym.dsymbol),DToken) )
kind = GET_INTTE(PLR_C_IMP(Cfg)->TokKind,psym.dsymbol);
}
assert0(!CFG_KEY(kind),"illegal dynamic token type");
psym.istoken = True;
psym.sRow = sRow;
psym.sCol = sCol;
return( (int)INS_PSYM(&psym,GET_PROD(PLR_C_IMP(Cfg)->Prod,idx)->psymbol) );
}
int PLR_addPK(PLR_Cfg Cfg, string Keyword, long sRow, long sCol)
/* adds keyword 'Keyword' to current production of definition 'Cfg';
The symbol position 'sRow', 'sCol' is used as layout hint.
*/
{ PSDFN psym; INT idx, tki; int kind;
BUG_NULL(Cfg); BUG_NULL(Keyword);
idx = OT_CNT(PLR_C_IMP(Cfg)->Prod) - 1;
BUG_VMIN(idx,-1);
tki = FND_STRTE(PLR_C_IMP(Cfg)->Token,PLR_C_IMP(Cfg)->TkIdx,Keyword);
BUG_VMIN(tki,0);
psym.symbol = GET_INTTE(PLR_C_IMP(Cfg)->TkIdx,tki-=1);
kind = GET_INTTE(PLR_C_IMP(Cfg)->TokKind,psym.symbol);
while( !CFG_KEY(kind) && (++tki) < OT_CNT(PLR_C_IMP(Cfg)->TkIdx) )
{
psym.symbol = GET_INTTE(PLR_C_IMP(Cfg)->TkIdx,tki);
if( !strcmp(GET_STRTE(PLR_C_IMP(Cfg)->Token,psym.symbol),Keyword) )
kind = GET_INTTE(PLR_C_IMP(Cfg)->TokKind,psym.symbol);
}
assert0(CFG_KEY(kind),"illegal keyword type");
psym.istoken = True;
psym.dsymbol = -1;
psym.sRow = sRow;
psym.sCol = sCol;
return( (int)INS_PSYM(&psym,GET_PROD(PLR_C_IMP(Cfg)->Prod,idx)->psymbol) );
}
int PLR_addPN(PLR_Cfg Cfg, string NonTerm, long sRow, long sCol)
/* adds nonterminal 'NonTerm' to current production of definition 'Cfg';
The symbol position 'sRow', 'sCol' is used as layout hint.
*/
{ PSDFN psym; INT idx;
BUG_NULL(Cfg); BUG_NULL(NonTerm);
idx = OT_CNT(PLR_C_IMP(Cfg)->Prod) - 1;
BUG_VMIN(idx,-1);
psym.symbol =
(int)FND_STRTE(PLR_C_IMP(Cfg)->NonTerm,PLR_C_IMP(Cfg)->NtIdx,NonTerm);
BUG_VMIN(psym.symbol,0);
psym.symbol = GET_INTTE(PLR_C_IMP(Cfg)->NtIdx,psym.symbol-1);
psym.istoken = False;
psym.dsymbol = -1;
psym.sRow = sRow;
psym.sCol = sCol;
return( (int)INS_PSYM(&psym,GET_PROD(PLR_C_IMP(Cfg)->Prod,idx)->psymbol) );
}
int PLR_addCCtx(PLR_Cfg Cfg, int StateIdx, string StateSym, string Token)
/* adds conflict context (state, token) to definition 'Cfg'
*/
{ CRULE conflict; INT idx;
BUG_NULL(Cfg); BUG_NULL(Token);
BUG_VNEQ(PLR_C_IMP(Cfg)->NtIdx,(OT_Tab)NULL);
BUG_VNEQ(PLR_C_IMP(Cfg)->TkIdx,(OT_Tab)NULL);
BUG_VNEQ(PLR_C_IMP(Cfg)->Prod,(OT_Tab)NULL);
conflict.StateIdx = StateIdx;
if( StateSym == NULL || *StateSym == '\0' )
conflict.StateSym = -1;
else
{
idx = (int)FND_STRTE(PLR_C_IMP(Cfg)->NonTerm,PLR_C_IMP(Cfg)->NtIdx,StateSym);
if( idx > 0 )
{
idx = OT_CNT(PLR_C_IMP(Cfg)->Token) + GET_INTTE(PLR_C_IMP(Cfg)->NtIdx,idx-1);
}
else
{
idx = (int)FND_STRTE(PLR_C_IMP(Cfg)->Token,PLR_C_IMP(Cfg)->TkIdx,StateSym);
BUG_VMIN(idx,0);
idx = GET_INTTE(PLR_C_IMP(Cfg)->TkIdx,idx-1);
}
conflict.StateSym = idx;
}
idx = (int)FND_STRTE(PLR_C_IMP(Cfg)->Token,PLR_C_IMP(Cfg)->TkIdx,Token);
BUG_VMIN(idx,0);
idx = GET_INTTE(PLR_C_IMP(Cfg)->TkIdx,idx-1);
conflict.TokenIdx = idx;
conflict.ProdIdx = NEW_INTTAB;
return( (int)INS_CONFLICT(&conflict,PLR_C_IMP(Cfg)->Conflict) );
}
int PLR_addCRule(PLR_Cfg Cfg, string NonTerm, string PName)
/* adds rule i.e. production 'NonTerm'::'PName' to current conflict of definition 'Cfg';
*/
{ INT idx, ntidx, i;
BUG_NULL(Cfg); BUG_NULL(NonTerm); BUG_NULL(PName);
idx = OT_CNT(PLR_C_IMP(Cfg)->Conflict) - 1;
BUG_VMIN(idx,-1);
ntidx = (int)FND_STRTE(PLR_C_IMP(Cfg)->NonTerm,PLR_C_IMP(Cfg)->NtIdx,NonTerm);
BUG_VMIN(ntidx,0);
ntidx = GET_INTTE(PLR_C_IMP(Cfg)->NtIdx,ntidx-1);
for( i=0; i < OT_CNT(PLR_C_IMP(Cfg)->Prod); ++i )
{ PRDFN* prod = GET_PROD(PLR_C_IMP(Cfg)->Prod,i);
if( prod->pid == ntidx && !strcmp(prod->pname,PName) )
{
return( (int)INS_INTTE((int)prod->idx,GET_CONFLICT(PLR_C_IMP(Cfg)->Conflict,idx)->ProdIdx) );
}
}
assert0(False,"unknown production name");
return -1;
}
void PLR_delCfg(PLR_Cfg Cfg)
/* removes grammar definition 'Cfg' */
{
BUG_NULL(Cfg);
FreeMem(PLR_C_IMP(Cfg)->language);
OT_DEL_T(PLR_C_IMP(Cfg)->Token);
OT_DEL_T(PLR_C_IMP(Cfg)->TkIdx);
OT_DEL_T(PLR_C_IMP(Cfg)->NonTerm);
OT_DEL_T(PLR_C_IMP(Cfg)->NtIdx);
OT_DEL_T(PLR_C_IMP(Cfg)->StartNt);
OT_DEL_T(PLR_C_IMP(Cfg)->TokKind);
OT_DEL_T(PLR_C_IMP(Cfg)->ErrorNt);
OT_DEL_T(PLR_C_IMP(Cfg)->Prod);
OT_DEL_T(PLR_C_IMP(Cfg)->Conflict);
FreeMem(Cfg);
}
/*I--------------------- Parse table creation ------------------------------- */
static PLR_Tab PLR_createTab_aux
(
PLR_Cfg Cfg,
void (*prExtMsg)(c_string msg), bool verbose, bool diagnose
)
{ PLR_Tab PTab = (PLR_Tab)NULL;
PrsGen_T PrsGen;
char buf[STD_BUFFLEN+1];
void (*prMsg)(c_string msg) = prExtMsg;
if( prMsg == (void (*)(c_string msg))NULL ) prMsg = prMsg_stderr;
BUG_NULL(Cfg);
PrsGen.prMsg = prExtMsg;
PrsGen.profile = verbose;
PrsGen.conflictCnt = 0;
PrsGen.cruleCnt = 0;
PrsGen.version = PLR_C_IMP(Cfg)->version;
if( PrsGen.profile ) (*prMsg)("begin parse table creation ...\n");
if( PrsGen.profile ) (*prMsg)("reading grammar information ...\n");
setKfgGlobals(&PrsGen,Cfg);
fillProdTabs(&PrsGen,Cfg);
if( PrsGen.profile ) (*prMsg)("creating element keys ...\n");
fillKernTab(&PrsGen);
if( PrsGen.profile ) (*prMsg)("creating lambda set ...\n");
fillLambdaSet(&PrsGen);
if( PrsGen.profile ) (*prMsg)("creating nonterminal relation ...\n");
fillNtRelSet(&PrsGen);
if( PrsGen.profile ) (*prMsg)("creating first sets ...\n");
fillFirstSets(&PrsGen);
if( PrsGen.profile ) (*prMsg)("creating states ...\n");
fillStateTab(&PrsGen);
if( PrsGen.profile ) (*prMsg)("creating parse tables ...\n");
PTab = fillParseTab(&PrsGen,Cfg);
if( diagnose )
{
(*prMsg)("printing statistics ...\n");
printFirstNtSets(&PrsGen);
printStateTab(&PrsGen,Cfg);
printNtClasses(&PrsGen);
}
else countConflicts(&PrsGen,Cfg);
((PARSETAB*)PTab)->Conflicts = PrsGen.conflictCnt;
if( PrsGen.conflictCnt )
{
sprintf
(
buf,"%d conflicts, %d solved by conflict rules. Use -diagnose !\n",
PrsGen.conflictCnt, PrsGen.cruleCnt
);
(*prMsg)(buf);
}
if( PrsGen.profile ) (*prMsg)("deleting ...\n");
delCreateGlobals(&PrsGen);
if( PrsGen.profile ) (*prMsg)("end parse table creation ...\n");
return( PTab );
}
PLR_Tab PLR_createTab(PLR_Cfg Cfg, bool verbose, bool diagnose)
/* creates the corresponding parse table for definition 'Cfg'
'verbose' --> entertainment
'diagnose' --> print conflict / result informations
*/
{
return PLR_createTab_aux(Cfg,(void (*)(c_string msg))NULL,verbose,diagnose);
}
PLR_Tab PLR_createTab_ex
(
PLR_Cfg Cfg, void (*prMsg)(c_string msg), bool verbose, bool diagnose
)
/* like PLR_createTab;
uses 'prMsg' as print function
*/
{
return PLR_createTab_aux(Cfg,prMsg,verbose,diagnose);
}
styx-2.0.1/libstyx/Makefile.am 0000664 0001750 0001750 00000000666 07606106363 013215 0000000 0000000 ## Process this file with automake to generate libstyx/Makefile.in
INCLUDES = -I$(top_srcdir)/modstd -I$(top_srcdir)/libutil -I$(top_srcdir)/libbase -I$(top_srcdir)/pgm -I$(top_srcdir)/modext -I$(top_srcdir)/inc
vpath %.h @top_srcdir@/modstd @top_srcdir@/libutil @top_srcdir@/libbase @top_srcdir@/pgm @top_srcdir@/modext @top_srcdir@/inc
noinst_LTLIBRARIES = libxstyx.la
libxstyx_la_SOURCES = prs_gen.c styx_gen.c scn_gen.c reg_exp.c
styx-2.0.1/libstyx/Makefile.in 0000644 0001750 0001750 00000036131 12116751125 013212 0000000 0000000 # Makefile.in generated by automake 1.11.6 from Makefile.am.
# @configure_input@
# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
# Foundation, Inc.
# This Makefile.in is free software; the Free Software Foundation
# gives unlimited permission to copy and/or distribute it,
# with or without modifications, as long as this notice is preserved.
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
# PARTICULAR PURPOSE.
@SET_MAKE@
VPATH = @srcdir@
am__make_dryrun = \
{ \
am__dry=no; \
case $$MAKEFLAGS in \
*\\[\ \ ]*) \
echo 'am--echo: ; @echo "AM" OK' | $(MAKE) -f - 2>/dev/null \
| grep '^AM OK$$' >/dev/null || am__dry=yes;; \
*) \
for am__flg in $$MAKEFLAGS; do \
case $$am__flg in \
*=*|--*) ;; \
*n*) am__dry=yes; break;; \
esac; \
done;; \
esac; \
test $$am__dry = yes; \
}
pkgdatadir = $(datadir)/@PACKAGE@
pkgincludedir = $(includedir)/@PACKAGE@
pkglibdir = $(libdir)/@PACKAGE@
pkglibexecdir = $(libexecdir)/@PACKAGE@
am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd
install_sh_DATA = $(install_sh) -c -m 644
install_sh_PROGRAM = $(install_sh) -c
install_sh_SCRIPT = $(install_sh) -c
INSTALL_HEADER = $(INSTALL_DATA)
transform = $(program_transform_name)
NORMAL_INSTALL = :
PRE_INSTALL = :
POST_INSTALL = :
NORMAL_UNINSTALL = :
PRE_UNINSTALL = :
POST_UNINSTALL = :
build_triplet = @build@
host_triplet = @host@
subdir = libstyx
DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
am__aclocal_m4_deps = $(top_srcdir)/configure.in
am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
$(ACLOCAL_M4)
mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs
CONFIG_HEADER = $(top_builddir)/config.h
CONFIG_CLEAN_FILES =
CONFIG_CLEAN_VPATH_FILES =
LTLIBRARIES = $(noinst_LTLIBRARIES)
libxstyx_la_LIBADD =
am_libxstyx_la_OBJECTS = prs_gen.lo styx_gen.lo scn_gen.lo reg_exp.lo
libxstyx_la_OBJECTS = $(am_libxstyx_la_OBJECTS)
DEFAULT_INCLUDES = -I.@am__isrc@ -I$(top_builddir)
depcomp = $(SHELL) $(top_srcdir)/depcomp
am__depfiles_maybe = depfiles
am__mv = mv -f
COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \
$(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
LTCOMPILE = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \
--mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \
$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
CCLD = $(CC)
LINK = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \
--mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) $(AM_LDFLAGS) \
$(LDFLAGS) -o $@
SOURCES = $(libxstyx_la_SOURCES)
DIST_SOURCES = $(libxstyx_la_SOURCES)
am__can_run_installinfo = \
case $$AM_UPDATE_INFO_DIR in \
n|no|NO) false;; \
*) (install-info --version) >/dev/null 2>&1;; \
esac
ETAGS = etags
CTAGS = ctags
DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
ACLOCAL = @ACLOCAL@
AMTAR = @AMTAR@
AR = @AR@
AUTOCONF = @AUTOCONF@
AUTOHEADER = @AUTOHEADER@
AUTOMAKE = @AUTOMAKE@
AWK = @AWK@
CC = @CC@
CCDEPMODE = @CCDEPMODE@
CFLAGS = @CFLAGS@
CPP = @CPP@
CPPFLAGS = @CPPFLAGS@
CXX = @CXX@
CXXCPP = @CXXCPP@
CXXDEPMODE = @CXXDEPMODE@
CXXFLAGS = @CXXFLAGS@
CYGPATH_W = @CYGPATH_W@
DEFS = @DEFS@
DEPDIR = @DEPDIR@
DLLTOOL = @DLLTOOL@
DSYMUTIL = @DSYMUTIL@
DUMPBIN = @DUMPBIN@
ECHO_C = @ECHO_C@
ECHO_N = @ECHO_N@
ECHO_T = @ECHO_T@
EGREP = @EGREP@
EXEEXT = @EXEEXT@
FGREP = @FGREP@
GREP = @GREP@
INSTALL = @INSTALL@
INSTALL_DATA = @INSTALL_DATA@
INSTALL_PROGRAM = @INSTALL_PROGRAM@
INSTALL_SCRIPT = @INSTALL_SCRIPT@
INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
LD = @LD@
LDFLAGS = @LDFLAGS@
LIBOBJS = @LIBOBJS@
LIBS = @LIBS@
LIBTOOL = @LIBTOOL@
LIPO = @LIPO@
LN_S = @LN_S@
LTLIBOBJS = @LTLIBOBJS@
MAKEINFO = @MAKEINFO@
MANIFEST_TOOL = @MANIFEST_TOOL@
MKDIR_P = @MKDIR_P@
NM = @NM@
NMEDIT = @NMEDIT@
OBJDUMP = @OBJDUMP@
OBJEXT = @OBJEXT@
OTOOL = @OTOOL@
OTOOL64 = @OTOOL64@
PACKAGE = @PACKAGE@
PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
PACKAGE_NAME = @PACKAGE_NAME@
PACKAGE_STRING = @PACKAGE_STRING@
PACKAGE_TARNAME = @PACKAGE_TARNAME@
PACKAGE_URL = @PACKAGE_URL@
PACKAGE_VERSION = @PACKAGE_VERSION@
PATH_SEPARATOR = @PATH_SEPARATOR@
RANLIB = @RANLIB@
SED = @SED@
SET_MAKE = @SET_MAKE@
SHELL = @SHELL@
STRIP = @STRIP@
VERSION = @VERSION@
abs_builddir = @abs_builddir@
abs_srcdir = @abs_srcdir@
abs_top_builddir = @abs_top_builddir@
abs_top_srcdir = @abs_top_srcdir@
ac_ct_AR = @ac_ct_AR@
ac_ct_CC = @ac_ct_CC@
ac_ct_CXX = @ac_ct_CXX@
ac_ct_DUMPBIN = @ac_ct_DUMPBIN@
am__include = @am__include@
am__leading_dot = @am__leading_dot@
am__quote = @am__quote@
am__tar = @am__tar@
am__untar = @am__untar@
bindir = @bindir@
build = @build@
build_alias = @build_alias@
build_cpu = @build_cpu@
build_os = @build_os@
build_vendor = @build_vendor@
builddir = @builddir@
datadir = @datadir@
datarootdir = @datarootdir@
docdir = @docdir@
dvidir = @dvidir@
exec_prefix = @exec_prefix@
host = @host@
host_alias = @host_alias@
host_cpu = @host_cpu@
host_os = @host_os@
host_vendor = @host_vendor@
htmldir = @htmldir@
includedir = @includedir@
infodir = @infodir@
install_sh = @install_sh@
libdir = @libdir@
libexecdir = @libexecdir@
localedir = @localedir@
localstatedir = @localstatedir@
mandir = @mandir@
mkdir_p = @mkdir_p@
oldincludedir = @oldincludedir@
pdfdir = @pdfdir@
prefix = @prefix@
program_transform_name = @program_transform_name@
psdir = @psdir@
sampledir = @sampledir@
sbindir = @sbindir@
sgmldir = @sgmldir@
sharedstatedir = @sharedstatedir@
srcdir = @srcdir@
sysconfdir = @sysconfdir@
target_alias = @target_alias@
top_build_prefix = @top_build_prefix@
top_builddir = @top_builddir@
top_srcdir = @top_srcdir@
INCLUDES = -I$(top_srcdir)/modstd -I$(top_srcdir)/libutil -I$(top_srcdir)/libbase -I$(top_srcdir)/pgm -I$(top_srcdir)/modext -I$(top_srcdir)/inc
noinst_LTLIBRARIES = libxstyx.la
libxstyx_la_SOURCES = prs_gen.c styx_gen.c scn_gen.c reg_exp.c
all: all-am
.SUFFIXES:
.SUFFIXES: .c .lo .o .obj
$(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps)
@for dep in $?; do \
case '$(am__configure_deps)' in \
*$$dep*) \
( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \
&& { if test -f $@; then exit 0; else break; fi; }; \
exit 1;; \
esac; \
done; \
echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign libstyx/Makefile'; \
$(am__cd) $(top_srcdir) && \
$(AUTOMAKE) --foreign libstyx/Makefile
.PRECIOUS: Makefile
Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status
@case '$?' in \
*config.status*) \
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \
*) \
echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \
cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \
esac;
$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
$(top_srcdir)/configure: $(am__configure_deps)
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
$(ACLOCAL_M4): $(am__aclocal_m4_deps)
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
$(am__aclocal_m4_deps):
clean-noinstLTLIBRARIES:
-test -z "$(noinst_LTLIBRARIES)" || rm -f $(noinst_LTLIBRARIES)
@list='$(noinst_LTLIBRARIES)'; for p in $$list; do \
dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \
test "$$dir" != "$$p" || dir=.; \
echo "rm -f \"$${dir}/so_locations\""; \
rm -f "$${dir}/so_locations"; \
done
libxstyx.la: $(libxstyx_la_OBJECTS) $(libxstyx_la_DEPENDENCIES) $(EXTRA_libxstyx_la_DEPENDENCIES)
$(LINK) $(libxstyx_la_OBJECTS) $(libxstyx_la_LIBADD) $(LIBS)
mostlyclean-compile:
-rm -f *.$(OBJEXT)
distclean-compile:
-rm -f *.tab.c
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/prs_gen.Plo@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/reg_exp.Plo@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/scn_gen.Plo@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/styx_gen.Plo@am__quote@
.c.o:
@am__fastdepCC_TRUE@ $(COMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ $<
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
@am__fastdepCC_FALSE@ $(COMPILE) -c $<
.c.obj:
@am__fastdepCC_TRUE@ $(COMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ `$(CYGPATH_W) '$<'`
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
@am__fastdepCC_FALSE@ $(COMPILE) -c `$(CYGPATH_W) '$<'`
.c.lo:
@am__fastdepCC_TRUE@ $(LTCOMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ $<
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Plo
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
@am__fastdepCC_FALSE@ $(LTCOMPILE) -c -o $@ $<
mostlyclean-libtool:
-rm -f *.lo
clean-libtool:
-rm -rf .libs _libs
ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
unique=`for i in $$list; do \
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
done | \
$(AWK) '{ files[$$0] = 1; nonempty = 1; } \
END { if (nonempty) { for (i in files) print i; }; }'`; \
mkid -fID $$unique
tags: TAGS
TAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \
$(TAGS_FILES) $(LISP)
set x; \
here=`pwd`; \
list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
unique=`for i in $$list; do \
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
done | \
$(AWK) '{ files[$$0] = 1; nonempty = 1; } \
END { if (nonempty) { for (i in files) print i; }; }'`; \
shift; \
if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \
test -n "$$unique" || unique=$$empty_fix; \
if test $$# -gt 0; then \
$(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
"$$@" $$unique; \
else \
$(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
$$unique; \
fi; \
fi
ctags: CTAGS
CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \
$(TAGS_FILES) $(LISP)
list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
unique=`for i in $$list; do \
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
done | \
$(AWK) '{ files[$$0] = 1; nonempty = 1; } \
END { if (nonempty) { for (i in files) print i; }; }'`; \
test -z "$(CTAGS_ARGS)$$unique" \
|| $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \
$$unique
GTAGS:
here=`$(am__cd) $(top_builddir) && pwd` \
&& $(am__cd) $(top_srcdir) \
&& gtags -i $(GTAGS_ARGS) "$$here"
distclean-tags:
-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
distdir: $(DISTFILES)
@srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
list='$(DISTFILES)'; \
dist_files=`for file in $$list; do echo $$file; done | \
sed -e "s|^$$srcdirstrip/||;t" \
-e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \
case $$dist_files in \
*/*) $(MKDIR_P) `echo "$$dist_files" | \
sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \
sort -u` ;; \
esac; \
for file in $$dist_files; do \
if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \
if test -d $$d/$$file; then \
dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \
if test -d "$(distdir)/$$file"; then \
find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
fi; \
if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \
cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \
find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
fi; \
cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \
else \
test -f "$(distdir)/$$file" \
|| cp -p $$d/$$file "$(distdir)/$$file" \
|| exit 1; \
fi; \
done
check-am: all-am
check: check-am
all-am: Makefile $(LTLIBRARIES)
installdirs:
install: install-am
install-exec: install-exec-am
install-data: install-data-am
uninstall: uninstall-am
install-am: all-am
@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
installcheck: installcheck-am
install-strip:
if test -z '$(STRIP)'; then \
$(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
install; \
else \
$(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \
fi
mostlyclean-generic:
clean-generic:
distclean-generic:
-test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES)
-test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES)
maintainer-clean-generic:
@echo "This command is intended for maintainers to use"
@echo "it deletes files that may require special tools to rebuild."
clean: clean-am
clean-am: clean-generic clean-libtool clean-noinstLTLIBRARIES \
mostlyclean-am
distclean: distclean-am
-rm -rf ./$(DEPDIR)
-rm -f Makefile
distclean-am: clean-am distclean-compile distclean-generic \
distclean-tags
dvi: dvi-am
dvi-am:
html: html-am
html-am:
info: info-am
info-am:
install-data-am:
install-dvi: install-dvi-am
install-dvi-am:
install-exec-am:
install-html: install-html-am
install-html-am:
install-info: install-info-am
install-info-am:
install-man:
install-pdf: install-pdf-am
install-pdf-am:
install-ps: install-ps-am
install-ps-am:
installcheck-am:
maintainer-clean: maintainer-clean-am
-rm -rf ./$(DEPDIR)
-rm -f Makefile
maintainer-clean-am: distclean-am maintainer-clean-generic
mostlyclean: mostlyclean-am
mostlyclean-am: mostlyclean-compile mostlyclean-generic \
mostlyclean-libtool
pdf: pdf-am
pdf-am:
ps: ps-am
ps-am:
uninstall-am:
.MAKE: install-am install-strip
.PHONY: CTAGS GTAGS all all-am check check-am clean clean-generic \
clean-libtool clean-noinstLTLIBRARIES ctags distclean \
distclean-compile distclean-generic distclean-libtool \
distclean-tags distdir dvi dvi-am html html-am info info-am \
install install-am install-data install-data-am install-dvi \
install-dvi-am install-exec install-exec-am install-html \
install-html-am install-info install-info-am install-man \
install-pdf install-pdf-am install-ps install-ps-am \
install-strip installcheck installcheck-am installdirs \
maintainer-clean maintainer-clean-generic mostlyclean \
mostlyclean-compile mostlyclean-generic mostlyclean-libtool \
pdf pdf-am ps ps-am tags uninstall uninstall-am
vpath %.h @top_srcdir@/modstd @top_srcdir@/libutil @top_srcdir@/libbase @top_srcdir@/pgm @top_srcdir@/modext @top_srcdir@/inc
# Tell versions [3.59,3.63) of GNU make to not export all variables.
# Otherwise a system limit (for SysV at least) may be exceeded.
.NOEXPORT:
styx-2.0.1/libcs/ 0000755 0001750 0001750 00000000000 12114651653 010622 5 0000000 0000000 styx-2.0.1/libcs/StyxScannerTest.cs 0000644 0001750 0001750 00000012600 11166143617 014213 0000000 0000000 /* ------------------------------------------------------------------------ */
/* */
/* [StyxScannerTest.cs] Scanner Test */
/* */
/* This file belongs to the Styx Scanner & parser generator. */
/* */
/* Copyright (c) 2009 by Doelle, Manns */
/* ------------------------------------------------------------------------ */
using System;
using System.Text;
using System.IO;
using System.Collections;
using styx;
public class StyxScannerTest
{
static void usage()
{
Console.Error.WriteLine("\nusage: StyxScannerTest OPTIONS Language.ltbl\n");
Console.Error.WriteLine("\nOPTIONS:\n");
Console.Error.WriteLine("\n-l : enable n character look-ahead");
Console.Error.WriteLine("\n-f FileToScan : file to be scanned");
Console.Error.WriteLine("\n-c Characterset : characterset of the file to be scanned (utf8, wchar, unicode)");
Console.Error.WriteLine("\n-k CharactersToSkip : characters to be ignored i.e. skipped by the scanner\n");
Console.Error.WriteLine("\n-p IncludePath : enable preprocessing with include path");
}
static bool scan(ref CStyxScanner scanner)
{ string token = "", tid = "";
short gcnt = scanner.getGroups();
int tlen = 0;
if( gcnt <= 0 )
{
for( short tcnt=scanner.getTokens(), i=0; i < tcnt; ++i )
{
token=scanner.getTokenID(i,-1);
tid = scanner.externalTokenID(ref token);
tlen = Math.Max(tlen,tid.Length);
}
}
else
{
for( short i=0; i < gcnt; ++i )
{
for( short tcnt=scanner.getTokens(i), j=0; j < tcnt; ++j )
{
token=scanner.getTokenID(j,i);
tid = scanner.externalTokenID(ref token);
tlen = Math.Max(tlen,tid.Length);
}
}
}
bool ok = true;
while( (ok=scanner.nextToken()) )
{
string Value = "";
if( scanner.currentToken(ref token,ref Value) )
{
tid = scanner.externalTokenID(ref token);
/*
Console.WriteLine
(
"LINE=" + scanner.getLine() + ", COL=" + scanner.getCol() +
", TOK=" + tid + ", VAL=" + Value + "\n"
);
*/
Console.WriteLine
(
"LINE={0,6:d}, COL={1,5:d}, TOK={2}, VAL={3}",
scanner.getLine(),scanner.getCol(),tid.PadRight(tlen),Value
);
}
else
{
Console.Error.WriteLine("currentToken failed\n");
break;
}
if( scanner.eos() ) break;
}
if( !ok ) Console.Error.WriteLine("nextToken failed\n");
return ok;
}
public static int Main(string[] args)
{
string lexpath = "", srcpath = "", content = "", cset = "", incpath = "";
bool lahead = false, preprocess = false;
Hashtable/*uint,null*/ skip = new Hashtable();
int c = 0;
for( int i=0; i < args.Length; ++i )
{
string arg = args[i];
if( arg == "-l" ) lahead = true;
else
if( arg == "-f" )
{
if( i < args.Length - 1 && args[i+1][0] != '-' )
{
++i; srcpath = args[i];
}
}
else
if( arg == "-p" )
{
preprocess = true;
if( i < args.Length - 1 && args[i+1][0] != '-' )
{
++i; incpath = args[i];
}
}
else
if( arg == "-c" )
{
if( i < args.Length - 1 && args[i+1][0] != '-' )
{
++i; cset = args[i];
}
}
else
if( arg == "-k" )
{
if( i < args.Length - 1 && args[i+1][0] != '-' )
{
++i;
int len = args[i].Length;
for( int j=0; j < len; ++j )
{
uint sc = Convert.ToUInt32(args[i][j]);
skip[sc] = null;
}
}
}
else
if( arg[0] == '-' )
{
StyxScannerTest.usage();
return 1;
}
else
{
lexpath = arg;
break;
}
}
if( lexpath.Length == 0 )
{
StyxScannerTest.usage();
return 1;
}
CStyxScanner scanner = null;
if( preprocess )
{
scanner = new CStyxPScanner(lahead,true);
if( scanner != null )
{
Hashtable/*short,string*/ parmap = new Hashtable();
if( incpath.Length > 0 )
parmap[(short)CStyxPScanner.EStyxParIndex.IDX_INC_PATH] = incpath;
parmap[(short)CStyxPScanner.EStyxParIndex.IDX_INC_CSET] = cset;
((CStyxPScanner)scanner).setParameters(ref parmap);
}
}
else scanner = new CStyxScanner(lahead,false);
if( scanner == null || !scanner.loadTableFile(lexpath) )
{
Console.Error.WriteLine("loadTableFile(" + lexpath + ") failed\n");
return 1;
}
CStyxStream cstream = null;
if( srcpath.Length > 0 )
{
cstream = new CStyxFileStream(srcpath,"");
}
else
{
srcpath = "";
while( (c=Console.In.Read()) != -1 ) content += c;
cstream = new CStyxStringStream(content,srcpath);
}
if( cstream == null || !scanner.scanStream(ref cstream,ref skip) )
{
Console.Error.WriteLine("scanStream failed\n");
return 1;
}
int rc = StyxScannerTest.scan(ref scanner) ? 0 : 1;
return rc;
}
}
styx-2.0.1/libcs/test/ 0000755 0001750 0001750 00000000000 11163726754 011611 5 0000000 0000000 styx-2.0.1/libcs/test/ptok2.sty 0000755 0001750 0001750 00000001465 10241411344 013320 0000000 0000000 ; [ptok2.sty] Test pattern token with groups
Language ptok2
Regular Grammar
ExGroup HDoc
ExGroup CG
Group MG1 = ptok2 HDoc
Group MG2 = ptok2 CG
ign :MG2:W = ' \t\n\r'
tok PS1!HDoc = <= "<<<" W* > 'a..z0..9_$' < '\n\r' > / '\n\r'
tok :HDoc:PE1 = PS1 < '\n\r' >
tok :MG1:TA !+ CG = "<"
tok :CG :TE!-= ">"
tok :CG :Pat = ( 'a' ..'z' | '0' ..'9' | '$' ) { 'a' ..'z' | '0' ..'9' | '$' }
tok M = '-' '-'*
tok D = < "/*" > < "*/" > / "*/"
tok E = "*/"
tok F = '\'\"'+
Context Free Grammar
start PTOK
:nul :
:dfn1 : PS1 Body PS1 PTOK
:dfn2 : M PTOK
:dfn3 : "<" IdLst ">" PTOK
:dfn4 : D PTOK
:dfn5 : E PTOK
:dfn6 : "\"\'" PTOK
let Body
:nul :
:stm1: PE1 Body
:stm2: "<" IdLst ">" Body
:stm3: [other] Body
;let Lst
;:nil :
;:cons: PE1 Lst
let IdLst
:nil :
:cons: Pat IdLst
styx-2.0.1/libcs/test/styx.ltbl 0000644 0001750 0001750 00000011554 10373433073 013414 0000000 0000000 # [styx.ltbl] Scanner table for 'styx'
# scanner group 'styx'
Language
Name=styx
StaEdg
0
35
36
37
40
42
43
62
75
102
116
117
120
125
126
133
134
160
165
170
173
176
179
194
195
223
226
233
240
243
246
251
254
257
260
261
274
287
313
320
327
345
348
349
352
355
358
361
364
382
400
403
406
409
412
430
448
455
458
465
468
486
499
512
515
528
531
544
553
560
579
582
592
603
619
623
630
635
651
659
672
683
692
698
704
713
719
725
726
732
738
StaFin
0
2
3
2
4
1
9
0
9
0
5
8
6
9
7
11
0
0
0
0
0
15
15
10
15
7
0
0
0
0
0
0
0
0
15
0
15
0
0
0
0
0
16
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
16
0
14
0
0
14
0
0
0
12
0
0
0
0
14
0
0
13
0
0
14
0
0
EdgeC
255
128
127
126
125
124
123
97
96
94
93
92
91
65
63
60
59
58
48
42
40
39
36
35
34
33
32
27
26
14
13
12
11
10
0
0
0
11
10
0
256
0
0
255
128
127
126
125
124
96
94
65
63
59
58
48
42
39
35
34
33
0
255
128
127
97
96
93
92
40
39
35
34
32
0
255
128
127
126
125
124
118
117
110
109
106
105
102
101
96
94
65
63
59
58
48
42
39
35
34
33
0
256
255
128
127
97
96
93
92
40
39
35
34
32
0
0
58
48
0
255
128
127
32
0
0
123
97
91
65
58
48
0
0
123
121
120
117
116
115
114
113
112
111
110
97
96
93
92
91
89
88
65
58
48
40
39
35
34
0
111
110
109
108
0
111
110
103
102
0
98
97
0
111
110
0
46
45
0
255
128
127
97
96
93
92
46
45
40
39
35
34
32
0
0
123
121
120
117
116
115
114
113
112
111
110
97
96
93
92
91
89
88
65
58
48
46
45
40
39
35
34
0
58
48
0
123
97
91
65
58
48
0
123
97
91
65
58
48
0
116
115
0
101
100
0
111
110
101
100
0
100
99
0
100
99
0
101
100
0
0
255
128
127
97
96
93
92
40
39
35
34
32
0
255
128
127
97
96
93
92
40
39
35
34
32
0
123
121
120
117
116
115
114
113
112
111
110
97
96
93
92
91
89
88
65
58
48
40
39
35
34
0
123
97
91
65
58
48
0
123
97
91
65
58
48
0
255
128
127
123
97
96
93
92
91
65
58
48
40
39
35
34
32
0
102
101
0
0
102
101
0
101
100
0
109
108
0
115
114
0
102
101
0
255
128
127
123
97
96
93
92
91
65
58
48
40
39
35
34
32
0
255
128
127
123
97
96
93
92
91
65
58
48
40
39
35
34
32
0
103
102
0
118
117
0
112
111
0
103
102
0
255
128
127
123
97
96
93
92
91
65
58
48
40
39
35
34
32
0
255
128
127
123
97
96
93
92
91
65
58
48
40
39
35
34
32
0
33
32
14
12
11
10
0
101
100
0
33
32
14
12
11
10
0
106
105
0
255
128
127
123
97
96
93
92
91
65
58
48
40
39
35
34
32
0
255
128
127
97
96
93
92
40
39
35
34
32
0
123
97
96
95
91
65
33
32
14
12
11
10
0
102
101
0
123
97
96
95
91
65
33
32
14
12
11
10
0
111
110
0
255
128
127
97
96
93
92
40
39
35
34
32
0
123
97
96
95
91
65
58
48
0
33
32
14
12
11
10
0
123
97
96
95
91
65
62
61
58
48
41
40
33
32
14
12
11
10
0
102
101
0
255
128
127
33
32
14
12
11
10
0
62
61
41
40
33
32
14
12
11
10
0
255
128
127
62
61
45
44
42
41
33
32
14
12
11
10
0
256
36
35
0
33
32
14
12
11
10
0
255
128
127
33
0
255
128
127
62
61
45
44
42
41
33
32
14
12
11
10
0
256
110
109
102
101
36
35
0
123
97
96
95
91
65
33
32
14
12
11
10
0
45
44
42
41
33
32
14
12
11
10
0
62
61
33
32
14
12
11
10
0
256
111
110
36
35
0
256
98
97
36
35
0
123
97
96
95
91
65
58
48
0
256
101
100
36
35
0
256
100
99
36
35
0
0
256
115
114
36
35
0
256
112
111
36
35
0
EdgeS
0
7
0
7
11
7
11
15
0
7
11
0
11
15
7
14
13
7
12
7
11
10
7
9
8
7
6
0
5
0
4
3
0
2
0
0
0
0
2
0
0
5
0
0
7
0
7
0
7
0
7
0
7
0
7
0
7
0
7
0
7
0
0
8
0
8
0
8
17
8
0
8
16
8
0
0
7
0
7
0
7
0
21
0
20
0
19
0
18
0
7
0
7
0
7
0
7
0
7
0
7
0
0
22
23
22
23
22
23
25
23
24
23
22
23
22
0
0
12
0
0
13
0
13
0
0
0
15
0
15
0
26
0
0
0
27
28
27
8
27
8
27
8
27
8
27
8
0
8
0
27
28
27
0
27
0
8
0
8
0
0
30
0
29
0
0
32
0
31
0
0
33
0
0
34
0
0
35
0
0
36
0
36
0
36
38
36
37
36
24
36
0
36
0
0
0
39
40
39
36
39
36
39
36
39
36
39
36
0
36
0
39
40
39
0
39
0
35
0
36
0
36
0
0
26
0
0
8
0
8
0
8
0
0
41
0
41
0
41
0
0
42
0
0
43
0
0
45
0
44
0
0
46
0
0
47
0
0
48
0
0
0
36
0
36
0
36
38
36
24
36
0
36
0
0
36
0
36
0
36
38
36
24
36
0
36
0
0
39
40
39
36
39
36
39
36
39
36
39
36
0
36
0
39
40
39
0
39
0
36
0
36
0
0
36
0
36
0
36
0
0
49
0
49
0
49
0
0
8
0
8
50
0
8
17
8
50
8
50
8
0
8
16
8
0
0
43
0
0
0
51
0
0
44
0
0
52
0
0
53
0
0
54
0
0
36
0
36
55
0
36
38
36
55
36
55
36
24
36
0
36
0
0
8
0
8
56
0
8
17
8
56
8
56
8
0
8
16
8
0
0
57
0
0
58
0
0
59
0
0
60
0
0
36
0
36
61
0
36
38
36
61
36
61
36
24
36
0
36
0
0
8
0
8
62
0
8
17
8
62
8
62
8
0
8
16
8
0
0
63
0
63
0
63
0
0
64
0
0
65
0
65
0
65
0
0
66
0
0
36
0
36
67
0
36
38
36
67
36
67
36
24
36
0
36
0
0
8
0
8
0
8
17
8
0
8
16
8
0
0
68
0
68
0
68
0
63
0
63
0
63
0
0
69
0
0
70
0
70
0
70
0
65
0
65
0
65
0
0
71
0
0
36
0
36
0
36
38
36
24
36
0
36
0
0
68
0
68
0
68
0
68
0
0
72
0
72
0
72
0
0
70
0
70
0
70
0
75
0
70
0
74
0
73
0
73
0
73
0
0
76
0
0
77
0
77
72
0
72
0
72
0
0
75
0
74
0
73
0
73
0
73
0
0
78
0
78
0
78
0
78
0
78
74
0
74
0
74
0
0
75
79
75
0
80
0
80
0
80
0
0
77
0
77
0
0
78
0
78
0
78
74
78
82
78
81
0
81
0
81
0
0
75
84
75
83
75
79
75
0
85
0
85
0
85
0
80
0
80
0
80
0
0
74
0
82
0
81
0
81
0
81
0
0
75
0
82
0
82
0
82
0
0
75
86
75
79
75
0
75
87
75
79
75
0
85
0
85
0
85
0
85
0
0
75
88
75
79
75
0
75
89
75
79
75
0
0
75
90
75
79
75
0
75
0
75
79
75
TokId
[other]
Space
Line
Page
Etx
Parenthesis
Comment
Ide
Nat
Opr
Set
Seq
MacInc
MacDel
MacDfn
MacSep
MacCond
Flags
0
1
1
1
1
0
0
0
0
0
0
0
0
0
0
0
0
styx-2.0.1/libcs/StyxScanner.cs 0000644 0001750 0001750 00000207421 12114651455 013360 0000000 0000000 /* ------------------------------------------------------------------------ */
/* */
/* [StyxScanner.cs] Styx Scanner Implementation (C#) */
/* */
/* This file belongs to the Styx Scanner & parser generator. */
/* */
/* Copyright (c) 2008 by Doelle, Manns */
/* ------------------------------------------------------------------------ */
using System;
using System.Text;
using System.IO;
using System.Collections;
/** @file
Styx scan stream and scanner
*/
namespace styx
{
/** @addtogroup StyxLibraryCPP
C++ Scanner & parser library
*/
//@{
/** @addtogroup StyxStreamScanner
Styx scan stream and scanner
*/
//@{
/* Scan stream ------------------------------------------------------------ */
/** @addtogroup StyxStream
Styx scan stream
*/
//@{
/** abstract scan stream */
public abstract class CStyxStream
{
//! (report) stream error
//! @param Text error message
protected virtual void error(string Text)
{
Console.Error.WriteLine(Text);
}
public abstract bool valid(); //!< stream is valid ?
//!< @return true for a valid stream
public abstract int sgetc(); //!< read next character from stream
//!< @return character code
public virtual bool eof(int c) //!< end of stream ?
{ //!< @param c current character
return c <= cEof; //!< @return true if c \<= cEof
}
public virtual string getFile() //!< get stream identifier
{ //!< @return stream identifier
return File;
}
//! set stream identifier
//! @param id stream identifier
public virtual void setFile(string id)
{
File = id;
}
protected string File; //!< stream identifier
protected int cEof; //!< EOF: -1 --\> binary, default=0 --\> text
public CStyxStream()
{
cEof = 0;
File = "";
}
}
/* String stream -------------------------------------------------------- */
//! string stream
public class CStyxStringStream : CStyxStream
{
protected string txt; //!< stream text
protected long pos; //!< stream position
//! The constructor creates a string stream.
//! @param ntxt stream text
public CStyxStringStream(string ntxt) : base()
{
this.cEof = 0;
txt = ntxt;
pos = (long)0;
}
//! The constructor creates a string stream.
//! @param ntxt stream text
//! @param id stream path / identifier
public CStyxStringStream(string ntxt, string id) : base()
{
txt = ntxt;
pos = (long)0;
}
//! set stream text
//! @param ntxt stream text
public virtual void setText(string ntxt)
{
txt = ntxt;
pos = (long)0;
}
//! get stream text
//! @return stream text
public virtual string getText()
{
return txt;
}
public override bool valid() // stream is valid ?
{
return true;
}
public override int sgetc() // get next character
{
if( pos >= (long)txt.Length )
return 0;
return (int)((txt[(int)pos++])&0xffff);
}
}
/* File stream ---------------------------------------------------------- */
//! file stream template
public class CStyxFileStream : CStyxStream
{
protected StreamReader reader;
//! The constructor creates a file stream.
//! @param Path stream path
//! @param id optional stream identifier
public CStyxFileStream(string Path, string id) : base()
{
this.cEof = -1;
if( id.Length > 0 ) this.File = id;
else this.File = Path;
try
{
reader = new StreamReader(Path);
}
catch(Exception e)
{
error("couldn't open '" + Path + "'" + Environment.NewLine + e.ToString());
}
}
//! The constructor creates a file stream according the given encoding.
//! @param Path stream path
//! @param id optional stream identifier
public CStyxFileStream(string Path, string id, Encoding code) : base()
{
this.cEof = -1;
if( id.Length > 0 ) this.File = id;
else this.File = Path;
try
{
reader = new StreamReader(Path,code);
}
catch(Exception e)
{
error("couldn't open '" + Path + "'" + Environment.NewLine + e.ToString());
}
}
~CStyxFileStream()
{
if( reader != null ) reader.Close();
}
public override bool valid() // stream is initialized ?
{
return reader != null;
}
public override int sgetc() // get next character from file stream
{
try
{
return ( reader == null ) ? -1 : reader.Read();
}
catch(Exception e)
{
error("read character failed" + Environment.NewLine + e.ToString());
return -1;
}
}
}
//@}
/* Scanner ---------------------------------------------------------------- */
/** @addtogroup StyxScanner
Styx scanner
*/
//@{
//! stream and scanner position
public struct StyxStreamPos
{
public CStyxStream Stream; //!< scan stream
public long Line; //!< corresponding stream line
public long Column; //!< corresponding stream column
public int curChar; //!< corresponding stream character
public ArrayList Backbuffer; //!< corresponding backbuffer (int)
}
//! scanner
public class CStyxScanner
{
protected static short i32HighValue(int v)
{
return (short)(((int)(v)) >> 16);
}
protected static short i32LowValue(int v)
{
return (short)(((int)(v)) & 0xFFFFL);
}
protected static int i32Value(short h, short l)
{
return
(int)((((int)(h)) << 16) & 0xFFFF0000L)
| (int)(((int)(l)) & ((int)0x0000FFFFL));
}
/** token IDs within a dyck scanner */
public enum EStyxDyckTokID
{
SCN_DYCKTOKEN_PREFIX = 1, //!< dyck token prefix (left par)
SCN_DYCKTOKEN_SUFFIX = 2, //!< dyck token suffix (right par)
SCN_DYCKTOKEN_PATTERN = 3 //!< dyck token body
}
/** token flags */
public enum EStyxTokFlag
{
SCN_FLG_IgnoreToken = 1, //!< token has to be ignored
SCN_FLG_IgnoreCase = 2, //!< case insensitive token
SCN_FLG_EofToken = 4, //!< unsupported: eof token in embedded language
SCN_FLG_SwitchToken = 8, //!< unsupported: switch to/from embedded language
SCN_FLG_CfgToken = 16, //!< unsupported: embedded language token
SCN_FLG_IndentToken = 32, //!< unsupported: (de)indent token
SCN_FLG_PatternToken = 64, //!< (start or end) pattern token
SCN_FLG_GroupStack = 128 //!< push/pop token group
}
/** all UCS4 character */
public static uint SCN_CHAR_SET_SIZE
{
get { return (0xFFFFFFFFu); }
}
/** separator between token ID and pattern */
public static char SCN_SEP_TOK_ID_PATTERN
{
get { return '@'; }
}
protected delegate bool T_next();
protected bool initok; //!< scan table import result
protected string Name; //!< lexical language ( or group ) name
/** @name SingleScannerAttributes
single scanner specification
*/
//@{
protected ArrayList StaEdg; //!< [states] --\> first edge (int)
protected ArrayList StaFin; //!< [states] --\> -1 or token index (short)
protected ArrayList EdgeC ; //!< [edges] --\> lower character (uint[])
protected ArrayList EdgeS ; //!< [edges] --\> state (int)
protected ArrayList TokId ; //!< [tokens] --\> internal token names (string)
protected ArrayList Flags ; //!< [tokens] --\> ORed token flags (byte)
//!< @link #EStyxTokFlag (--\> definition) @endlink
//@}
/** @name GroupScannerAttributes
group scanner specification
*/
//@{
protected ArrayList GrpScn; //!< group scanners (CStyxScanner)
protected Hashtable Switch; //!< token --\> group (short,short)
protected ArrayList GroupStack; //!< group control stack (short)
//@}
/** @name DyckTokenAttributes
dyck token specification
*/
//@{
protected ArrayList dyckidx; //!< [dyck tokens] --\> token index (short)
protected ArrayList dyckpat; //!< [dyck tokens] --\> dyck scanner (CStyxScanner)
protected Hashtable dscanner; //!< token --\> dyck scanner (short,CStyxScanner)
//@}
/** @name PatternTokenAttributes
pattern token specification and attributes
*/
//@{
protected short cPatCnt; //!< number of pattern characters
protected short cPatTok; //!< current start pattern token
protected short cPatGrp; //!< current start pattern group
protected string cPatSym; //!< current end pattern matchcode
protected Hashtable cPatMap; //!< start pattern (group|token) --\> pattern set (long,string)
protected Hashtable cQPatMap; //!< quotient (group|token) --\> pattern set/seq (long,string)
//@}
/** current scan stream */
protected CStyxStream cStream;
/** token and stream location */
protected long cLine, cCol, nLine, nCol;
/** @name SymbolConstructionAttributes
symbol under construction
*/
//@{
protected string buffer; //!< buffer with scanned unicode characters
protected bool lookahead; //!< character look-ahead enabled ?
protected ArrayList bbuffer; //!< look-ahead backbuffer (char,besser:uint?)
protected int cC; //!< current character
protected short cTok, Group; //!< current token and group
protected Hashtable skipC; //!< characters to skip (uint,null)
protected T_next next; //!< current token separation function
//@}
/** @name PreprocessingAttributes
preprocessing attributes
*/
//@{
protected bool preprocess; //!< preprocessing enabled ?
protected ArrayList pstreams; //!< stream and position stack (StyxStreamPos)
//@}
//! reset scanner (table) and stream
protected virtual void reset()
{
initok = false;
Name = "";
if( pstreams == null ) pstreams = new ArrayList();
deleteStreams();
cC = cTok = Group = -1;
cLine = cCol = nLine = nCol = 1;
next = new T_next(this.nextToken_default);
cPatTok = cPatGrp = -1;
StaEdg = new ArrayList();
StaFin = new ArrayList();
EdgeC = new ArrayList();
EdgeS = new ArrayList();
TokId = new ArrayList();
Flags = new ArrayList();
GrpScn = new ArrayList();
Switch = new Hashtable();
GroupStack = new ArrayList();
dyckidx = new ArrayList();
dyckpat = new ArrayList();
dscanner = new Hashtable();
cPatMap = new Hashtable();
cQPatMap = new Hashtable();
bbuffer = new ArrayList();
skipC = new Hashtable();
buffer = "";
}
//! delete preprocessing streams and reset main stream
protected virtual void deleteStreams()
{
pstreams.Clear();
cStream = null;
}
//! (report) scanner error
//! @param Text error message
protected virtual void error(string Text)
{
Console.Error.WriteLine(Text);
}
/** @name ImportScannerTable
scanner table import and validation
*/
//@{
//! set language or group name to current (group) scanner
//! @param Language language or group name
protected virtual void setLanguage(string Language)
{
Name = Language;
}
//! add token to current (group) scanner
//! @param Token internal token name
protected virtual void addToken(string Token)
{
TokId.Add(Token);
}
//! add token flags to current (group) scanner
//! @param Flag ORed token flags
//! @link #EStyxTokFlag (--\> definition) @endlink
protected virtual bool addTokenFlags(byte Flag)
{
Flags.Add(Flag);
bool result = (Flag&(byte)EStyxTokFlag.SCN_FLG_IndentToken) == 0 &&
(Flag&(byte)EStyxTokFlag.SCN_FLG_CfgToken) == 0 &&
(Flag&(byte)EStyxTokFlag.SCN_FLG_EofToken) == 0 &&
(Flag&(byte)EStyxTokFlag.SCN_FLG_SwitchToken) == 0;
if( !result )
error("unsupported token flags");
return result;
}
//! add the final token for a state to current (group) scanner
//! @param Token token index \>= 0 or -1 for a non-final state
//! @return true or false on error
protected virtual void addFinalState(short Token)
{
StaFin.Add(Token);
}
//! add the first edge for a state to current (group) scanner
//! @param FirstEdge first edge index \>= 0
protected virtual void addFirstEdge(long FirstEdge)
{
StaEdg.Add(FirstEdge);
}
//! add the state for an edge to current (group) scanner
//! @param State state index \>= 0
protected virtual void addEdgeState(long State)
{
EdgeS.Add(State);
}
//! add the unicode character for an edge to current (group) scanner
//! @param Character unicode character
protected virtual void addEdgeChar(uint Character)
{
EdgeC.Add(Character);
}
//! add dyck token to current (group) scanner
//! @param Token token index \>= 0
protected virtual void addDyckToken(short Token)
{
dyckidx.Add(Token);
}
//! add dyck scanner to current (group) scanner
//! @param Scanner dyck scanner
protected virtual void addDyckScanner(ref CStyxScanner Scanner)
{
dyckpat.Add(Scanner);
}
//! create and add a dyck scanner to current (group) scanner
protected virtual void addDyckScanner()
{
dyckpat.Add(new CStyxScanner());
}
//! add group scanner
//! @param Scanner group scanner
protected virtual void addGroupScanner(ref CStyxScanner Scanner)
{
GrpScn.Add(Scanner);
}
//! create and add a group scanner
protected virtual void addGroupScanner()
{
GrpScn.Add(new CStyxScanner());
}
//! add the follow group for a token to current group scanner
//! @param Token token index \>= 0
//! @param Group group index \>= 0
protected virtual void addSwitchToken(short Token, short Group)
{
Switch[Token] = Group;
}
//! get current group scanner
//! @param cScanner [result] current group scanner
protected virtual void currentGroupScanner(ref CStyxScanner cScanner)
{
if( GrpScn.Count > 0 )
{
cScanner = (CStyxScanner)GrpScn[GrpScn.Count-1];
}
else
{
cScanner = this;
}
}
//! get current dyck scanner
//! @param cScanner [result] current dyck scanner
protected virtual void currentDyckScanner(ref CStyxScanner cScanner)
{
CStyxScanner curgrp = null;
currentGroupScanner(ref curgrp);
if( curgrp.dyckpat.Count > 0 )
{
cScanner = (CStyxScanner)curgrp.dyckpat[curgrp.dyckpat.Count-1];
}
else
{
cScanner = null;
}
}
//! import next scanner table line
//! @param line [update] current source line
//! @param cScanner [changeable] current (group) scanner
//! @param Object [result] current resource identifier
//! @param tokidx [update] current token index
//! @return true or false on error
protected virtual bool loadTableLine
(
ref string line, ref CStyxScanner cScanner,
ref string Object, ref short tokidx
)
{
if( line.Length > 0 && line[0] != '#' )
{
int pos = line.IndexOf("Name=");
if( pos >= 0 && pos < line.Length )
{
cScanner.setLanguage(line.Substring(pos+5));
}
else
if( line == "Group" )
{
addGroupScanner();
currentGroupScanner(ref cScanner);
}
else
if( line == "Dyck" )
{
cScanner.addDyckScanner();
currentDyckScanner(ref cScanner);
}
else
if( line == "Language" )
{
cScanner = this;
}
else
if( line[0] != '-' && !Char.IsDigit(line[0]) && !Char.IsWhiteSpace(line[0]) )
{
Object = line;
tokidx = 0;
}
else
if( Char.IsWhiteSpace(line[0]) )
{
cScanner.addToken(line.Substring(1));
}
else
if( line[0] == '-' || Char.IsDigit(line[0]) )
{
long v = System.Convert.ToInt64(line);
if( Object == "StaEdg" )
{
cScanner.addFirstEdge((long)v);
}
else
if( Object == "StaFin" )
{
cScanner.addFinalState((short)v);
}
else
if( Object == "EdgeC" )
{
cScanner.addEdgeChar((uint)v);
}
else
if( Object == "EdgeS" )
{
cScanner.addEdgeState((long)v);
}
else
if( Object == "Flags" )
{
if( !cScanner.addTokenFlags((byte)v) )
{
return false;
}
}
else
if( Object == "Switch" )
{
cScanner.addSwitchToken(tokidx,(short)v);
tokidx++;
}
else
if( Object == "DyckToken" )
{
currentGroupScanner(ref cScanner);
cScanner.addDyckToken((short)v);
}
}
}
line = "";
return true;
}
//! check scanner table
//! @return true for a valid scanner table
protected virtual bool checkLoad()
{
bool result = GrpScn.Count > 0 ||
StaFin.Count > 0 && StaEdg.Count > 0 &&
EdgeS.Count > 0 && EdgeC.Count > 0 &&
TokId.Count > 0 && TokId.Count == Flags.Count;
if( !result ) error("invalid scanner table format");
return result;
}
//@}
/** @name PreparePattern
pattern and quotient token preparation
*/
//@{
//! get pattern symbol from specification
//! @param p pattern symbol specification
//! @param seq sequence pattern ?
//! @param result [result] pattern symbol
//! @return true or false on error
protected virtual bool initPatternSymbol(string p, bool seq, ref string result)
{
int len = p.Length;
result = "";
if( len > 0 && len % 3 != 0 )
{
error("invalid start pattern or quotient token ID");
return false;
}
for( int i=0; i < len; i+=3 )
{
char[] buf = new char[4]; int c1, c2;
buf[0] = p[i];
buf[1] = p[i+1];
buf[2] = p[i+2];
buf[3] = '\0';
c1 = System.Convert.ToInt32(buf);
if( i == 0 )
{
if( seq )
{
if( ((char)c1) != '"' && ((char)c1) != '\'' )
{
error("invalid quotient token ID");
return false;
}
}
else
{
if( c1 != 0 )
{
error("invalid pattern token ID");
return false;
}
continue;
}
}
result += (char)c1;
if( p[i+3] == '.' )
{
if( i+9 > len )
{
error("invalid start pattern or quotient token ID");
return false;
}
i += 6;
buf[0] = p[i];
buf[1] = p[i+1];
buf[2] = p[i+2];
buf[3] = '\0';
c2 = System.Convert.ToInt32(buf);
while( ++c1 <= c2 )
{
result += (char)c1;
}
}
}
if( !seq && result.Length == 0 )
{
error("missing pattern characters");
return false;
}
return true;
}
//! add a quotient or pattern token to the corresponding map
//! @param p pattern symbol specification
//! @param idx combined group and token index \>= 0
//! @param pat pattern token ?
//! @return true or false on error
protected virtual bool initPatternMap(string p, long idx, bool pat)
{
string patsym = "";
if( pat )
{ int pos = p.IndexOf(SCN_SEP_TOK_ID_PATTERN);
if( pos >= 0 && pos < p.Length )
{ string p1, p2;
p1 = p.Substring(0,pos);
p2 = p.Substring(pos+1);
if( !cPatMap.Contains(idx) )
{
if( ! initPatternSymbol(p1,false,ref patsym) )
return false;
cPatMap[idx] = patsym;
}
if( !cQPatMap.Contains(idx) )
{
if( ! initPatternSymbol(p2,true,ref patsym) )
return false;
cQPatMap[idx] = patsym;
}
}
else
{
if( p.Substring(0,3) == "000" )
{
if( !cPatMap.Contains(idx) )
{
if( ! initPatternSymbol(p,false,ref patsym) )
return false;
cPatMap[idx] = patsym;
}
}
else
{
if( !cQPatMap.Contains(idx) )
{
if( ! initPatternSymbol(p,true,ref patsym) )
return false;
cQPatMap[idx] = patsym;
}
}
}
}
else
{
if( !cQPatMap.Contains(idx) )
{
if( ! initPatternSymbol(p,true,ref patsym) )
return false;
cQPatMap[idx] = patsym;
}
}
return true;
}
//! collect patterns of pattern and quotient tokens
//! @return true or false on error
protected virtual bool initPattern()
{
if( GrpScn.Count > 0 )
{
for( int i=0; i < GrpScn.Count; ++i )
{
for( int j=0; j < ((CStyxScanner)GrpScn[i]).TokId.Count; j++)
{
string tokid = (string)((CStyxScanner)GrpScn[i]).TokId[j];
int pos = tokid.IndexOf(SCN_SEP_TOK_ID_PATTERN);
if( pos >= 0 && pos < tokid.Length )
{
bool ok = initPatternMap
(
tokid.Substring(pos+1), i32Value((short)i,(short)j),
((byte)((CStyxScanner)GrpScn[i]).Flags[j]&(byte)EStyxTokFlag.SCN_FLG_PatternToken)!=0
);
if( !ok ) return false;
}
}
}
}
else
{
for (int j=0; j < TokId.Count; j++)
{
string tokid = (string)TokId[j];
int pos = tokid.IndexOf(SCN_SEP_TOK_ID_PATTERN);
if( pos >= 0 && pos < tokid.Length )
{ bool ok = initPatternMap
(
tokid.Substring(pos+1), i32Value(-1,(short)j),
((byte)Flags[j]&(byte)EStyxTokFlag.SCN_FLG_PatternToken)!=0
);
if( !ok ) return false;
}
}
}
return true;
}
//@}
/** @name SeparateToken
scan process / token separation
*/
//@{
//! separate next token in scan stream
//! (default function)
//! @return true or false on error
protected virtual bool nextToken_default()
{
int state = 0;
beginToken();
if( GrpScn.Count > 0 && cTok >= 0 &&
cTok == cPatTok && Group == cPatGrp && cPatSym.Length == 0 )
{ /* end pattern token switch already done */
cPatGrp = -1; cPatTok = -1;
}
else
if( GrpScn.Count > 0 && cTok >= 0 &&
((short)((CStyxScanner)GrpScn[Group]).Switch[cTok] >= 0 ||
((byte)Flags[cTok]&(byte)EStyxTokFlag.SCN_FLG_GroupStack) != 0) &&
!switchGroup((short)((CStyxScanner)GrpScn[Group]).Switch[cTok],false) )
return false;
LOOP:
/* '\0' (string) and -1 (file,buffer) is treated as EOF. */
cTok = -1; /* -1 == ETX */
if ( !cStream.eof(cC) )
{
/*
register wchar_t* i;
wchar_t* s = (wchar_t*)EdgeC.data();
*/
// handle character look-ahead ...
long cBackLen = -1, nBackLin = -1, nBackCol = -1;
short cBackTok = -1;
// ... handle character look-ahead
/*
state = 0;
for (i = &s[StaEdg[state]]; *i++ > (wchar_t)cC; );
state = EdgeS[i-s-1]-1;
*/
state = 0;
long i, s;
for( s = i = (long)StaEdg[state]; (uint)EdgeC[(int)i++] > (uint)cC; );
state = (int)((long)EdgeS[(int)(i-s-1)]-1);
while (state >= 0)
{
/* n character look-ahead:
jeweils den größten Endzustand merken, zusammen mit Tokenlänge.
nach der schleife,
1) wert oder fehler
2) fehler mit vorangegangenem Wert -->
zurücksetzen auf ende wertposition via backbuffer und fortsetzen
*/
cTok = (short)StaFin[state]; getCharacter();
// handle character look-ahead ...
if( lookahead && cTok > 0 )
{
cBackLen = currentLength();
nBackLin = nLine; nBackCol = nCol;
cBackTok = cTok;
}
// ... handle character look-ahead
if ( cStream.eof(cC) )
{
break;
}
/*
for (i = &s[StaEdg[state]]; *i++ > (wchar_t)cC; );
state = EdgeS[i-s-1]-1;
*/
for( i = (long)StaEdg[state]; (uint)EdgeC[(int)i++] > (uint)cC; );
state = (int)((long)EdgeS[(int)(i-s-1)]-1);
}
// handle character look-ahead ...
if( lookahead && cTok == 0 && cBackTok > 0 )
{
cTok = cBackTok; backbufLookahead(cBackLen,nBackLin,nBackCol);
}
// ... handle character look-ahead
if( currentLength() == 0 && !cStream.eof(cC) )
{ getCharacter(); cTok = 0; }
// process dyck token ...
if( dscanner.Contains(cTok) && !nextToken_dyck() )
return false;
// ... process dyck token
if( ((byte)Flags[cTok]&(byte)EStyxTokFlag.SCN_FLG_IgnoreToken) != 0 )
{ beginToken();
if( GrpScn.Count > 0 && cTok >= 0 &&
((short)((CStyxScanner)GrpScn[Group]).Switch[cTok] >= 0 ||
((byte)Flags[cTok]&(byte)EStyxTokFlag.SCN_FLG_GroupStack) != 0) &&
!switchGroup((short)((CStyxScanner)GrpScn[Group]).Switch[cTok],false) )
return false;
goto LOOP;
}
}
return endToken();
}
//! separate dyck token in scan stream
//! @return true or false on error
protected virtual bool nextToken_dyck()
{
int state = 0, cnt = 1; long cLen = currentLength();
short dTok = cTok;
CStyxScanner dyck = (CStyxScanner)dscanner[cTok];
LOOP:
cLen = currentLength();
cTok = -1; /* -1 == ETX */
if ( !cStream.eof(cC) )
{
/*
register wchar_t* i;
wchar_t* s = (wchar_t*)dyck.EdgeC.data();
state = 0;
for (i = &s[dyck.StaEdg[state]]; *i++ > cC; );
state = dyck.EdgeS[i-s-1]-1;
*/
state = 0;
long i, s;
for( s = i = (long)dyck.StaEdg[state]; (uint)EdgeC[(int)i++] > cC; );
state = (int)((long)dyck.EdgeS[(int)(i-s-1)]-1);
while (state >= 0)
{
cTok = (short)dyck.StaFin[state]; getCharacter();
if ( cStream.eof(cC) )
break;
/*
for (i = &s[dyck.StaEdg[state]]; *i++ > cC; );
state = dyck.EdgeS[i-s-1]-1;
*/
for( i = (long)dyck.StaEdg[state]; (uint)EdgeC[(int)i++] > cC; );
state = (int)((long)dyck.EdgeS[(int)(i-s-1)]-1);
}
if((currentLength() - cLen) == 0 && !cStream.eof(cC))
{ getCharacter(); cTok = 0; }
}
if( cTok > 0 || ( cTok == 0 && dyck.TokId.Count == 3 ) )
{
if( cTok == (short)EStyxDyckTokID.SCN_DYCKTOKEN_PREFIX ) ++cnt;
else
if( cTok == (short)EStyxDyckTokID.SCN_DYCKTOKEN_SUFFIX ) --cnt;
if( cnt == 0 ) cTok = dTok;
else goto LOOP;
}
return true;
}
//! re-init current scan group
//! @param Group scan group index \>= 0 or -1 for the top group on stack
//! @param asgflg = false --\> push/pop group to/from stack
//! @return true or false on error
protected virtual bool switchGroup(short Group, bool asgflg)
{
if( !asgflg )
{
if( Group == -1 )
{
if (cTok < 0 ||
((byte)Flags[cTok]&(byte)EStyxTokFlag.SCN_FLG_GroupStack) == 0 ||
GroupStack.Count <= 0)
{
error("group switch failed");
return false;
}
Group = (short)GroupStack[GroupStack.Count-1];
GroupStack.RemoveAt(GroupStack.Count-1);
}
else
if( ((byte)Flags[cTok]&(byte)EStyxTokFlag.SCN_FLG_GroupStack) != 0 )
{
GroupStack.Add(this.Group);
}
}
if( this.Group != Group )
{
this.Group = Group;
StaEdg = ((CStyxScanner)GrpScn[Group]).StaEdg;
StaFin = ((CStyxScanner)GrpScn[Group]).StaFin;
EdgeC = ((CStyxScanner)GrpScn[Group]).EdgeC;
EdgeS = ((CStyxScanner)GrpScn[Group]).EdgeS;
Flags = ((CStyxScanner)GrpScn[Group]).Flags;
dscanner.Clear();
for( int i=0; i < ((CStyxScanner)GrpScn[Group]).dyckidx.Count; ++i )
{
dscanner[(short)((CStyxScanner)GrpScn[Group]).dyckidx[i]] =
(CStyxScanner)((CStyxScanner)GrpScn[Group]).dyckpat[i];
}
}
return true;
}
//! get buffer length of scanned (unicode) characters
//! @return buffer length
protected virtual long currentLength()
{
return (long)buffer.Length;
}
//! init next token ( clear buffer, init position )
protected virtual void beginToken()
{
cCol = nCol; cLine = nLine;
buffer = "";
}
//! add (unicode) character to buffer
//! @param c (unicode) character
protected virtual void addCharacter(int c)
{
buffer += (char)c;
}
//! save current and get next valid (unicode) character
//! and update token position
protected virtual void getCharacter()
{
addCharacter(cC);
if (cC == (int)'\n')
{ nLine += 1; nCol = 1; }
else
{ nCol += 1; }
if( bbuffer.Count > 0 )
{
cC = (int)bbuffer[bbuffer.Count-1];
bbuffer.RemoveAt(bbuffer.Count-1);
}
else
{
cC = cStream.sgetc();
if( skipC.Count > 0 ) skipCharacter();
}
}
//! skip non-valid (unicode) characters in current scan stream
protected virtual void skipCharacter()
{
while( skipC.Contains(cC) )
{
if (cC == (int)'\n')
{ nLine += 1; nCol = 1; }
else
{ nCol += 1; }
cC = cStream.sgetc();
}
}
//! finalize next token
//! ( handle case, pattern/quotient token and preprocessing )
//! @return true or false on error
protected virtual bool endToken()
{
//Console.WriteLine("TOKEN-BUFFER="+buffer);
if (cTok >= 0 && ((byte)Flags[cTok]&(byte)EStyxTokFlag.SCN_FLG_IgnoreCase) != 0)
{
buffer = buffer.ToLower(); //FIXME:cultureinfo
}
if( cTok == -1 ) /* EOF */
{
if( pstreams.Count > 0 )
{
if( cStream != null ) cStream = null;
cStream = ((StyxStreamPos)pstreams[pstreams.Count-1]).Stream;
nLine = ((StyxStreamPos)pstreams[pstreams.Count-1]).Line;
nCol = ((StyxStreamPos)pstreams[pstreams.Count-1]).Column;
bbuffer = ((StyxStreamPos)pstreams[pstreams.Count-1]).Backbuffer;
cC = ((StyxStreamPos)pstreams[pstreams.Count-1]).curChar;
pstreams.RemoveAt(pstreams.Count-1);
return nextToken();
}
}
else
if( cTok > 0 )
{
if( cQPatMap.Count > 0 && !endQuotient() )
return false;
if( cTok > 0 &&
((byte)Flags[cTok]&(byte)EStyxTokFlag.SCN_FLG_PatternToken) != 0 &&
!endPattern() )
return false;
if( cTok > 0 && preprocess )
{
CStyxStream PStream = cStream;
string Token = "";
string Value = "";
if( !currentToken(ref Token,ref Value) )
return false;
//Console.WriteLine("preprocess "+Token);
if( !preprocessToken(ref PStream,ref Token,ref Value) )
{
error("preprocessing failed");
return false;
}
if( PStream == cStream ) buffer = Value;
//Console.WriteLine("preprocess2 "+Token);
if( PStream != cStream )
{
if( PStream != null )
{ StyxStreamPos curStreamPos = new StyxStreamPos();
curStreamPos.Stream = cStream;
curStreamPos.Line = nLine;
curStreamPos.Column = nCol;
curStreamPos.Backbuffer = bbuffer;
curStreamPos.curChar = cC;
pstreams.Add(curStreamPos);
cStream = PStream;
cC = cStream.sgetc();
nLine = nCol = 1;
bbuffer.Clear();
//Console.WriteLine("preprocess3 "+PStream.getFile());
}
return nextToken();
}
//Console.WriteLine("preprocess4");
}
}
return true;
}
//! finalize pattern token
//! @return true or false on error
protected virtual bool endPattern()
{
long idx = -1;
if( GrpScn.Count > 0 )
idx = i32Value((short)this.Group,(short)cTok);
else
idx = i32Value((short)-1,(short)cTok);
if( cPatSym.Length == 0 && cPatMap.Contains(idx) )
{ /* start pattern token */
cPatTok = cTok;
if( GrpScn.Count > 0 )
cPatGrp = Group;
/* get pattern set */
string pat = (string)cPatMap[idx];
cPatCnt = (short)pat.Length;
/* get pattern */
long i;
for( i=0; i < buffer.Length; ++i )
{
int pos = pat.IndexOf(buffer[(int)i]);
if( pos >= 0 && pos < pat.Length )
break;
}
for( ; i < buffer.Length; ++i )
{
int pos = pat.IndexOf(buffer[(int)i]);
if( pos >= 0 && pos < pat.Length )
cPatSym += buffer[(int)i];
else break;
}
if( cPatSym.Length == 0 )
cTok = 0; /* error */
}
else
if( cPatSym.Length > 0 && !cPatMap.Contains(idx) )
{ /* end pattern token, try to match pattern */
long pos = buffer.IndexOf(cPatSym);
if( pos >= 0 && pos < buffer.Length )
{
if( cPatCnt != 1 || pos + cPatSym.Length >= buffer.Length ||
buffer[(int)(pos+cPatSym.Length)] != cPatSym[0] )
{
/* pattern found */
cTok = cPatTok; cPatSym = "";
if( GrpScn.Count > 0 && !switchGroup(cPatGrp,true) )
return false;
}
}
}
else cTok = 0; /* error */
return true;
}
//! finalize quotient token
//! @return true or false on error
protected virtual bool endQuotient()
{
long idx = -1;
if( GrpScn.Count > 0 )
idx = i32Value((short)this.Group,(short)cTok);
else
idx = i32Value((short)-1,(short)cTok);
if( cQPatMap.Contains(idx) )
{
/* get quotient pattern */
string pat = (string)cQPatMap[idx];
long len = pat.Length-1;
/* push back quotient */
if( len > 0 )
{
if( pat[0] == '"' ) /* sequence */
{
if( buffer.Length <= len )
cTok = 0; /* error; = --> endless recursion */
else
{
long pos = buffer.IndexOf(pat.Substring(1),(int)(buffer.Length-len));
if( pos >= 0 && pos < buffer.Length )
backbufQuotient(buffer.Length-len);
else
cTok = 0; /* error; = --> endless recursion */
}
}
else
{ long i;
pat = pat.Substring(1);
for( i=buffer.Length-1; i >= 0; --i )
{
int pos = pat.IndexOf(buffer[(int)i]);
if( pos < 0 || pos >= pat.Length )
break;
}
if( i < 0 ) cTok = 0; /* error: endless recursion */
else
if( i < buffer.Length-1 )
backbufQuotient(i+1);
}
}
}
return true;
}
//! save quotient to backbuffer
//! @param cBackLen quotient length
protected virtual void backbufQuotient(long cBackLen)
{
long i;
bbuffer.Add((char)cC);
for( i=((long)buffer.Length)-1; i > cBackLen; --i )
bbuffer.Add(buffer[(int)i]);
cC = (int)buffer[(int)i];
buffer.Remove((int)i,1);
for( i=0, nLine=cLine, nCol=cCol; i < cBackLen; ++i )
{
if( buffer[(int)i] == '\n' )
{ nLine += 1; nCol = 1; }
else
{ nCol += 1; }
}
}
//! save look-ahead to backbuffer and update stream position
//! @param cBackLen look-ahead length
//! @param nBackLin stream line
//! @param nBackCol stream column
protected virtual void backbufLookahead
(
long cBackLen, long nBackLin, long nBackCol
)
{
long i;
bbuffer.Add((char)cC);
for( i=((long)buffer.Length)-1; i > cBackLen; --i )
bbuffer.Add(buffer[(int)i]);
cC = (int)buffer[(int)i];
buffer.Remove((int)i,1);
nLine = nBackLin; nCol = nBackCol;
}
//@}
//! preprocess handler if preprocessing is enabled
//! @param PStream [changeable] current scan stream
//! \n = initial value --\> update value of current token
//! \n = 0 --\> ignore current token
//! \n else --\> rescan new allocated stream,
//! \n afterwards deleted by the scanner
//! @param Token internal name of current token
//! @param Value [changeable] value of current token
//! @return true or false on error
protected virtual bool preprocessToken
(
ref CStyxStream PStream, ref string Token, ref string Value
)
{
return true;
}
//! The constructor creates an uninitialized scanner.
public CStyxScanner(/*bool lahead = false, bool process = false*/)
{
lookahead = false;
preprocess = false;
reset();
}
//! The constructor creates an uninitialized scanner.
//! @param lahead enable n character look-ahead ?
//! @param process enable preprocessing ?
public CStyxScanner(bool lahead, bool process)
{
lookahead = lahead;
preprocess = process;
reset();
}
//! scanner and stream are initialized ?
//! @return true for an initialized scanner and stream
public virtual bool initialized()
{
return initok && cStream != null && cStream.valid();
}
//! n character look-ahead enabled ?
//! @return true if n character look-ahead is enabled
public virtual bool LookaheadEnabled()
{
return lookahead;
}
//! preprocessing enabled ?
//! @return true if preprocessing is enabled
public virtual bool PreprocessEnabled()
{
return preprocess;
}
//! get language
//! @return language name or ""
public virtual string getLanguage()
{
if( !initok ) return "";
return Name;
}
//! get number of scan groups
//! @return number of scan groups or -1
public virtual short getGroups()
{
if( !initok ) return -1;
return (short)GrpScn.Count;
}
//! get scan group name
//! @param GrpIdx scan group index \>= 0
//! @return scan group name or ""
public virtual string getGroupID(short GrpIdx)
{
if( !initok ) return "";
return GrpIdx >= 0 && GrpIdx < GrpScn.Count
? ((CStyxScanner)GrpScn[GrpIdx]).Name : "";
}
//! get number of tokens
//! @return number of tokens or -1
public virtual short getTokens()
{
if( !initok ) return -1;
return (short)TokId.Count;
}
//! get number of tokens in scan group
//! @param GrpIdx scan group index \>= 0
//! @return number of tokens in scan group or -1
public virtual short getTokens(short GrpIdx)
{
if( !initok ) return -1;
if( GrpIdx == -1 )
return (short)TokId.Count;
else
return GrpIdx >= 0 && GrpIdx < GrpScn.Count
? (short)((CStyxScanner)GrpScn[GrpIdx]).TokId.Count : (short)-1;
}
//! get internal token name in scan group
//! @param TokIdx token index \>= 0
//! @return internal token name or ""
public virtual string getTokenID(short TokIdx)
{
if( !initok ) return "";
return TokIdx >= 0 && TokIdx < TokId.Count
? (string)TokId[TokIdx] : "";
}
//! get internal token name in scan group
//! @param TokIdx token index \>= 0
//! @param GrpIdx scan group index \>= 0
//! @return internal token name in scan group or ""
public virtual string getTokenID(short TokIdx, short GrpIdx)
{
if( !initok ) return "";
if( GrpIdx == -1 )
return TokIdx >= 0 && TokIdx < TokId.Count
? (string)TokId[TokIdx] : "";
else
return GrpIdx >= 0 && GrpIdx < GrpScn.Count &&
TokIdx >= 0 && TokIdx < ((CStyxScanner)GrpScn[GrpIdx]).TokId.Count
? (string)((CStyxScanner)GrpScn[GrpIdx]).TokId[TokIdx] : "";
}
//! import scanner table from file
//! @param Path path to the exported scanner table
//! @return true --> initialized scanner or false on error
public virtual bool loadTableFile(string Path)
{
reset();
try
{
using( StreamReader reader = new StreamReader(Path) ) //FIXME:Encoding
{
string line = "", Object = "";
CStyxScanner cScanner = this;
short tokidx = 0;
int c;
while( (c = reader.Read()) >= 0 )
{
if( (char)c == '\n' )
{
if( !loadTableLine(ref line,ref cScanner,ref Object,ref tokidx) )
return false;
}
else line += (char)c;
}
}
}
catch(Exception e)
{
error("couldn't read '" + Path + "'" + Environment.NewLine + e.ToString());
return false;
}
initok = checkLoad() && initPattern();
return initok;
}
//! import scanner table from string
//! @param Table exported scanner table
//! @return true --> initialized scanner or false on error
public virtual bool loadTableString(string Table)
{
reset();
string line = "", Object = "";
CStyxScanner cScanner = this;
short tokidx = 0;
char c;
for( long i=0; i < Table.Length; ++i )
{
c = Table[(int)i];
if( c == '\n' )
{
if( !loadTableLine(ref line,ref cScanner,ref Object,ref tokidx) )
return false;
}
else line += c;
}
initok = checkLoad() && initPattern();
return initok;
}
//! initialize scan process
//! @param Stream scan stream
//! @param SkipCharacters skip characters in stream
//! @return true or false on error
public virtual bool scanStream(ref CStyxStream Stream, ref Hashtable SkipCharacters /*uint,null*/)
{
if( !initok ) return false;
cStream = Stream;
if( cStream == null || !cStream.valid() )
{
error("invalid stream");
return false;
}
skipC = SkipCharacters;
if( skipC == null ) skipC = new Hashtable();
next = new T_next(this.nextToken_default);
if( GrpScn.Count > 0 )
{
Group = 0;
StaEdg = ((CStyxScanner)GrpScn[0]).StaEdg;
StaFin = ((CStyxScanner)GrpScn[0]).StaFin;
EdgeC = ((CStyxScanner)GrpScn[0]).EdgeC;
EdgeS = ((CStyxScanner)GrpScn[0]).EdgeS;
Flags = ((CStyxScanner)GrpScn[0]).Flags;
for( int i=0; i < ((CStyxScanner)GrpScn[0]).dyckidx.Count; ++i )
{
dscanner[(short)((CStyxScanner)GrpScn[Group]).dyckidx[i]] =
(CStyxScanner)((CStyxScanner)GrpScn[Group]).dyckpat[i];
}
}
else
{
Group = -1;
for( int i=0; i < dyckidx.Count; ++i )
{
dscanner[(short)dyckidx[i]] = (CStyxScanner)dyckpat[i];
}
}
cC = cStream.sgetc();
nLine = 1;
nCol = 1;
cTok = 0;
cPatCnt = 0;
cPatTok = cPatGrp = -1;
cPatSym = "";
bbuffer.Clear();
return initialized();
}
//! separate next token in scan stream
//! @return true or false on error
public virtual bool nextToken()
{
if( !initok || cStream == null ) return false;
if( next() ) return true;
deleteStreams();
return false;
}
//! end of scan stream ?
//! @return true on end of scan stream
public virtual bool eos()
{
return (cTok == -1);
}
//! get (current) scan stream
//! @param PStream [result] current scan stream or NULL
public virtual void getStream(ref CStyxStream PStream)
{
PStream = cStream;
}
//! get current token identifier and value
//! @param Token [result] internal token name
//! @param Value [result] token value
//! @return true or false on error
public virtual bool currentToken(ref string Token, ref string Value)
{
if( initok && cStream != null )
{
if (cTok == -1)
{
Token = "[EOF]";
return true;
}
else
if( GrpScn.Count > 0 )
{
Token = (string)((CStyxScanner)GrpScn[Group]).TokId[cTok];
}
else
{
Token = (string)TokId[cTok];
}
Value = buffer;
return true;
}
return false;
}
//! get external token name
//! @param Token internal token name
//! @return external token name
public virtual string externalTokenID(ref string Token)
{
int pos = Token.IndexOf(SCN_SEP_TOK_ID_PATTERN);
if( pos < 0 || pos >= Token.Length )
return Token;
else
return Token.Substring(0,pos);
}
//! current token is not case sensitive ?
//! @return true for a case insensitive token
public virtual bool ignoreCase()
{
if( !initok ) return false;
return (cTok >= 0 &&
((byte)Flags[cTok]&(byte)EStyxTokFlag.SCN_FLG_IgnoreCase) != 0);
}
/** @name CurrentTokenPosition
current token position
*/
//@{
//! get stream line of current token
public virtual long getLine()
{
return cLine;
}
//! get stream column of current token
public virtual long getCol()
{
return cCol;
}
//! get stream identifier
public virtual string getFile()
{
return cStream != null ? cStream.getFile() : "";
}
//@}
}
/* Scanner with standard Styx compliant preprocessing facility ------------ */
//! scanner with standard Styx compliant preprocessing facility
public class CStyxPScanner : CStyxScanner
{
//! preprocessing parameter type: index --\> value
/** Indexes of the default macro token identifiers, macro keywords
as well as the default include path and characterset
*/
public enum EStyxParIndex
{
IDX_TOK_IDE = 0, //!< token identifier
IDX_MAC_DFN = 1, //!< token define macro
IDX_MAC_SEP = 2, //!< token parameter separator (in macro calls)
IDX_MAC_INC = 3, //!< token include
IDX_MAC_COND = 4, //!< token condition
IDX_MAC_DEL = 5, //!< token undefine macro
IDX_KEY_START = 6, //!< initial keyword define macro
IDX_KEY_END = 7, //!< final keyword define macro, condition
IDX_KEY_IFDEF = 8, //!< initial keyword ifdef condition
IDX_KEY_IFNDEF = 9, //!< initial keyword ifndef condition
IDX_KEY_ELSE = 10, //!< initial keyword else condition
IDX_KEY_INC = 11, //!< initial keyword include
IDX_KEY_UNDEF = 12, //!< initial keyword undefine macro
IDX_INC_PATH = 13, //!< include path
IDX_INC_CSET = 14, //!< include characterset
IDX_PAR_END //!< end of parameter indexes
}
/*
protected:
typedef vector V_bool;
//! macro definition type: id --\> { formal parameter } text
typedef map M_macdfn;
//! macro callstack type: { id { actual parameter } }
typedef vector V_macexp;
*/
protected string[] MacParDefaults;
protected Hashtable Parameters; //!< preprocessing parameters (short,string)
//!< @link #EStyxParIndex index @endlink --\> value
protected Hashtable MacDefines; //!< macro definitions (string,string[])
protected ArrayList MacStack; //!< macro expressions / callstack (string[])
protected ArrayList CondStack; //!< condition stack (bool)
protected int CurSep; //!< current parameter separator (in macro calls)
protected string CurPar; //!< current macro parameter under construction or ""
protected bool MacIgnCase; //!< ignore case in macro identifiers ?
//!< ( must be true or match the case specification of the identifier token )
//! make full path name
//! @param dir directory path
//! @param file file name
//! @param sep path separator
//! @return the full path or file name
protected virtual string makePath
(
ref string dir, ref string file, string sep
)
{
if( dir.Length > 0 )
{
if( dir[dir.Length-1] == '/' ||
dir[dir.Length-1] == '\\' )
{
return dir + file;
}
else
if( sep.Length == 1 )
{
return dir + (( sep[0] == ':' ) ? "/" : "\\") + file;
}
else
{
int pos = dir.IndexOf("\\");
if( pos >= 0 && pos < dir.Length )
{
return dir + "\\" + file;
}
else
{
return dir + "/" + file;
}
}
}
return file;
}
//! set substream identifier relative to main stream position
//! @param PStream the new substream
protected virtual void setStreamID(ref CStyxStream PStream)
{
if( PStream == null ) return;
string id = getFile();
id += "(";
id += getLine().ToString();
id += ",";
id += getCol().ToString();
id += ")#";
id += PStream.getFile();
PStream.setFile(id);
}
//! create a new string stream for the evaluated macro
//! and set substream identifier relative to main stream position
//! @param id macro identifier
//! @param Text evaluated macro text
//! @return the allocated string stream or null on error
protected virtual CStyxStream createMacroStream(ref string id, ref string Text)
{
try
{
CStyxStream result = new CStyxStringStream(Text,id);
setStreamID(ref result);
return result;
}
catch(Exception e)
{
error("couldn't create macro stream '" + id + "'" + Environment.NewLine + e.ToString());
return null;
}
}
//! create a new file stream and set substream identifier
//! relative to main stream position
//! @param Path stream path
//! @return the allocated file stream or null on error
protected virtual CStyxStream createFileStream(ref string Path)
{
try
{
CStyxStream result = new CStyxFileStream(Path,"");
setStreamID(ref result);
return result;
}
catch(Exception e)
{
error("couldn't create file stream '" + Path + "'" + Environment.NewLine + e.ToString());
return null;
}
}
//! eval include directive
//! @param Value include directive
//! @return the allocated file stream or null on error
protected virtual CStyxStream evalInclude(ref string Value)
{
string k = (string)Parameters[(short)EStyxParIndex.IDX_KEY_INC];
int pos = Value.IndexOf(k);
if( pos != 0 )
{
error("unknown include keyword");
return null;
}
pos += k.Length;
while( pos < Value.Length && Char.IsWhiteSpace(Value[pos]) )
{
pos += 1;
}
if( pos >= Value.Length )
{
error("missing include file");
return null;
}
string f = Value.Substring(pos);
if( File.Exists(f) )
{
return createFileStream(ref f);
}
string p = System.Environment.GetEnvironmentVariable(f);
if( p == null ) p = f;
string s = ";:";
pos = p.IndexOfAny(s.ToCharArray());
if( pos >= 0 && pos < p.Length )
{
if( p[pos] == ';' ) s = ";";
else
if( pos < p.Length - 1 && p[pos+1] == '\\' )
s = ";";
else s = ":";
}
while( pos >= 0 && pos < p.Length )
{
string d = p.Substring(0,pos);
if( d.Length > 0 )
{
string fp = makePath(ref d,ref f,s);
if( fp.Length > 0 && File.Exists(fp) )
{
return createFileStream(ref fp);
}
}
p = p.Substring(pos+1);
pos = p.IndexOf(s);
}
if( p.Length > 0 )
{
string fp = makePath(ref p,ref f,s);
if( fp.Length > 0 && File.Exists(fp) )
{
return createFileStream(ref fp);
}
}
error("'" + f + "' not found");
return null;
}
//! set parameter separator (in macro calls)
//! @param Value parameter separator
protected virtual void setSeparator(ref string Value)
{
if( Value.Length >= 2 && !Char.IsWhiteSpace(Value[1]) )
CurSep = (int)Value[1];
else CurSep = 0;
}
//! part of an explicit separated parameter ?
//! @param Value token value
//! @return true for a partial parameter
protected virtual bool partialParameter(ref string Value)
{
return CurSep != 0 &&
( Value.Length != 1 || ((int)Value[0]) != CurSep );
}
//! apply macro
//! @param Definition macro definition (formal parameters, text)
//! @param Parameters macro call (actual parameters, id)
//! @return the evaluated macro text
protected virtual string applyMacro
(
ref ArrayList/*string*/ Definition, ref ArrayList/*string*/ Parameters
)
{
if( Definition.Count == 0 ) return "";
string text = (string)Definition[Definition.Count-1];
string res = "";
for( int i=0, j=0; i < text.Length; )
{
for( j=0; j < Definition.Count-1; ++j )
{
int pos = text.IndexOf((string)Definition[j],i);
if( pos == i ) break;
}
if( j < Definition.Count-1 )
{
res += (string)Parameters[j+1];
i += ((string)Definition[j]).Length;
}
else
{
res += text[i]; ++i;
}
}
return res;
}
//! eval macro parameter
//! @param Value macro parameter
//! @param id [result] identifier of the evaluated macro
//! @return the evaluated macro text or ""
protected virtual string evalMacroParameter(ref string Value, ref string id)
{
if( MacStack.Count == 0 ) return "";
ArrayList macexp = (ArrayList)MacStack[MacStack.Count-1];
id = (string)macexp[0];
macexp.Add(Value);
MacStack[MacStack.Count-1] = macexp;
ArrayList macdfn = (ArrayList)MacDefines[id];
if( macdfn.Count == macexp.Count )
{
string text = applyMacro(ref macdfn,ref macexp);
MacStack.RemoveAt(MacStack.Count-1);
if( MacStack.Count == 0 ) return text;
return evalMacroParameter(ref text, ref id);
}
return "";
}
//! eval macro call
//! @param Value macro name
//! @param id [result] identifier of the evaluated macro
//! @return the evaluated macro text or ""
protected virtual string evalMacroCall(ref string Value, ref string id)
{
if( !MacDefines.Contains(Value) ) return "";
ArrayList macdfn = (ArrayList)MacDefines[Value];
ArrayList call = new ArrayList();
id = Value;
if( MacStack.Count == 0 )
{
if( macdfn.Count == 0 ) return "";
if( macdfn.Count == 1 ) return (string)macdfn[0];
call.Add(Value);
MacStack.Add(call);
return "";
}
string par = "";
if( macdfn.Count == 0 )
return evalMacroParameter(ref par,ref id);
if( macdfn.Count == 1 )
{
par = (string)macdfn[0];
return evalMacroParameter(ref par,ref id);
}
call.Add(Value);
MacStack.Add(call);
return "";
}
//! eval undefine macro
//! @param Value undefine macro
//! @return true or false on error
protected virtual bool evalUndefine(ref string Value)
{
string u = (string)Parameters[(short)EStyxParIndex.IDX_KEY_UNDEF];
int pos = Value.IndexOf(u);
if( pos != 0 )
{
error("unknown undefine keyword");
return false;
}
string id = "";
pos += u.Length;
while( pos < Value.Length && Char.IsWhiteSpace(Value[pos]) )
{
++pos;
}
if( pos >= Value.Length )
{
error("missing macro name");
return false;
}
while( pos < Value.Length && !Char.IsWhiteSpace(Value[pos]) )
{
id += MacIgnCase ? Char.ToLower(Value[pos]) : Value[pos];
++pos;
}
MacDefines.Remove(id);
return true;
}
//! eval define macro
//! @param Value define macro
//! @return true or false on error
protected virtual bool evalDefine(ref string Value)
{
string d = (string)Parameters[(short)EStyxParIndex.IDX_KEY_START];
int pos = Value.IndexOf(d);
if( pos != 0 )
{
error("unknown define keyword");
return false;
}
string id = "";
ArrayList pars = new ArrayList();
pos += d.Length;
while( pos < Value.Length && Char.IsWhiteSpace(Value[pos]) )
++pos;
while( pos < Value.Length && !Char.IsWhiteSpace(Value[pos]) &&
Value[pos] != '(' && Value[pos] != '=' )
{
id += MacIgnCase ? Char.ToLower(Value[pos]) : Value[pos];
++pos;
}
while( pos < Value.Length && Char.IsWhiteSpace(Value[pos]) )
++pos;
if( pos < Value.Length )
{ string v = Value.Substring(pos+1);
if( Value[pos] == '(' )
{
string s = ",)";
pos = v.IndexOfAny(s.ToCharArray());
while( pos >= 0 && pos < v.Length )
{ string p = "";
for( int i=0; i < pos; ++i )
{
if( !Char.IsWhiteSpace(v[i]) ) p += v[i];
}
if( p.Length == 0 )
{
error("missing formal macro parameter");
return false;
}
pars.Add(p);
if( v[pos] == ')' ) break;
v = v.Substring(pos+1);
pos = v.IndexOfAny(s.ToCharArray());
}
if( pos >= v.Length || v[pos] != ')' )
{
error("unexpected macro parameter syntax");
return false;
}
pos = v.IndexOf("=",pos+1);
if( pos >= 0 && pos < v.Length )
v = v.Substring(pos+1);
else v = "";
}
if( v.Length > 0 )
{
pos = v.IndexOf((string)Parameters[(short)EStyxParIndex.IDX_KEY_END]);
if( pos < 0 || pos >= v.Length )
{
error("unexpected end of macro definition");
return false;
}
pars.Add(v.Substring(0,pos));
}
}
MacDefines[id] = pars;
return true;
}
//! eval if[n]def condition
//! @param Value if[n]def condition
//! @return true --\> scan the if[n]def branch
protected virtual bool evalCondition(ref string Value)
{
string t = (string)Parameters[(short)EStyxParIndex.IDX_KEY_IFDEF];
int pos = Value.IndexOf(t);
string id = "";
if( pos == 0 )
{
pos += t.Length;
while( pos < Value.Length && Char.IsWhiteSpace(Value[pos]) )
++pos;
while( pos < Value.Length && !Char.IsWhiteSpace(Value[pos]) )
{
id += MacIgnCase ? Char.ToLower(Value[pos]) : Value[pos];
++pos;
}
return MacDefines.Contains(id);
}
string f = (string)Parameters[(short)EStyxParIndex.IDX_KEY_IFNDEF];
pos = Value.IndexOf(f);
if( pos == 0 )
{
pos += f.Length;
while( pos < Value.Length && Char.IsWhiteSpace(Value[pos]) )
++pos;
while( pos < Value.Length && !Char.IsWhiteSpace(Value[pos]) )
{
id += MacIgnCase ? Char.ToLower(Value[pos]) : Value[pos];
++pos;
}
return MacDefines.Contains(id);
}
error("unknown condition keyword");
return false;
}
//! preprocess condition macro
//! @param PStream [update] current scan stream
//! (set to 0 --\> ignore current token)
//! @param Token internal name of current token
//! @param Value value of current token
//! @return true or false on error
protected virtual bool preprocessCondition
(
ref CStyxStream PStream,
ref string Token, ref string Value
)
{
if( (string)Parameters[(short)EStyxParIndex.IDX_KEY_END] == Value )
{
if( CondStack.Count == 0 )
{
error("unexpected end condition");
return false;
}
CondStack.RemoveAt(CondStack.Count-1);
}
else
if( (string)Parameters[(short)EStyxParIndex.IDX_KEY_ELSE] == Value )
{
if( CondStack.Count == 0 )
{
error("unexpected else condition");
return false;
}
if( (bool)CondStack[CondStack.Count-1] )
CondStack[CondStack.Count-1] = false;
else
if( CondStack.Count == 1 ||
(bool)CondStack[CondStack.Count-2] )
CondStack[CondStack.Count-1] = true;
}
else
if( CondStack.Count == 0 || (bool)CondStack[CondStack.Count-1] )
{
// eval condition
CondStack.Add(evalCondition(ref Value));
}
else
{
CondStack.Add(false);
}
PStream = null;
return true;
}
//! standard Styx compliant preprocess handler
//! @param PStream [changeable] current scan stream
//! \n = initial value --\> update value of current token
//! \n = 0 --\> ignore current token
//! \n else --\> rescan new allocated stream,
//! \n afterwards deleted by the scanner
//! @param Token internal name of current token
//! @param Value [changeable] value of current token
//! @return true or false on error
protected override bool preprocessToken
(
ref CStyxStream PStream, ref string Token, ref string Value
)
{
if( (string)Parameters[(short)EStyxParIndex.IDX_MAC_COND] == Token )
{
return preprocessCondition(ref PStream,ref Token,ref Value);
}
if( CondStack.Count > 0 && !(bool)CondStack[CondStack.Count-1] )
{
PStream = null; return true;
}
if( (string)Parameters[(short)EStyxParIndex.IDX_MAC_INC] == Token )
{
PStream = evalInclude(ref Value);
return PStream != null;
}
if( (string)Parameters[(short)EStyxParIndex.IDX_MAC_DFN] == Token )
{
PStream = null;
return evalDefine(ref Value);
}
if( (string)Parameters[(short)EStyxParIndex.IDX_MAC_DEL] == Token )
{
PStream = null;
return evalUndefine(ref Value);
}
string id = "", text = "";
if( (string)Parameters[(short)EStyxParIndex.IDX_TOK_IDE] == Token )
{
if( MacIgnCase )
{
id = Value;
id = id.ToLower(); //FIXME:cultureinfo
}
else
if( ignoreCase() )
{
error("case ignore mismatch between macros and identifier token");
return false;
}
string mid = id.Length > 0 ? id : Value;
if( MacDefines.Contains(mid) )
{
string sid = "";
text = evalMacroCall(ref mid,ref sid);
if( text.Length > 0 )
{
PStream = createMacroStream(ref sid,ref text);
return PStream != null;
}
PStream = null; return true;
}
}
if( (string)Parameters[(short)EStyxParIndex.IDX_MAC_SEP] == Token )
{
setSeparator(ref Value);
if( MacStack.Count > 0 && CurSep == 0 && CurPar.Length > 0 )
{
text = evalMacroParameter(ref CurPar,ref id);
CurPar = "";
if( text.Length > 0 )
{
PStream = createMacroStream(ref id,ref text);
return PStream != null;
}
}
PStream = null; return true;
}
if( MacStack.Count > 0 )
{
if( CurSep == 0 && CurPar.Length == 0 )
{
text = evalMacroParameter(ref Value,ref id);
if( text.Length > 0 )
{
PStream = createMacroStream(ref id,ref text);
return PStream != null;
}
PStream = null; return true;
}
if( partialParameter(ref Value) )
{
CurPar += Value; PStream = null; return true;
}
text = evalMacroParameter(ref CurPar,ref id);
CurPar = "";
if( text.Length > 0 )
{
PStream = createMacroStream(ref id,ref text);
return PStream != null;
}
PStream = null; return true;
}
return true;
}
//! initialize scanner with preprocessing defaults.
//! @param igncase ignore case in macro identifiers
protected virtual void initPreprocessing(bool igncase)
{
MacIgnCase = igncase;
CurSep = 0; // space separator
MacParDefaults = new string[15]
{
"Ide", "MacDfn", "MacSep", "MacInc", "MacCond", "MacDel",
"#macro", "#end", "#ifdef", "#ifndef", "#else", "#include", "#undefine",
"PATH", ""
};
Parameters = new Hashtable();
MacDefines = new Hashtable();
MacStack = new ArrayList();
CondStack = new ArrayList();
for( short i=0; i < (short)EStyxParIndex.IDX_PAR_END; ++i )
{
Parameters[i] = MacParDefaults[i];
}
}
//! The constructor creates an uninitialized scanner.
public CStyxPScanner(/*bool lahead = false, bool igncase = true*/) : base()
{
initPreprocessing(true);
}
//! The constructor creates an uninitialized scanner.
//! @param lahead enable n character look-ahead ?
//! @param igncase ignore case in macro identifiers
public CStyxPScanner(bool lahead, bool igncase) : base(lahead,true)
{
initPreprocessing(igncase);
}
//! set preprocessing parameters
//! @param parmap preprocessing parameters
public virtual void setParameters(ref Hashtable/*short,string*/ parmap)
{
if( parmap == null ) return;
IEnumerator keys = parmap.Keys.GetEnumerator();
keys.Reset();
while( keys.MoveNext() )
{
short paridx = (short)keys.Current;
if( Parameters.Contains(paridx) )
{
Parameters[paridx] = parmap[paridx];
}
}
}
//! get preprocessing parameter
//! @param paridx parameter index
//! @return parameter value or ""
public virtual string getParameter(short paridx)
{
if( Parameters.Contains(paridx) )
{
return (string)Parameters[paridx];
}
return "";
}
}
//@}
//@}
//@}
}
styx-2.0.1/libcs/doc/ 0000755 0001750 0001750 00000000000 11233036105 011355 5 0000000 0000000 styx-2.0.1/libcs/StyxGrammar.cs 0000666 0001750 0001750 00000013504 12114424375 013355 0000000 0000000 /* ------------------------------------------------------------------------ */
/* */
/* [StyxGrammar.cs] Styx CFG Type definitions (C#) */
/* */
/* This file belongs to the Styx Scanner & parser generator. */
/* */
/* Copyright (c) 2009 by Doelle, Manns */
/* ------------------------------------------------------------------------ */
using System;
using System.Text;
using System.IO;
using System.Collections;
/** @file
CFG Type definitions and functions
*/
/** @namespace styx
C# Scanner & parser library and modules
*/
namespace styx
{
/** @addtogroup StyxLibraryCS
C# Scanner & parser library
*/
//@{
/** @addtogroup StyxGrammar
CFG Type definitions and functions
*/
//@{
/** CFG Type definitions and functions */
public class StyxGrammar
{
/** CFG symbol type */
public enum EStyxCfgSymType
{
CFG_TYP_NTM = 0, //!< nonterminal
CFG_TYP_TOK = 1, //!< token
CFG_TYP_KEY = 2, //!< keyword
CFG_TYP_WKY = 3, //!< unicode keyword
CFG_TYP_CFG = 4, //!< language token
CFG_TYP_COM = 5 //!< comment
}
/* Terminal <--> Comment -------------------------------------------------*/
/** @addtogroup SymbolTypeConverter
Terminal <--> Comment
*/
//@{
/** convert terminal type to comment type
@param type terminal type
@return comment type
*/
public static short terminal2comment(short type)
{
return (short)(type + (short)EStyxCfgSymType.CFG_TYP_COM);
}
/** convert comment type to terminal type
@param type comment type
@return terminal type
*/
public static short comment2terminal(short type)
{
return (short)(type - (short)EStyxCfgSymType.CFG_TYP_COM);
}
//@}
/* Symbol Recognizer -----------------------------------------------------*/
/** @addtogroup SymbolTypeRecognizer
Symbol type recognizer
*/
//@{
/** symbol type = nonterminal ?
@param type symbol type
@return true for a nonterminal type
*/
public static bool isNonterminal(short type)
{
return type == (short)EStyxCfgSymType.CFG_TYP_NTM;
}
/** symbol type = embedded language ?
@param type symbol type
@return true for an embedded language type
*/
public static bool isEmbeddedLanguage(short type)
{
return type == (short)EStyxCfgSymType.CFG_TYP_CFG;
}
/** symbol type = token ?
@param type symbol type
@return true for a token type
*/
public static bool isToken(short type)
{
return type == (short)EStyxCfgSymType.CFG_TYP_TOK
|| type == (short)EStyxCfgSymType.CFG_TYP_CFG;
}
/** symbol type = keyword ?
@param type symbol type
@return true for a keyword type
*/
public static bool isKeyword(short type)
{
return type == (short)EStyxCfgSymType.CFG_TYP_KEY
|| type == (short)EStyxCfgSymType.CFG_TYP_WKY;
}
/** symbol type = unicode keyword ?
@param type symbol type
@return true for a unicode keyword type
*/
public static bool isUnicodeKeyword(short type)
{
return type == (short)EStyxCfgSymType.CFG_TYP_WKY;
}
/** symbol type = comment ?
@param type symbol type
@return true for a comment type
*/
public static bool isComment(short type)
{
return type >= (short)EStyxCfgSymType.CFG_TYP_COM;
}
/** symbol type = token or nonterminal ?
@param type symbol type
@return true for a token or nonterminal type
*/
public static bool isTokenNonterminal(short type)
{
return isToken(type) || isNonterminal(type);
}
/** symbol type = token or keyword ?
@param type symbol type
@return true for a token or keyword type
*/
public static bool isTokenKeyword(short type)
{
return isToken(type) || isKeyword(type);
}
/** symbol type = token, keyword or accept symbol ?
@param type symbol type
@return true for a terminal type
*/
public static bool isTerminal(short type)
{
return isTokenKeyword(type) ||
( isComment(type) && type != (short)EStyxCfgSymType.CFG_TYP_COM );
}
//@}
/* Production Recognizer -------------------------------------------------*/
/** @addtogroup ProductionRecognizer
Production types: special recognizer
*/
//@{
/** production name = "nil#*" ?
@param prod production name
@return true for a nil production
*/
public static bool isNilProduction(string prod)
/* production name = "nil" ? */
{
//return( "nil" == prod );
return( prod.Length >= 3 && "nil" == prod.Substring(0,3) &&
( prod.Length == 3 || Char.IsDigit(prod[3]) ) );
}
/** production name = "cons#*" ?
@param prod production name
@return true for a cons production
*/
public static bool isConsProduction(string prod)
/* production name = "cons" ? */
{
//return( "cons" == prod );
return( prod.Length >= 4 && "cons" == prod.Substring(0,4) &&
( prod.Length == 4 || Char.IsDigit(prod[4]) ) );
}
/** production name = "ign#+" ?
@param prod production name
@return true for an ignore production
*/
public static bool isIgnProduction(string prod)
/* production name = "ign#+" ? */
{
return( prod.Length >= 4 && "ign" == prod.Substring(0,3) && Char.IsDigit(prod[3]) );
}
//@}
}
//@}
//@}
}
styx-2.0.1/libcs/Doxyfile 0000674 0001750 0001750 00000015752 11233034136 012255 0000000 0000000 # Doxyfile 1.2.16
#---------------------------------------------------------------------------
# General configuration options
#---------------------------------------------------------------------------
PROJECT_NAME = Styx.libcs
PROJECT_NUMBER =
OUTPUT_DIRECTORY = doc
OUTPUT_LANGUAGE = English
EXTRACT_ALL = YES
EXTRACT_PRIVATE = NO
EXTRACT_STATIC = NO
EXTRACT_LOCAL_CLASSES = NO
HIDE_UNDOC_MEMBERS = NO
HIDE_UNDOC_CLASSES = NO
BRIEF_MEMBER_DESC = YES
REPEAT_BRIEF = YES
ALWAYS_DETAILED_SEC = YES
INLINE_INHERITED_MEMB = NO
FULL_PATH_NAMES = NO
STRIP_FROM_PATH =
INTERNAL_DOCS = NO
STRIP_CODE_COMMENTS = YES
CASE_SENSE_NAMES = YES
SHORT_NAMES = NO
HIDE_SCOPE_NAMES = NO
VERBATIM_HEADERS = YES
SHOW_INCLUDE_FILES = YES
JAVADOC_AUTOBRIEF = YES
DETAILS_AT_TOP = NO
INHERIT_DOCS = YES
INLINE_INFO = YES
SORT_MEMBER_DOCS = NO
DISTRIBUTE_GROUP_DOC = NO
TAB_SIZE = 2
GENERATE_TODOLIST = YES
GENERATE_TESTLIST = YES
GENERATE_BUGLIST = YES
ALIASES =
ENABLED_SECTIONS =
MAX_INITIALIZER_LINES = 30
OPTIMIZE_OUTPUT_FOR_C = NO
OPTIMIZE_OUTPUT_JAVA = NO
SHOW_USED_FILES = YES
#---------------------------------------------------------------------------
# configuration options related to warning and progress messages
#---------------------------------------------------------------------------
QUIET = NO
WARNINGS = YES
WARN_IF_UNDOCUMENTED = YES
WARN_FORMAT = "$file:$line: $text"
WARN_LOGFILE =
#---------------------------------------------------------------------------
# configuration options related to the input files
#---------------------------------------------------------------------------
INPUT = .
FILE_PATTERNS = \
StyxGrammar.cs \
StyxScanner.cs
RECURSIVE = YES
EXCLUDE =
EXCLUDE_SYMLINKS = NO
EXCLUDE_PATTERNS =
EXAMPLE_PATH =
EXAMPLE_PATTERNS =
EXAMPLE_RECURSIVE = NO
IMAGE_PATH =
INPUT_FILTER =
FILTER_SOURCE_FILES = NO
#---------------------------------------------------------------------------
# configuration options related to source browsing
#---------------------------------------------------------------------------
SOURCE_BROWSER = NO
INLINE_SOURCES = NO
REFERENCED_BY_RELATION = NO
REFERENCES_RELATION = NO
#---------------------------------------------------------------------------
# configuration options related to the alphabetical class index
#---------------------------------------------------------------------------
ALPHABETICAL_INDEX = YES
COLS_IN_ALPHA_INDEX = 5
IGNORE_PREFIX =
#---------------------------------------------------------------------------
# configuration options related to the HTML output
#---------------------------------------------------------------------------
GENERATE_HTML = YES
HTML_OUTPUT = html
HTML_FILE_EXTENSION = .html
HTML_HEADER =
HTML_FOOTER =
HTML_STYLESHEET =
HTML_ALIGN_MEMBERS = YES
GENERATE_HTMLHELP = NO
GENERATE_CHI = YES
BINARY_TOC = YES
TOC_EXPAND = NO
DISABLE_INDEX = NO
ENUM_VALUES_PER_LINE = 1
GENERATE_TREEVIEW = YES
TREEVIEW_WIDTH = 250
#---------------------------------------------------------------------------
# configuration options related to the LaTeX output
#---------------------------------------------------------------------------
GENERATE_LATEX = NO
LATEX_OUTPUT = latex
LATEX_CMD_NAME = latex
MAKEINDEX_CMD_NAME = makeindex
COMPACT_LATEX = NO
PAPER_TYPE = a4wide
EXTRA_PACKAGES =
LATEX_HEADER =
PDF_HYPERLINKS = NO
USE_PDFLATEX = NO
LATEX_BATCHMODE = NO
#---------------------------------------------------------------------------
# configuration options related to the RTF output
#---------------------------------------------------------------------------
GENERATE_RTF = NO
RTF_OUTPUT = rtf
COMPACT_RTF = NO
RTF_HYPERLINKS = NO
RTF_STYLESHEET_FILE =
RTF_EXTENSIONS_FILE =
#---------------------------------------------------------------------------
# configuration options related to the man page output
#---------------------------------------------------------------------------
GENERATE_MAN = NO
MAN_OUTPUT = man
MAN_EXTENSION = .3
MAN_LINKS = NO
#---------------------------------------------------------------------------
# configuration options related to the XML output
#---------------------------------------------------------------------------
GENERATE_XML = NO
#---------------------------------------------------------------------------
# configuration options for the AutoGen Definitions output
#---------------------------------------------------------------------------
GENERATE_AUTOGEN_DEF = NO
#---------------------------------------------------------------------------
# Configuration options related to the preprocessor
#---------------------------------------------------------------------------
ENABLE_PREPROCESSING = YES
MACRO_EXPANSION = NO
EXPAND_ONLY_PREDEF = NO
SEARCH_INCLUDES = YES
INCLUDE_PATH =
INCLUDE_FILE_PATTERNS =
PREDEFINED =
EXPAND_AS_DEFINED =
SKIP_FUNCTION_MACROS = YES
#---------------------------------------------------------------------------
# Configuration::addtions related to external references
#---------------------------------------------------------------------------
TAGFILES =
GENERATE_TAGFILE =
ALLEXTERNALS = NO
EXTERNAL_GROUPS = YES
PERL_PATH = /usr/bin/perl
#---------------------------------------------------------------------------
# Configuration options related to the dot tool
#---------------------------------------------------------------------------
CLASS_DIAGRAMS = YES
HIDE_UNDOC_RELATIONS = YES
HAVE_DOT = YES
CLASS_GRAPH = YES
COLLABORATION_GRAPH = YES
TEMPLATE_RELATIONS = YES
INCLUDE_GRAPH = YES
INCLUDED_BY_GRAPH = YES
GRAPHICAL_HIERARCHY = YES
DOT_IMAGE_FORMAT = png
DOT_PATH =
DOTFILE_DIRS =
MAX_DOT_GRAPH_WIDTH = 1024
MAX_DOT_GRAPH_HEIGHT = 1024
GENERATE_LEGEND = YES
DOT_CLEANUP = YES
#---------------------------------------------------------------------------
# Configuration::addtions related to the search engine
#---------------------------------------------------------------------------
SEARCHENGINE = NO
CGI_NAME = search.cgi
CGI_URL =
DOC_URL =
DOC_ABSPATH =
BIN_ABSPATH = /usr/local/bin/
EXT_DOC_PATHS =
styx-2.0.1/libcs/winstyxcs/ 0000755 0001750 0001750 00000000000 11473762712 012703 5 0000000 0000000 styx-2.0.1/libcs/winstyxcs/winstyxcs.suo 0000644 0001750 0001750 00000067000 12114651002 015407 0000000 0000000 ÐÏࡱá > þÿ þÿÿÿ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿ
! þÿÿÿ " 5 # $ % þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿR o o t E n t r y ÿÿÿÿÿÿÿÿ X 2Î @2 P r o j I n f o E x ÿÿÿÿÿÿÿÿÿÿÿÿ T a s k L i s t U s e r T a s k s $ " ÿÿÿÿ I V S M D P r o p e r t y B r o w s e r * ÿÿÿÿ ÿÿÿÿ þÿÿÿ þÿÿÿþÿÿÿ þÿÿÿþÿÿÿ 4 þÿÿÿ
þÿÿÿ þÿÿÿP b ' " # - % . þÿÿÿ( ) * + þÿÿÿc þÿÿÿd f þÿÿÿ2 þÿÿÿþÿÿÿ5 6 7 8 D : þÿÿÿ< þÿÿÿ´ ? þÿÿÿA B C þÿÿÿE F G H I J K L M N O þÿÿÿQ R S T U V W X Y Z [ \ ] ^ _ ` a à þÿÿÿþÿÿÿe þÿÿÿg h i j k l m n o p È r s t u v w x y z } | þÿÿÿ~ € èî$*H´ F´”Û^
l'Î ðC
Eigene Benutzersteuerelemente Gerätesteuerelemente Crystal Reports Daten
XML-Schema
Dialog-Editor Mobile Web Forms Web Forms Komponenten
Windows Forms HTML Zwischenablagering Allgemein 6 E : \ p \ s t y x \ l i b c s \ w i n s t y x c s \ I V S M D D e s i g n e r S e r v i c e * ÿÿÿÿ þÿÿÿ I T o o l b o x S e r v i c e ÿÿÿÿ ò D e b u g g e r W a t c h e s ÿÿÿÿÿÿÿÿÿÿÿÿ D e b u g g e r B r e a k p o i n t s ( & ÿÿÿÿÿÿÿÿ Ž j E : \ p \ s t y x x C : \ P r o g r a m m e \ M i c r o s o f t V i s u a l S t u d i o . N E T 2 0 0 3 \ V c 7 \ c r t \ s r c \ † C : \ P r o g r a m m e \ M i c r o s o f t V i s u a l S t u d i o . N E T 2 0 0 3 \ V c 7 \ a t l m f c \ s r c \ m f c \ † C : \ P r o g r a m m e \ M i c r o s o f t V i s u a l S t u d i o . N E T 2 0 0 3 \ V c 7 \ a t D e b u g g e r E x c e p t i o n s & ÿÿÿÿÿÿÿÿÿÿÿÿ D e b u g g e r F i n d S o u r c e &
ÿÿÿÿ
¤ D e b u g g e r F i n d S y m b o l & ÿÿÿÿÿÿÿÿÿÿÿÿ þÿÿÿ D e b u g g e r M e m o r y W i n d o w s , ÿÿÿÿ T l m f c \ s r c \ a t l \ è ËA
ÿÿ¤ 8]¦ \¦ Œ š ' Í«4ïþîÿ Í«4ïþîÿ Ñ Ö M u l t i S t a r t u p P r o j = ; 4 { B 0 D 8 0 F D 9 - F 1 C 2 - 4 2 5 F - B E 7 8 - 3 2 6 C D C 5 B F 5 E 6 } . d w S t a r t u p O p t = ; S t a r t u p P r o j E x t e r n a l F i l e s P r o j e c t C o n t e n t s : ÿÿÿÿ ÿÿÿÿ þÿÿÿ D o c u m e n t W i n d o w P o s i t i o n s 0 ÿÿÿÿ Û D o c u m e n t W i n d o w U s e r D a t a . ÿÿÿÿÿÿÿÿ d S o l u t i o n C o n f i g u r a t i o n , ÿÿÿÿÿÿÿÿÿÿÿÿ e c t = & { B 0 D 8 0 F D 9 - F 1 C 2 - 4 2 5 F - B E 7 8 - 3 2 6 C D C 5 B F 5 E 6 } ; A { B 0 D 8 0 F D 9 - F 1 C 2 - 4 2 5 F - B E 7 8 - 3 2 6 C D C 5 B F 5 E 6 } . R e l e a s e | A n y C P U . f B a t c h B l d = ; ? { B 0 D 8 0 F D 9 - F 1 C 2 - 4 2 5 F - B E 7 8 - 3 2 6 C D C 5 B F 5 E 6 } . D e b u g | A n y C P U . f B a t c h B l d = ; 4 { 4 3 C C 8 D 3 2 - F B F 0 - 4 4 B E - 9 D D 5 - A F A 7 8 4 5 D F 8 3 8 } . d w S t a r t u p O p t = ; A { 4 3 C C 8 D 3 2 - F B F 0 - 4 4 B E - 9 D D 5 - A F A 7 8 4 5 D F 8 3 8 } NSܾï MŠ%˜¿Ÿøñ кñXˆ"¹E¬:Õc˜÷x S t y x S c a n n e r T e s t T a n k a e n d e r u n g e n l i b s t y x c s ë T e s t T a n k d a t e n ÑrÉJA)˜jK¨× RþQ J e : \ p \ s t y x \ l i b c s \ w i n s t y x c s \ l i b s t y x c s \ V e : \ p \ s t y x \ l i b c s \ w i n s XÏ
. R e l e a s e | A n y C P U . f B a t c h B l d = ; O b j M g r C o n t e n t s ÿÿÿÿ ! Ü C l a s s V i e w C o n t e n t s $ ÿÿÿÿ þÿÿÿ P r o j E x p l o r e r S t a t e $ ÿÿÿÿ $ ( U n l o a d e d P r o j e c t s " ÿÿÿÿÿÿÿÿÿÿÿÿ þÿÿÿ T a s k L i s t S h o r t c u t s $ ÿÿÿÿÿÿÿÿÿÿÿÿ & V s T o o l b o x S e r v i c e " ÿÿÿÿÿÿÿÿ 3 O b j M g r C o n t e n t s V 8 " ÿÿÿÿ , V H i d d e n S l n F o l d e r s " ÿÿÿÿÿÿÿÿÿÿÿÿ þÿÿÿ ? { 4 3 C C 8 D 3 2 - F B F 0 - 4 4 B E - 9 D D 5 - A F A 7 8 4 5 D F 8 3 8 } . D e b u g | A n y C P U . f B a t c h B l d = ;
A c t i v e C f g =
D e b u g | A n y C P U ; 2 D 4 B - 4 0 3 E - 9 C 5 B - 1 A 3 7 A C D F F 7 C 2 } S $ ýA+ÁH±ÚªÏ¥WL кñXˆ"¹E¬:Õc˜÷x S 8fÂþ L¤d®— ï9L к¸ª [È {0ä‡Awï—Ý9
š t y x c s \ s t y x s c a n n e r t e s t \ l e : \ p \ s F E : \ p \ s t y x \ l i b c s \ S t y x S c a n n e r T e $ B o o k m a r k s V 0 0 1 . 0 1 t y x S c a n n e r T e< E : \ p \ s t y x \ l i b c s \ S t y x P a r s e r . c s (•ÏÙ_ ÿÿÿÿÿÿÿÿ s \ l i b s t y x c s \ l i b s t y x c s . c s t . c s | | { A 6 C 7 4 4 A 8 - 0 E 4 A - 4 F C 6 - 8 8 6 A\ l i b c s \ w i n s t y x c s \ T e s t E n u m e r a t i o n \ P r o g r a m . c s
A > T e s t E n u m e r a t i o n . P r o g r a m . M a i n ( ) øbQ?ÆÓS ÀO£¡ F E : \ p \ s t y x \ l i b c s \ S t y x S c a n n e r T e s t . c s Ê ÿÿÿÿÿÿÿÿ \ l i b s t y x c s . c s p r o j . u > E : \ p \ s t y x \ l i b c s \ S t y x S c a n n e r . c s üP'ÁÕ ÿÿÿÿÿÿÿÿ t \ P r o p e r t i e s \ a p p . m a n i f e „ E : \ p \ s t y x \ l i b c s \ w i n s t y x c s \ S t y x S j E : \ p \ s t y x \ l i b c s \ w i n s t y x c s \ T e s t E n u m e r a t i o n \ P r o g r a m . c s %¸a¬ ÿÿÿÿÿÿÿÿ E AE:\p\styx\libcs\winstyxcs\StyxScannerTest\Properties\app.manifest urn:schemas-microsoft-com:asm.v1 6C:\Windows\Microsoft.NET\Framework\v3.5\csc.exe.config x c s \ A s s e m b l y I n f o . c s GBLI E : \ p \ s t F E : \ p \ s t y x \ l i b c s \ S t y x S c a n n e r T e s t . c s Z Z A H S t y x S c a n n e r T e s t . M a i n ( s t r i n g [ ] a r g s ) O u t l i n i n g S t a t e D i r $ ÿÿÿÿÿÿÿÿÿÿÿÿ / B o o k m a r k S t a t e ÿÿÿÿÿÿÿÿ 0 ( F A E 0 4 E C 1 - 3 0 1 F - 1 1 D 3 _ P r o j T r u s t :
ÿÿÿÿÿÿÿÿ þÿÿÿ F A E 0 4 E C 1 - 3 0 1 F - 1 1 D 3 _ P r o j S t a t e : ÿÿÿÿÿÿÿÿÿÿÿÿ q j
øbQ?ÆÓS ÀO£¡ F E : \ p \ s t y x \ l i b c s \ S t y x S c a n n e r T e s t . c s ½ ½ 7 A H S t y x S c a n n e r T e s t . M a i n ( s t r i n g [ ] a r g s ) e øbQ?ÆÓS ÀO£¡ \ S y s t e m . d l l S y s t e m GBLI { B 0 D 8 0 F D 9 - F 1 C 2 - 4 2 5 F - B E 7 8 - 3 2 6 C D C 5 B F 5 E 6 } | l i b s t y x c s \ l i b s t y x c s . c s p r o j | e : \ p \ s t y x \ l i b c s \ s t y x s c a n n e r . c s | | { A 6 C 7 4 4 A 8 - 0 E 4 A - 4 F C 6 - 8 8 6 A - 0 6 4 2 8 3 0 5 4 6 7 4 } 1234 ËA
ÿÿ¤ 8]¦ \¦ r{ 4 3 C C 8 D 3 2 - F B F 0 - 4 4 B E - 9 D D 5 - A F A 7 8 4 5 D F 8 3 8 } | S t y x S c a n n e r T e s t \ S t y x S c a n n e r T e s t . c s p r o j | e : \ p \ s t y x \ l i b c s \ w i n s t y x c s \ s t y x s c a n n e r t e s t \ p r o p e r t i e s \ a p p . m a n i f e s t | | { F A 3 C D 3 1 E - 9 8 7 B - 4 4 3 A - 9 B 8 1 - 1 8 6 1 0 4 E 8 D A C 1 } | 1234 r
ÿÿ¤ 8]¦ \¦ { B 0 D 8 0 F D 9 - F 1 C 2 - 4 2 5 F - B E 7 8 - 3 2 6 C D C 5 B F 5 E 6 } | l i b s t y x c s \ l i b s t y x c s . c s p r o j | e : \ p \ s t y x \ l i b c s \ s t y x p a r s e r . c s | | { A 6 C 7 4 4 A 8 - 0 E 4 A - 4 F C 6 - 8 8 6 A - 0 6 4 2 8 3 0 5 4 6 7 4 } 123456 r
ÿÿ¤ 8]¦ \¦ 2{ 4 3 C C 8 D 3 2 - F B F 0 Í«4ïþîÿ ½ Í«4ïþîÿo s o f t . N E T \ F r a m ñXˆ"¹E¬:Õc˜÷x 5 0 7 2 7 \ S y s t e m . X M L . d l l t y x \ l i b c s \ w i n s t y x c s \ s t y x s c a n n e r t e s t \ p r o p e r t i e s \ e r T e s t \ S t y x Ss t . c s < E : \ p \ s t y x \ l i b c s \ S t y x P a r s e r . c s > E : \ p \ s t y x \ l i b c s \ S t y x S c a n n e r . c s ê C : \ U s e r s \ H E I K E M ~ 1 \ A p p D a t a \ L o c a l \ T e m p \ 3 7 5 2 $ C o m m o n L a n g u a g e R u n t i m e L i b r a r y $ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . C o l l e c t i o n s . G e n e r i c . L i s t . c s j E : \ p \ s t y x \ l i b c s \ w i n s t y x c s \ T e s t E n u m e r a t i o n \ P r o g r a m . c s n C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 3 . 5 \ c s c . e x e . c o n f i g d E : \ p \ s t y x \ l i b c s \ w i n s t y x c s \ l i b s t y x c s \ S t y x P a BCSPÙØ°Âñ_B¾x2lÜ[õæŽ GBSC5 E : \ p \ s t y x \ l i b c s \ w i n s t y x c s \ l i b s t y x c s \ l i b s t y x c s . c s p r o j € ›‰$Ê BCSC D e b u g | A n y C P U
2 8 5 2 1 2 6 7 2 f u l l D E B U G ; T R A C E ; 1 7 0 1 ; 1 7 0 2 ÿÿ p r o m p t l i b r a r y o b j \ D e b u g \ l i b s t y x c s . d l l l i b r a r y GBLI E : \ p \ s t y x \ l i b c s \ S t y x G r a m m a r . c s GBLI E : \ p \ s t y x \ l i b c s \ S t y x P a r s e r . c s GBLI4 E : \ p \ s t y x \ l i b c s \ w i n s t y x d E : \ p \ s t y x \ l i b c s \ w i n s t y x c s \ l i b s t y x c s \ S t y x P a r s e r . c s µ »^ ÿÿÿÿÿÿÿÿ c s \ l i b s t y x c s \ A s s e m b l y I n f o . c s GBLI E : \ p \ s t y x \ l i b c s \ S t y x S c a n n e r . c s DELIGBLI= C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a O u t l i n i n g S t a t e 1 ÿÿÿÿ ÿÿÿÿ { x O u t l i n i n g S t a t e 2 ÿÿÿÿÿÿÿÿÿÿÿÿ 1 P O u t l i n i n g S t a t e 3 ÿÿÿÿÿÿÿÿ â C D E x p o r t D i a l o g S e t t i n g , ÿÿÿÿÿÿÿÿÿÿÿÿ ‹ ™ ‰ ‚ ƒ „ … † ‡ ˆ þÿÿÿŠ – Œ Ž ‘ ’ “ ” • þÿÿÿ— ˜ ™ š › œ ž Ÿ ¡ ¢ £ ¤ ¥ ¦ § ¨ ª « þÿÿÿþÿÿÿ® ¯ ° ± ² ³ þÿÿÿµ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÄ Å Æ Ç þÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿm e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . X m l . d l l ê C : \ U s e r s \ H E I K E M ~ 1 \ A p p D a t a \ L o c a l \ T e m p \ 3 7 5 2 $ C o m m o n L a n g u a g e R u n t i m e L i b r a r y $ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . C o l l e c t i o n s . G e n e r i c . L i s t . c s Iö›H=
! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 ÿÿÿÿÿÿÿÿ GBLI> C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D a t ÿÿÿÿ wMicrosoft.VisualStudio.EnterpriseTools.ClassDesigner, Version=9.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a ISystem, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089 MMicrosoft.VisualStudio.EnterpriseTools.ClassDesigner.CDExportDialogBoxSetting previouslyCheckedItemspreviousLocation previousImageFormatItemIndexoverrideExistingFile /System.Collections.Specialized.StringCollection ÿÿÿÿ /System.Collections.Specialized.StringCollection data System.Collections.ArrayList System.Collections.ArrayList _items_size_version a . d l l GBLI9 C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . d l l DELIDELIDELIDELIDESCBCSP2ÌCðû¾DÕ¯§„]ø8¨ GBSCA E : \ p \ s t y x \ l i b c s \ w i n s t y x c s \ S t y x S c a n n e r T e s t \ S t y x S c a n n e r T e s t . c s p r o j €‰`Í$Ê BCSC D e b u g | A n y C P U
2 8 5 2 1 2 6 7 2 f u l l D E B U G ; T R A C E ; 1 7 0 1 ; 1 7 0 2 ÿÿ p r o m p t e x e S t y x S c a n n e r T e s t o b j \ D e b u g \ S t y x S c a n n e r T e s t . e x e e x e A p p . i c o > C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 3 . 5 \ d e f a u l t . w i n 3 2 m a n i f e s t GBLI: E : \ p \ s t y x \ l i b c s \ w i n s t y x c s \ S t y x S c a n n e r T e s t \ A s s e m b l y I n f o . c s GBLI# E : \ p \ s t y x \ l i b c s \ S t y x S c a n n e r T e s t . c s DELIGBLI= C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . X M L . d l l GBLI> C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r n C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 3 . 5 \ c s c . e x e . c o n f i g ¾-Í ÿÿÿÿÿÿÿÿ 2ÌCðû¾DÕ¯§„]ø8 k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D a t a . d l l GBLI9 C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . d l l O u t l i n i n g S t a t e 6 % ÿÿÿÿ © ‚ P r o j e c t D e s i g n e r ÿÿÿÿ ÿÿÿÿ ¬ X m l P a c k a g e O p t i o n s $ ÿÿÿÿ ÿÿÿÿ @ à O u t l i n i n g S t a t e 5 ÿÿÿÿÿÿÿÿÿÿÿÿ 9 Z GBLI< E : \ p \ s t y x \ l i b c s \ w i n s t y x c s \ l i b s t y x c s \ b i n \ D e b u g \ l i b s t y x c s . d l l ' { B 0 D 8 0 F D 9 - F 1 C 2 - 4 2 5 F - B E 7 8 - 3 2 6 C D C 5 B F 5 E 6 } DELIDELIDELIDELIDESCECSPi c r o s o f t . N E c a n n e r T e s t \ P r o p e r t i e s \ a p p . m a n i f e s t ‚z,W ÿÿÿÿÿÿÿÿ 9 C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . d l l GBLI< E : \ p \ s t y x \ l i b c s \ w i n s t y x c s \ l i b s t y x c s \ b i n \ D e b u g \ l i b s t y x c s . d l l ' { B 0 D 8 0 F D 9 - F 1 C 2 - 4 2 5 F - B E 7 8 - 3 2 6 C D C 5 B F 5 E 6 } DELIGBLI> C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D a t a . d l l S y s t e m . D a t a GBLI9 C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . d l l S y s t e m GBLI= C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . X M L . d l l S y s t e m . X M L DELIDELIDELIDESCECSP2 . 0 . 5 0 7 2 7 \ S y s t e m . D a t a . d - 4 4 B E - 9 D D 5 - A F A 7 8 4 5 D F 8 3 8 } | S t y x S c a n n e r T e s t \ S t y x S c a n n e r T e s t . c s p r o j | e : \ p \ s t y x \ l i b c s \ s t y x s c a n n e r t e s t . c s | | { A 6 C 7 4 4 A 8 - 0 E 4 A - 4 F C 6 - 8 8 6 A - 0 6 4 2 8 3 0 5 4 6 7 4 } 1234 y s t e m . X M L . d l l S y s r s e r . c s DELIDELIDELIDESCECSP 6 - 8 8 6 A - 0 6 4 2 8 3 0 5 4 6 7 4 } 123456 Í«4ïþîÿ Ñ Ö Í«4ïþîÿ b c s \ w i n s t y x c s \ t e s t e n u m e r a t i o n \ l e : \ p \ s t y x \ l i b c s \ w i n s t y x c s \ t e s t e n u m e r a t i o n \ p r o p e r t i e s \ 5 \ c s c . e x e . c o n f i g d E : \ p \ s t y x \ l i b c s \ w i n s t y x c s \ l i b s t y x c s \ S t y x P a r s e r . c s BCSPÙØ°Âñ_B¾x2lÜ[õæÔ GBSC5 E : \ p \ s t y x \ l i b c s \ w i n s t y x c s \ l i b s t y x c s \ l i b s t y x c s . c s p r o j € ›‰$Ê: E : \ p \ s t y x \ l i b c s \ w i n s t y x c s \ l i b s t y x c s \ l i b s t y x c s . c s p r o j . u s e r €jœüí
ÊBCSC D e b u g | A n y C P U
2 8 5 2 1 2 6 7 2 f u l l D E B U G ; T R A C E ; 1 7 0 1 ; 1 7 0 2 ÿÿ p r o m p t l i b r a r y o b j \ D e b u g \ l i b s t y x c s . d l l l i b r a r y GBLI E : \ p \ s t y x \ l i b c s \ S t y x G r a m m a r . c s GBLI E : \ p \ s t y x \ l i b c s \ S t y x P a r s e r . c s GBLI4 E : \ p \ s t y x \ l i b c s \ w i n s t y x c s \ l i b s t y x c s \ A s s e m b l y I n f o . c s GBLI E : \ p \ s t y x \ l i b c s \ S t y x S c a n n e r . c s DELIGBLI= C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . X m l . d l l GBLI> C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D a t a . d l l GBLI9 C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . d l l DELIGBLI> C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D a t a . d l l S y s t e m . D a t a GBLI9 C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . d l l S y s t e m GBLI= C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . X m l . d l l S y s t e m . X m l DELIDELIDELIDESCBCSP2ÌCðû¾DÕ¯§„]ø8¢ GBSCA E : \ p \ s t y x \ l i b c s \ w i n s t y x c s \ S t y x S c a n n e r T e s t \ S t y x S c a n n e r T e s t . c s p r o j €‰`Í$ÊF E : \ p \ s t y x \ l i b c s \ w i n s t y x c s \ S t y x S c a n n e r T e s t \ S t y x S c a n n e r T e s t . c s p r o j . u s e r €‰`Í$ÊBCSC D e b u g | A n y C P U
2 8 5 2 1 2 6 7 2 f u l l D E B U G ; T R A C E ; 1 7 0 1 ; 1 7 0 2 ÿÿ p r o m p t e x e S t y x S c a n n e r T e s t o b j \ D e b u g \ S t y x S c a n n e r T e s t . e x e e x e A p p . i c o > C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 3 . 5 \ d e f a u l t . w i n 3 2 m a n i f e s t GBLI: E : \ p \ s t y x \ l i b c s \ w i n s t y x c s \ S t y x S c a n n e r T e s t \ A s s e m b l y I n f o . c s GBLI# E : \ p \ s t y x \ l i b c s \ S t y x S c a n n e r T e s t . c s DELIGBLI= C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . X M L . d l l GBLI> C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D a t a . d l l GBLI9 C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . d l l GBLI< E : \ p \ s t y x \ l i b c s \ w i n s t y x c s \ l i b s t y x c s \ b i n \ D e b u g \ l i b s t y x c s . d l l ' { B 0 D 8 0 F D 9 - F 1 C 2 - 4 2 5 F - B E 7 8 - 3 2 6 C D C 5 B F 5 E 6 } DELIGBLI< E : \ p \ s t y x \ l i b c s \ w i n s t y x c s \ l i b s t y x c s \ b i n \ D e b u g \ l i b s t y x c s . d l l
l i b s t y x c s GBLI> C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D a t a . d l l S y s t e m . D a t a GBLI9 C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . d l l S y s t e m GBLI= C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . X M L . d l l S y s t e m . X M L DELIDELIDELIDESCBCSP“x´äK->@œ[7¬ß÷€ GBSCA E : \ p \ s t y x \ l i b c s \ w i n s t y x c s \ T e s t E n u m e r a t i o n \ T e s t E n u m e r a t i o n . c s p r o j €7¤ƒ$Ê BCSC D e b u g | A n y C P U f u l l D E B U G ; T R A C E ; 1 7 0 1 ; 1 7 0 2 ÿÿ p r o m p t e x e o b j \ D e b u g \ T e s t E n u m e r a t i o n . e x e e x e > C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 3 . 5 \ d e f a u l t . w i n 3 2 m a n i f e s t GBLIE E : \ p \ s t y x \ l i b c s \ w i n s t y x c s \ T e s t E n u m e r a t i o n \ P r o p e r t i e s \ A s s e m b l y I n f o . c s GBLI5 E : \ p \ s t y x \ l i b c s \ w i n s t y x c s \ T e s t E n u m e r a t i o n \ P r o g r a m . c s DELIGBLIO C : \ P r o g r a m F i l e s \ R e f e r e n c e A s s e m b l i e s \ M i c r o s o f t \ F r a m e w o r k \ v 3 . 5 \ S y s t e m . C o r e . d l l GBLI= C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . X m l . d l l GBLIa C : \ P r o g r a m F i l e s \ R e f e r e n c e A s s e m b l i e s \ M i c r o s o f t \ F r a m e w o r k \ v 3 . 5 \ S y s t e m . D a t a . D a t a S e t E x t e n s i o n s . d l l GBLI> C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D a t a . d l l GBLI9 C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . d l l GBLIS C : \ P r o g r a m F i l e s \ R e f e r e n c e A s s e m b l i e s \ M i c r o s o f t \ F r a m e w o r k \ v 3 . 5 \ S y s t e m . X m l . L i n q . d l l DELIGBLIO C : \ P r o g r a m F i l e s \ R e f e r e n c e A s s e m b l i e s \ M i c r o s o f t \ F r a m e w o r k \ v 3 . 5 \ S y s t e m . C o r e . d l l S y s t e m . C o r e GBLIa C : \ P r o g r a m F i l e s \ R e f e r e n c e A s s e m b l i e s \ M i c r o s o f t \ F r a m e w o r k \ v 3 . 5 \ S y s t e m . D a t a . D a t a S e t E x t e n s i o n s . d l l S y s t e m . D a t a . D a t a S e t E x t e n s i o n s GBLI> C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D a t a . d l l S y s t e m . D a t a GBLI9 C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . d l l S y s t e m GBLI= C : \ W i n d o w s \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . X m l . d l l S y s t e m . X m l GBLIS C : \ P r o g r a m F i l e s \ R e f e r e n c e A s s e m b l i e s \ M i c r o s o f t \ F r a m e w o r k \ v 3 . 5 \ S y s t e m . X m l . L i n q . d l l S y s t e m . X m l . L i n q DELIDELIDELIDESCECSP O u t l i n i n g S t a t e 7 ÿÿÿÿÿÿÿÿÿÿÿÿ ; R O u t l i n i n g S t a t e 4 # ÿÿÿÿ > ~ O u t l i n i n g S t a t e 8 $ ! ÿÿÿÿ = ˜ ÿÿÿÿÿÿÿÿÿÿÿÿ styx-2.0.1/libcs/winstyxcs/StyxScannerTest/ 0000755 0001750 0001750 00000000000 11473763005 016020 5 0000000 0000000 styx-2.0.1/libcs/winstyxcs/StyxScannerTest/obj/ 0000755 0001750 0001750 00000000000 11163720511 016561 5 0000000 0000000 styx-2.0.1/libcs/winstyxcs/StyxScannerTest/obj/Debug/ 0000755 0001750 0001750 00000000000 12114651635 017616 5 0000000 0000000 styx-2.0.1/libcs/winstyxcs/StyxScannerTest/obj/Debug/TempPE/ 0000755 0001750 0001750 00000000000 11233054604 020742 5 0000000 0000000 styx-2.0.1/libcs/winstyxcs/StyxScannerTest/Properties/ 0000755 0001750 0001750 00000000000 11244527000 020141 5 0000000 0000000 styx-2.0.1/libcs/winstyxcs/StyxScannerTest/Properties/app.manifest 0000644 0001750 0001750 00000002667 11244527000 022404 0000000 0000000 
styx-2.0.1/libcs/winstyxcs/StyxScannerTest/StyxScannerTest.csproj 0000644 0001750 0001750 00000013025 11244527000 022271 0000000 0000000 
Local
9.0.21022
2.0
{43CC8D32-FBF0-44BE-9DD5-AFA7845DF838}
Debug
AnyCPU
App.ico
StyxScannerTest
JScript
Grid
IE50
false
Exe
StyxScannerTest
OnBuildSuccess
StyxScannerTest
0.0
LocalIntranet
false
publish\
true
Disk
false
Foreground
7
Days
false
false
true
0
1.0.0.%2a
false
false
true
bin\Debug\
false
285212672
false
DEBUG;TRACE
true
4096
false
false
false
false
false
4
full
prompt
bin\Release\
false
285212672
false
TRACE
false
4096
false
true
false
false
false
4
none
prompt
System
System.Data
System.XML
libstyxcs
{B0D80FD9-F1C2-425F-BE78-326CDC5BF5E6}
{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}
Code
Code
False
.NET Framework 2.0 %28x86%29
true
False
.NET Framework 3.0 %28x86%29
false
False
.NET Framework 3.5
false
styx-2.0.1/libcs/winstyxcs/StyxScannerTest/AssemblyInfo.cs 0000644 0001750 0001750 00000004756 11163720146 020671 0000000 0000000 using System.Reflection;
using System.Runtime.CompilerServices;
//
// Allgemeine Informationen über eine Assembly werden über folgende Attribute
// gesteuert. Ändern Sie diese Attributswerte, um die Informationen zu modifizieren,
// die mit einer Assembly verknüpft sind.
//
[assembly: AssemblyTitle("")]
[assembly: AssemblyDescription("")]
[assembly: AssemblyConfiguration("")]
[assembly: AssemblyCompany("")]
[assembly: AssemblyProduct("")]
[assembly: AssemblyCopyright("")]
[assembly: AssemblyTrademark("")]
[assembly: AssemblyCulture("")]
//
// Versionsinformationen für eine Assembly bestehen aus folgenden vier Werten:
//
// Hauptversion
// Nebenversion
// Buildnummer
// Revision
//
// Sie können alle Werte oder die standardmäßige Revision und Buildnummer
// mit '*' angeben:
[assembly: AssemblyVersion("1.0.*")]
//
// Um die Assembly zu signieren, müssen Sie einen Schlüssel angeben. Weitere Informationen
// über die Assemblysignierung finden Sie in der Microsoft .NET Framework-Dokumentation.
//
// Mit den folgenden Attributen können Sie festlegen, welcher Schlüssel für die Signierung verwendet wird.
//
// Hinweise:
// (*) Wenn kein Schlüssel angegeben ist, wird die Assembly nicht signiert.
// (*) KeyName verweist auf einen Schlüssel, der im CSP (Crypto Service
// Provider) auf Ihrem Computer installiert wurde. KeyFile verweist auf eine Datei, die einen
// Schlüssel enthält.
// (*) Wenn die Werte für KeyFile und KeyName angegeben werden,
// werden folgende Vorgänge ausgeführt:
// (1) Wenn KeyName im CSP gefunden wird, wird dieser Schlüssel verwendet.
// (2) Wenn KeyName nicht vorhanden ist und KeyFile vorhanden ist,
// wird der Schlüssel in KeyFile im CSP installiert und verwendet.
// (*) Um eine KeyFile zu erstellen, können Sie das Programm sn.exe (Strong Name) verwenden.
// Wenn KeyFile angegeben wird, muss der Pfad von KeyFile
// relativ zum Projektausgabeverzeichnis sein:
// %Project Directory%\obj\. Wenn sich KeyFile z.B.
// im Projektverzeichnis befindet, geben Sie das AssemblyKeyFile-Attribut
// wie folgt an: [assembly: AssemblyKeyFile("..\\..\\mykey.snk")]
// (*) Das verzögern der Signierung ist eine erweiterte Option. Weitere Informationen finden Sie in der
// Microsoft .NET Framework-Dokumentation.
//
[assembly: AssemblyDelaySign(false)]
[assembly: AssemblyKeyFile("")]
[assembly: AssemblyKeyName("")]
styx-2.0.1/libcs/winstyxcs/StyxScannerTest/bin/ 0000755 0001750 0001750 00000000000 11166642053 016566 5 0000000 0000000 styx-2.0.1/libcs/winstyxcs/StyxScannerTest/bin/Debug/ 0000755 0001750 0001750 00000000000 12114651635 017614 5 0000000 0000000 styx-2.0.1/libcs/winstyxcs/StyxScannerTest/App.ico 0000644 0001750 0001750 00000002066 11163720146 017153 0000000 0000000 è & ( ( @ € € € €€ € € € €€ €€€ ÀÀÀ ÿ ÿ ÿÿ ÿ ÿ ÿ ÿÿ ÿÿÿ wwwwwwwwwwwwwwpDDDDDDDDDDDDDDpÿÿÿÿÿÿÿÿÿÿÿÿÿôpÿÿÿÿÿÿÿÿÿÿÿÿÿôpÿÿÿÿÿÿÿÿÿÿÿÿÿôpÿÿÿÿÿÿÿÿÿÿÿÿÿôpÿÿÿÿÿÿÿÿÿÿÿÿÿôpÿÿÿÿÿÿÿÿÿÿÿÿÿôpÿÿÿÿÿÿÿÿÿÿÿÿÿôpÿÿÿÿÿÿÿÿÿÿÿÿÿôpÿÿÿÿÿÿÿÿÿÿÿÿÿôpÿÿÿÿÿÿÿÿÿÿÿÿÿôpÿÿÿÿÿÿÿÿÿÿÿÿÿôpÿÿÿÿÿÿÿÿÿÿÿÿÿôpÿÿÿÿÿÿÿÿÿÿÿÿÿôpÿÿÿÿÿÿÿÿÿÿÿÿÿôpÿÿÿÿÿÿÿÿÿÿÿÿÿôpÿÿÿÿÿÿÿÿÿÿÿÿÿôpÿÿÿÿÿÿÿÿÿÿÿÿÿôpÿÿÿÿÿÿÿÿÿÿÿÿÿôpˆˆˆˆˆˆˆˆˆˆˆˆˆ„pDDDDDDDDDDDDDDpLLLLLLLLLNÎÎItpÌÌÌÌÌÌÌÌÌÌÌÌÌÄ DDDDDDDDDDDDD@ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀ € € € € € € € € € € € € € € € € € € € € € € € À ÿÿÿÿÿÿÿÿÿÿÿÿ( À € € €€ € € € €€ €€€ ÀÀÀ ÿ ÿ ÿÿ ÿ ÿ ÿ ÿÿ ÿÿÿ wwwwwwwDDDDDDDGOÿÿÿÿÿøGOÿÿÿÿÿøGOÿÿÿÿÿøGOÿÿÿÿÿøGOÿÿÿÿÿøGOÿÿÿÿÿøGOÿÿÿÿÿøGOÿÿÿÿÿøGHˆˆˆˆˆˆGLÌÌÌÌÌÌGÄDDDDDDÀ ÿÿ € ÿÿ ÿÿ styx-2.0.1/libcs/winstyxcs/winstyxcs.sln 0000644 0001750 0001750 00000003036 11473762573 015423 0000000 0000000 Microsoft Visual Studio Solution File, Format Version 10.00
# Visual Studio 2008
Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "libstyxcs", "libstyxcs\libstyxcs.csproj", "{B0D80FD9-F1C2-425F-BE78-326CDC5BF5E6}"
EndProject
Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "StyxScannerTest", "StyxScannerTest\StyxScannerTest.csproj", "{43CC8D32-FBF0-44BE-9DD5-AFA7845DF838}"
ProjectSection(ProjectDependencies) = postProject
{B0D80FD9-F1C2-425F-BE78-326CDC5BF5E6} = {B0D80FD9-F1C2-425F-BE78-326CDC5BF5E6}
EndProjectSection
EndProject
Global
GlobalSection(SolutionConfigurationPlatforms) = preSolution
Debug|Any CPU = Debug|Any CPU
Release|Any CPU = Release|Any CPU
EndGlobalSection
GlobalSection(ProjectConfigurationPlatforms) = postSolution
{B0D80FD9-F1C2-425F-BE78-326CDC5BF5E6}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
{B0D80FD9-F1C2-425F-BE78-326CDC5BF5E6}.Debug|Any CPU.Build.0 = Debug|Any CPU
{B0D80FD9-F1C2-425F-BE78-326CDC5BF5E6}.Release|Any CPU.ActiveCfg = Release|Any CPU
{B0D80FD9-F1C2-425F-BE78-326CDC5BF5E6}.Release|Any CPU.Build.0 = Release|Any CPU
{43CC8D32-FBF0-44BE-9DD5-AFA7845DF838}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
{43CC8D32-FBF0-44BE-9DD5-AFA7845DF838}.Debug|Any CPU.Build.0 = Debug|Any CPU
{43CC8D32-FBF0-44BE-9DD5-AFA7845DF838}.Release|Any CPU.ActiveCfg = Release|Any CPU
{43CC8D32-FBF0-44BE-9DD5-AFA7845DF838}.Release|Any CPU.Build.0 = Release|Any CPU
EndGlobalSection
GlobalSection(SolutionProperties) = preSolution
HideSolutionNode = FALSE
EndGlobalSection
EndGlobal
styx-2.0.1/libcs/winstyxcs/libstyxcs/ 0000755 0001750 0001750 00000000000 11473763145 014730 5 0000000 0000000 styx-2.0.1/libcs/winstyxcs/libstyxcs/obj/ 0000755 0001750 0001750 00000000000 11163720363 015471 5 0000000 0000000 styx-2.0.1/libcs/winstyxcs/libstyxcs/obj/Debug/ 0000755 0001750 0001750 00000000000 12114651635 016521 5 0000000 0000000 styx-2.0.1/libcs/winstyxcs/libstyxcs/obj/Debug/TempPE/ 0000755 0001750 0001750 00000000000 11233054601 017642 5 0000000 0000000 styx-2.0.1/libcs/winstyxcs/libstyxcs/AssemblyInfo.cs 0000644 0001750 0001750 00000004756 11163720020 017563 0000000 0000000 using System.Reflection;
using System.Runtime.CompilerServices;
//
// Allgemeine Informationen über eine Assembly werden über folgende Attribute
// gesteuert. Ändern Sie diese Attributswerte, um die Informationen zu modifizieren,
// die mit einer Assembly verknüpft sind.
//
[assembly: AssemblyTitle("")]
[assembly: AssemblyDescription("")]
[assembly: AssemblyConfiguration("")]
[assembly: AssemblyCompany("")]
[assembly: AssemblyProduct("")]
[assembly: AssemblyCopyright("")]
[assembly: AssemblyTrademark("")]
[assembly: AssemblyCulture("")]
//
// Versionsinformationen für eine Assembly bestehen aus folgenden vier Werten:
//
// Hauptversion
// Nebenversion
// Buildnummer
// Revision
//
// Sie können alle Werte oder die standardmäßige Revision und Buildnummer
// mit '*' angeben:
[assembly: AssemblyVersion("1.0.*")]
//
// Um die Assembly zu signieren, müssen Sie einen Schlüssel angeben. Weitere Informationen
// über die Assemblysignierung finden Sie in der Microsoft .NET Framework-Dokumentation.
//
// Mit den folgenden Attributen können Sie festlegen, welcher Schlüssel für die Signierung verwendet wird.
//
// Hinweise:
// (*) Wenn kein Schlüssel angegeben ist, wird die Assembly nicht signiert.
// (*) KeyName verweist auf einen Schlüssel, der im CSP (Crypto Service
// Provider) auf Ihrem Computer installiert wurde. KeyFile verweist auf eine Datei, die einen
// Schlüssel enthält.
// (*) Wenn die Werte für KeyFile und KeyName angegeben werden,
// werden folgende Vorgänge ausgeführt:
// (1) Wenn KeyName im CSP gefunden wird, wird dieser Schlüssel verwendet.
// (2) Wenn KeyName nicht vorhanden ist und KeyFile vorhanden ist,
// wird der Schlüssel in KeyFile im CSP installiert und verwendet.
// (*) Um eine KeyFile zu erstellen, können Sie das Programm sn.exe (Strong Name) verwenden.
// Wenn KeyFile angegeben wird, muss der Pfad von KeyFile
// relativ zum Projektausgabeverzeichnis sein:
// %Project Directory%\obj\. Wenn sich KeyFile z.B.
// im Projektverzeichnis befindet, geben Sie das AssemblyKeyFile-Attribut
// wie folgt an: [assembly: AssemblyKeyFile("..\\..\\mykey.snk")]
// (*) Das verzögern der Signierung ist eine erweiterte Option. Weitere Informationen finden Sie in der
// Microsoft .NET Framework-Dokumentation.
//
[assembly: AssemblyDelaySign(false)]
[assembly: AssemblyKeyFile("")]
[assembly: AssemblyKeyName("")]
styx-2.0.1/libcs/winstyxcs/libstyxcs/bin/ 0000755 0001750 0001750 00000000000 11166642051 015467 5 0000000 0000000 styx-2.0.1/libcs/winstyxcs/libstyxcs/bin/Debug/ 0000755 0001750 0001750 00000000000 12114651635 016517 5 0000000 0000000 styx-2.0.1/libcs/winstyxcs/libstyxcs/libstyxcs.csproj 0000644 0001750 0001750 00000007654 11244275477 020134 0000000 0000000 
Local
9.0.21022
2.0
{B0D80FD9-F1C2-425F-BE78-326CDC5BF5E6}
Debug
AnyCPU
libstyxcs
JScript
Grid
IE50
false
Library
styx
OnBuildSuccess
0.0
bin\Debug\
false
285212672
false
DEBUG;TRACE
true
4096
false
false
false
false
false
4
full
prompt
bin\Release\
false
285212672
false
TRACE
false
4096
false
true
false
false
false
4
none
prompt
System
System.Data
System.XML
Code
Code
Code
styx-2.0.1/libcs/StyxParser.cs 0000644 0001750 0001750 00000077015 11244253141 013220 0000000 0000000 /* ------------------------------------------------------------------------ */
/* */
/* [StyxParser.cs] Styx Parser Implementation (C#) */
/* */
/* This file belongs to the Styx Scanner & parser generator. */
/* */
/* Copyright (c) 2009 by Doelle, Manns */
/* ------------------------------------------------------------------------ */
using System;
using System.Text;
using System.IO;
using System.Collections;
using System.Collections.Generic;
/** @file
Abstract parse table interface and parser
*/
namespace styx
{
/** @addtogroup StyxLibraryCS
C# Scanner & parser library
*/
//@{
/** @addtogroup StyxParser
Abstract parse table interface and parser
*/
//@{
/* Parse table Interface -------------------------------------------------- */
/** @addtogroup AbstractParseTableAPI
Abstract parse table interface
*/
//@{
/** parser action (error) codes */
public enum EStyxParseAction
{
PLR_SHIFT_ERROR = -1, //!< shift error
PLR_SHIFT_NONE = -2, //!< no shift (comment)
PLR_GOTO_ERROR = -1 //!< goto error
}
/** abstract parse table interface */
public abstract class CStyxParseTableApi
{
//! The constructor creates an uninitialized parse table.
public CStyxParseTableApi() {}
//! parse table is initialized ?
//! @return true for an initialized parse table
public abstract bool initialized();
//! get language
//! @return language name or ""
public abstract string getLanguage();
//! get number of tokens
//! @return number of tokens or -1
public abstract long getTokenCount();
//! get number of nonterminals
//! @return number of nonterminals or -1
public abstract long getNonterminalCount();
//! get number of symbols
//! (tokens incl. keywords, nonterminals, start symbols)
//! @return number of symbols or -1
public abstract long getSymbolCount();
//! get number of start symbols
//! @return number of start symbols or -1
public abstract long getStartSymbolCount();
//! get number of terminals
//! (tokens incl. keywords, accept tokens)
//! @return number of terminals or -1
public abstract long getTerminalCount();
//! get number of meta symbols
//! (nonterminals, start symbols)
//! @return number of meta symbols or -1
public abstract long getMetaSymbolCount();
//! token index --> terminal index
//! @param TKIndex token index \>= 0 or EOF = -1 or error \< -1
//! @param SNIndex current start symbol index
//! @return terminal index \>= 0 or -1
public abstract long TokenIndex2TerminalIndex(long TKIndex, long SNIndex);
//! accept terminal ?
//! @param TIndex terminal index \>= 0
//! @return true for an accept terminal
public abstract bool isAcceptTerminal(long TIndex);
//! terminal index --> symbol
//! @param TIndex terminal index \>= 0
//! @return terminal symbol \>= 0 or -1
public abstract long TerminalIndex2Symbol(long TIndex);
//! terminal symbol --> index
//! @param TSymbol terminal symbol \>= 0
//! @return terminal index \>= 0 or -1
public abstract long TerminalSymbol2Index(long TSymbol);
//! start symbol index --> symbol
//! @param SNIndex start symbol index \>= 0
//! @return start symbol \>= 0 or -1
public abstract long StartIndex2Symbol(long SNIndex);
//! start symbol symbol --> index
//! @param SNSymbol start symbol \>= 0
//! @return start symbol index \>= 0 or -1
public abstract long StartSymbol2Index(long SNSymbol);
//! start symbol name --> index
//! @param StartSymbolName start symbol name or "" (first start symbol)
//! @return start symbol index \>= 0 or -1
public abstract long StartName2Index(string StartSymbolName/*=""*/);
//! nonterminal index --> symbol
//! @param NIndex nonterminal index \>= 0
//! @return nonterminal symbol \>= 0 or -1
public abstract long NonterminalIndex2Symbol(long NIndex);
//! nonterminal symbol --> index
//! @param NSymbol nonterminal symbol \>= 0
//! @return nonterminal index \>= 0 or -1
public abstract long NonterminalSymbol2Index(long NSymbol);
//! error (recovery) nonterminal ?
//! @param NIndex nonterminal index \>= 0
//! @return true for an error (recovery) nonterminal
public abstract bool isErrorNonterminal(long NIndex);
//! nonterminal ?
//! @param Symbol CFG symbol \>= 0
//! @return true for a nonterminal
public abstract bool isNonterminal(long Symbol);
//! regular token class ?
//! @param Symbol CFG symbol \>= 0
//! @return true for a regular token class
public abstract bool isToken(long Symbol);
//! comment token ?
//! @param Symbol CFG symbol \>= 0
//! @return true for a comment token
public abstract bool isComment(long Symbol);
//! keword ?
//! @param Symbol CFG symbol \>= 0
//! @return true for a keyword
public abstract bool isKeyword(long Symbol);
//! get symbol name
//! @param Symbol CFG symbol \>= 0
//! @return symbol name or ""
public abstract string getSymbolName(long Symbol);
//! get number of productions
//! @return number of productions or -1
public abstract long getProductionCount();
//! get production name
//! @param PIndex production index \>= 0
//! @return production name or ""
public abstract string getProductionName(long PIndex);
//! get production nonterminal
//! @param PIndex production index \>= 0
//! @return nonterminal symbol \>= 0 or -1
public abstract long getProductionNonterminal(long PIndex);
//! get number of production member symbols
//! @param PIndex production index \>= 0
//! @return number of member symbols or -1
public abstract long getProductionSymbolCount(long PIndex);
//! get production member symbol
//! @param PIndex production index \>= 0
//! @param PMIndex production member index \>= 0
//! @return member symbol \>= 0 or -1
public abstract long getProductionSymbol(long PIndex, long PMIndex);
//! get number of states
//! @return number of states or -1
public abstract long getStateCount();
//! get error action
//! @return error action >= 0 or -1
public abstract long getErrorAction();
//! get accept action
//! @return accept action >= 0 or -1
public abstract long getAcceptAction();
//! get shift follow state for state and terminal index
//! @param STIndex current state index \>= 0
//! @param TIndex current terminal index \>= 0
//! @return follow state index \>= 0 or
//! PLR_SHIFT_NONE for a comment token or
//! PLR_SHIFT_ERROR
public abstract long getShiftState(long STIndex, long TIndex);
//! get goto follow state for state and nonterminal index
//! @param STIndex current state index \>= 0
//! @param NIndex current nonterminal index \>= 0
//! @return follow state index \>= 0 or PLR_GOTO_ERROR
public abstract long getGoToState(long STIndex, long NIndex);
//! get reduce action for state and terminal index
//! @param STIndex current state index \>= 0
//! @param TIndex current terminal index \>= 0
//! @return reduce action \>= 0
public abstract long getReduceAction(long STIndex, long TIndex);
//! try early action for state index
//! @param STIndex current state index \>= 0
//! @param Action [result] reduce action \>= 0
//! @return true if a default action exists
public abstract bool tryEarlyAction(long STIndex, ref long Action);
//! reduce action = error ?
//! @param Action reduce action \>= 0
//! @return true if action = error
public abstract bool isErrorAction(long Action);
//! reduce action = accept ?
//! @param Action reduce action \>= 0
//! @return true if action = accept
public abstract bool isAcceptAction(long Action);
//! reduce action --> production
//! @param Action reduce action \>= 0
//! @param SNIndex current start symbol index \>= 0
//! @return production index \>= 0 or -1
public abstract long Action2Production(long Action, long SNIndex);
}
//@}
/* Parser ----------------------------------------------------------------- */
/** @addtogroup AbstractParser
Abstract lalr(1) parser
*/
//@{
/** type of scanned terminal */
public class StyxToken
{
public long Index; //!< terminal index >= 0 or error terminal
public TV Value; //!< token value
public string File; //!< token file
public long Line; //!< token line
public long Column; //!< token column
public StyxToken()
{
Index = -1;
Value = default(TV);
File = "";
Line = Column = 0;
}
}
/** abstract lalr(1) parser template */
public abstract class TStyxParser
{
/** number of error messages to skip after the last reported */
public static int PLR_SKIP_ERRMSG
{
get { return 3; }
}
/*OBSOLET
protected:
typedef vector V_long;
typedef vector V_value;
typedef StyxToken T_Token;
*/
/** must be set appropiate in derived classes */
protected bool initok;
protected CStyxParseTableApi ParseTable; //!< parse table
protected long StartIndex; //!< start symbol index
protected List StateStack; //!< state stack
protected List ValueStack; //!< value stack
/** @name EarlyReductionAttributes
attributes related to early reduction
*/
//@{
protected StyxToken curToken; //!< current token
protected bool firstToken; //!< first token (respectively parse) ?
protected bool nextToken; //!< (read) next token ?
//@}
/** @name ErrorHandlingAttributes
attributes related to (panic mode) error handling
*/
/* Skip: T --> { 1 .. StateStack } X NT U { undefined } */
//@{
protected List skipTokens; //!< skip token array
protected List skipStates; //!< skip state array
protected List skipNonterminals; //!< skip nonterminal array
protected long SyntaxErrorCount; //!< number of syntax errors
//@}
//! init parse process
//! @param StartSymbolName start symbol name
//! @param State [result] current state index \>= 0
//! @return true or false on error
protected virtual bool initParse(string StartSymbolName, ref long State)
{
State = -1;
SyntaxErrorCount = 0;
if( initok && ParseTable != null )
{ long startidx = ParseTable.StartName2Index(StartSymbolName);
if( StartIndex == -1 )
{
removeValues(true);
StateStack.Clear();
StateStack.Add(StartIndex=startidx);
}
else
{
if( StartIndex != startidx || StateStack.Count == 0 )
return false;
}
State = StateStack[StateStack.Count-1];
return true;
}
return false;
}
//! quit parse process
//! @param reset
//! = true --\> reset parse process
//! else --\> keep last token (early reduction)
protected virtual void quitParse(bool reset/*=false*/)
{
StartIndex = -1;
if( reset )
{
curToken.Index = -1;
firstToken = nextToken = true;
}
removeValues(false);
StateStack.Clear();
}
//! reset parser
//! @return true or false on error
protected virtual bool reset()
{
initok = ParseTable != null && ParseTable.initialized();
SyntaxErrorCount = 0;
StartIndex = -1;
curToken = new StyxToken();
//curToken.Index = -1;
firstToken = nextToken = true;
removeValues(true);
StateStack = new List();
skipTokens = new List();
skipStates = new List();
skipNonterminals = new List();
return initok;
}
//! remove (temporary) values
//! @param reset
//! = true --\> release all values
protected virtual void removeValues(bool reset)
{
ValueStack = new List();
}
//! init skip tables
//! @return true --\> try error recovery
protected virtual bool initSkipTables()
{
if( initok && ParseTable != null )
{ long tcnt = ParseTable.getTerminalCount(),
scnt = (long)StateStack.Count,
ncnt = ParseTable.getNonterminalCount();
for( long i=0; i < tcnt; ++i )
skipTokens.Add(-1);
for( long i=scnt-1; i >= 0; --i )
{
for( long j=0; j < ncnt; ++j )
{
if( ParseTable.isErrorNonterminal(j) )
{ long s = ParseTable.getGoToState(StateStack[(int)i],j);
if (s != (long)EStyxParseAction.PLR_GOTO_ERROR)
{
for( long k=0; k < tcnt; ++k )
{ long p1 = ParseTable.getShiftState(s,k);
if (p1 != (long)EStyxParseAction.PLR_SHIFT_ERROR &&
p1 != (long)EStyxParseAction.PLR_SHIFT_NONE &&
skipTokens[(int)k] == -1L )
{
skipNonterminals.Add(j);
skipStates.Add(i);
skipTokens[(int)k] = (long)skipNonterminals.Count-1;
}
}
}
}
}
}
if( skipStates.Count > 0 ) return true;
}
quitSkipTables();
return false;
}
//! release skip tables
protected virtual void quitSkipTables()
{
skipTokens.Clear();
skipStates.Clear();
skipNonterminals.Clear();
}
//! pop n states
//! @param n number of states
protected virtual void popStates(long n)
{
if( n >= StateStack.Count )
StateStack.Clear();
else
for( long i=0; i < n; ++i )
StateStack.RemoveAt(StateStack.Count-1);
}
//! get & pop the top n values
//! @param n number of values
//! @param Values [result] values
//! @return true or false on error
protected virtual bool topValues(long n, ref List Values)
{
if( n < 0 || n > ValueStack.Count )
return false;
for( long cnt = ValueStack.Count, i=cnt-n; i < cnt; ++i )
{
Values.Add(ValueStack[(int)i]);
}
for( long i=0; i < n; ++i )
{
StateStack.RemoveAt(StateStack.Count-1);
}
return true;
}
//! try early reduction
//! @param State [changeable] current state index \>= 0
//! @param accept [result]
//! = true --\> finish parse process
//! @return true or false on error
protected virtual bool earlyReduction(ref long State, ref bool accept)
{
accept = false;
if( initok && ParseTable != null )
{ long res = ParseTable.getErrorAction();
while( ParseTable.tryEarlyAction(State,ref res) )
{ List Values = new List();
SV val = default(SV);
if( !ParseTable.isAcceptAction(res) )
{ long prod = ParseTable.Action2Production(res,StartIndex),
scnt = ParseTable.getProductionSymbolCount(prod);
if( !topValues(scnt,ref Values) ) return false;
if( !reduce(prod,ref Values,false,false,ref val) ) return false;
popStates(scnt);
long nidx = ParseTable.NonterminalSymbol2Index
(
ParseTable.getProductionNonterminal(prod)
);
State = getGoToState(nidx);
StateStack.Add(State); ValueStack.Add(val);
if( State == (long)EStyxParseAction.PLR_GOTO_ERROR )
return false;
}
else
{ long prod = ParseTable.Action2Production(res,StartIndex),
scnt = ParseTable.getProductionSymbolCount(prod);
if( !topValues(scnt,ref Values) ) return false;
if( !reduce(prod,ref Values,true,false,ref val) ) return false;
accept = true; return true;
}
}
return true;
}
return false;
}
//! get goto follow state for top state and nonterminal index
//! @param NIndex nonterminal index \>= 0
//! @return follow state index \>= 0 or PLR_GOTO_ERROR
protected virtual long getGoToState(long NIndex)
{
if( initok && ParseTable != null && StateStack.Count > 0 )
{
return ParseTable.getGoToState(StateStack[StateStack.Count-1],NIndex);
}
return (long)EStyxParseAction.PLR_GOTO_ERROR;
}
//! (report) internal parser error
//! @param Text error message
protected virtual void error(string Text)
{
Console.Error.WriteLine(Text);
}
/** @name AbstractParserMethods
abstract methods, must be overloaded in derived classes
*/
//@{
//! get next token
//! @param Token [result] next token
//! @return true or false on error
protected abstract bool get(ref StyxToken Token);
//! shift token
//! @param Token current token
//! @param Value [result] new stack value
//! @return true or false on error
protected abstract bool shift(ref StyxToken Token, ref SV Value);
//! reduce production
//! @param Index
//! accept || !error --\> Index=production
//! else --\> Index=nonterminal
//! @param Values reduction values
//! @param accept = true --\> reduce start production
//! @param error = true --\> syntax error
//! @param Value [result] new stack value
//! @return true or false on error
protected abstract bool reduce
(
long Index, ref List Values,
bool accept, bool error, ref SV Value
);
//! (report) syntax error
//! @param Token current token
protected abstract void error(ref StyxToken Token);
//@}
//! The default constructor.
public TStyxParser()
{
ParseTable = null;
initok = reset();
}
//! The constructor creates and initializes the parser.
//! @param PTable parse table
public TStyxParser(ref CStyxParseTableApi PTable)
{
ParseTable = PTable;
initok = reset();
}
//! set parse table and
//! re-init (--> reset) parser
//! @param PTable parse table
//! @return true or false on error
public virtual bool setParseTable(ref CStyxParseTableApi PTable)
{
ParseTable = PTable;
initok = reset();
if( !initok ) error("reset failed");
return initok;
}
//! get parse table
//! @return parse table
public virtual void getParseTable(ref CStyxParseTableApi PTable)
{
PTable = ParseTable;
}
//! parse process
//! @param StartSymbolName start symbol name or "" (first start symbol)
//! @param early try early reduction
//! @return true for a regular parse process (even in the case of syntax errors)
//! or false on (internal) error
public virtual bool parse(string StartSymbolName/*=""*/, bool early/*=false*/)
{
if( initok && ParseTable != null )
{ long cTok = -1, cState = -1, errcnt=0, tokcnt=0;
SyntaxErrorCount = 0;
if( !early || nextToken )
{
if( !get(ref curToken) )
{ quitParse(true); return false; }
}
cTok = curToken.Index; ++tokcnt;
if( early && !firstToken && ParseTable.isAcceptTerminal(curToken.Index) )
{
quitParse(true); return true;
}
if( !initParse(StartSymbolName,ref cState) )
{ quitParse(true); return false; }
while( true )
{
long action = ParseTable.getShiftState(cState,cTok);
if( action != (long)EStyxParseAction.PLR_SHIFT_ERROR )
{ SV val = default(SV);
if( !shift(ref curToken,ref val) )
{ quitParse(true); return false; }
if( action != (long)EStyxParseAction.PLR_SHIFT_NONE )
{
cState = action;
StateStack.Add(cState); ValueStack.Add(val);
if( early )
{ bool accept = false;
if( !earlyReduction(ref cState,ref accept) )
{ quitParse(true); return false; }
if( accept )
{
firstToken = false; nextToken = true;
quitParse(false); return true;
}
}
}
if( !get(ref curToken) )
{ quitParse(true); return false; }
cTok = curToken.Index; ++tokcnt;
}
else
{
action = ParseTable.getReduceAction(cState,cTok);
long redsym = ParseTable.Action2Production(action,StartIndex);
if( !ParseTable.isErrorAction(action) &&
!ParseTable.isAcceptAction(action) )
{ long scnt = ParseTable.getProductionSymbolCount(redsym);
List Values = new List();
SV val = default(SV);
if( !topValues(scnt,ref Values) )
{ quitParse(true); return false; }
if( !reduce(redsym,ref Values,false,false,ref val) )
{ quitParse(true); return false; }
popStates(scnt);
long nidx = ParseTable.NonterminalSymbol2Index
(
ParseTable.getProductionNonterminal(redsym)
);
cState = getGoToState(nidx);
StateStack.Add(cState); ValueStack.Add(val);
if( cState == (long)EStyxParseAction.PLR_GOTO_ERROR )
{ quitParse(true); return false; }
if( early )
{ bool accept = false;
if( !earlyReduction(ref cState,ref accept) )
{ quitParse(true); return false; }
if( accept )
{
firstToken = nextToken = false;
quitParse(false); return true;
}
}
}
else
{
if( ParseTable.isAcceptAction(action) &&
ParseTable.isAcceptTerminal(cTok) )
{ long scnt = ParseTable.getProductionSymbolCount(redsym);
List Values = new List();
SV val = default(SV);
if( !topValues(scnt,ref Values) )
{ quitParse(true); return false; }
if( SyntaxErrorCount == 0 || scnt == ((long)ValueStack.Count) )
{
if( !reduce(redsym,ref Values,true,false,ref val) )
{ quitParse(true); return false; }
}
else
{
if( !reduce(redsym,ref Values,true,true,ref val) )
{ quitParse(true); return false; }
}
firstToken = nextToken = false;
quitParse(false); return true;
}
else
/*ALT
{ List Values = new List();
SV val = default(SV);
++SyntaxErrorCount; error(ref curToken);
if( !topValues((long)ValueStack.Count,ref Values) )
{ quitParse(true); return false; }
if( !reduce(redsym,ref Values,true,true,ref val) )
{ quitParse(true); return false; }
quitParse(true); return true;
}
*/
/*NEU*/
{ long p = -1, s = -1, n = -1;
++SyntaxErrorCount;
if( tokcnt >= errcnt )
{
error(ref curToken); errcnt = tokcnt + PLR_SKIP_ERRMSG;
}
if( !early && initSkipTables() )
{
while( !ParseTable.isAcceptTerminal(cTok) &&
( cTok < 0 || skipTokens[(int)cTok] == -1 ) )
{ SV val = default(SV);
if( !shift(ref curToken,ref val) )
{ quitParse(true); return false; }
if( cTok < 0 )
ValueStack.Add(val);
else
{ long tsym = ParseTable.TerminalIndex2Symbol(cTok);
if( ! ParseTable.isComment(tsym) )
ValueStack.Add(val);
}
if( !get(ref curToken) )
{ quitParse(true); return false; }
cTok = curToken.Index; // cTok < 0 --> continue
}
if( cTok < 0 ) /* assertion: cTok >= 0 */
{ quitParse(true); return false; }
if( !ParseTable.isAcceptTerminal(cTok) )
{
s = skipStates[(int)skipTokens[(int)cTok]];
n = skipNonterminals[(int)skipTokens[(int)cTok]];
}
quitSkipTables();
}
else // quit parsing on first error
cTok = ParseTable.TokenIndex2TerminalIndex(-1,StartIndex);
if( !ParseTable.isAcceptTerminal(cTok) )
{ long vcnt = ((long)ValueStack.Count)-(s+1),
scnt = ((long)StateStack.Count)-(s+1);
List Values = new List();
SV val = default(SV);
if( !topValues(vcnt,ref Values) )
{ quitParse(true); return false; }
if( !reduce(n,ref Values,false,true,ref val) )
{ quitParse(true); return false; }
popStates(scnt);
cState = getGoToState(n);
StateStack.Add(cState); ValueStack.Add(val);
if( cState == (long)EStyxParseAction.PLR_GOTO_ERROR ||
ValueStack.Count != StateStack.Count )
{ quitParse(true); return false; }
}
else
{
List Values = new List();
SV val = default(SV);
if( !topValues((long)ValueStack.Count,ref Values) )
{ quitParse(true); return false; }
p = ParseTable.Action2Production
(
ParseTable.getAcceptAction(),StartIndex
);
if( !reduce(p,ref Values,true,true,ref val) )
{ quitParse(true); return false; }
quitParse(true); return true;
}
}
/**/
}
}
}
}
error("parser not initialized");
return false;
}
//! parse process
//! uses first start symbol, no early reduction
//! @return true for a regular parse process (even in the case of syntax errors)
//! or false on (internal) error
public virtual bool parse()
{
return parse("",false);
}
//! get number of syntax errors
//! @return number of syntax errors
public virtual long getSyntaxErrorCount()
{
return SyntaxErrorCount;
}
};
//@}
//@}
//@}
}
styx-2.0.1/incxml/ 0000755 0001750 0001750 00000000000 12116751140 011012 5 0000000 0000000 styx-2.0.1/incxml/xml_lim.h 0000664 0001750 0001750 00000000504 07634632053 012557 0000000 0000000 /* [xml_lim.h] Scanner table for 'xml' */
/* File generated by 'ctoh'. Don't change manually. */
#ifndef xml_lim_INCL
#define xml_lim_INCL
#include "scn_io.h"
#ifdef __cplusplus
extern "C" {
#endif
void Scn_get_xml(Scn_T *scn); /* simulates a Scn_get */
#ifdef __cplusplus
}
#endif
#endif
styx-2.0.1/incxml/dtd_pim.h 0000664 0001750 0001750 00000000500 07634632052 012531 0000000 0000000 /* [dtd_pim.h] Parser table for 'dtd' */
/* File generated by 'ctoh'. Don't change manually. */
#ifndef dtd_pim_INCL
#define dtd_pim_INCL
#include "prs.h"
#ifdef __cplusplus
extern "C" {
#endif
PLR_Tab PLR_get_dtd(); /* simulates a PLR_getTab */
#ifdef __cplusplus
}
#endif
#endif
styx-2.0.1/incxml/xml_test_cim.h 0000664 0001750 0001750 00000000525 07634632052 013607 0000000 0000000 /* [xml_test_cim.h] Context table for 'xml_test' */
/* File generated by 'ctoh'. Don't change manually. */
#ifndef xml_test_cim_INCL
#define xml_test_cim_INCL
#include "ctx.h"
#ifdef __cplusplus
extern "C" {
#endif
void CTX_init_xml_test(int argc, c_string argv[]); /* */
#ifdef __cplusplus
}
#endif
#endif
styx-2.0.1/incxml/xmllit_lim.h 0000664 0001750 0001750 00000000520 07634632052 013265 0000000 0000000 /* [xmllit_lim.h] Scanner table for 'xmllit' */
/* File generated by 'ctoh'. Don't change manually. */
#ifndef xmllit_lim_INCL
#define xmllit_lim_INCL
#include "scn_io.h"
#ifdef __cplusplus
extern "C" {
#endif
void Scn_get_xmllit(Scn_T *scn); /* simulates a Scn_get */
#ifdef __cplusplus
}
#endif
#endif
styx-2.0.1/incxml/xml_base.h 0000664 0001750 0001750 00000011055 07634632052 012712 0000000 0000000 /* ------------------------------------------------------------------------- */
/* */
/* [xml_base.h] XML Base Library */
/* - parsing, interpretation and transformation - */
/* */
/* Copyright (c) 2003 by D\olle, Manns. */
/* ------------------------------------------------------------------------- */
/* File generated by 'ctoh'. Don't change manually. */
#ifndef xml_base_INCL
#define xml_base_INCL
#include "standard.h"
#include "symbols.h"
#include "hmap.h"
#include "hset.h"
#include "ptm.h"
#include "xml_dfn.h"
#ifdef __cplusplus
extern "C" {
#endif
/*
The module [xml_base] provides an reentrant interface for the parsing,
interpretation and transformation of XML documents.
*/
/* -------------------------- Types and macros ------------------------------ */
AbstractType( XmlApp_T ) /* Abstract XML application type */
;
AbstractType( XmlCtx_T ) /* Abstract XML parser type */
;
/* ----------------------------- Init & Quit -------------------------------- */
XmlApp_T XML_app_init
(
XMLHDL_io_init io_init,
XMLHDL_io_cleanup io_quit,
XMLHDL_io_create_handle io_create,
XMLHDL_io_drop_handle io_drop,
XMLHDL_io_download io_download
)
/* init XML application;
optional I/O handler:
'io_init' = init download module
'io_quit' = cleanup download module
'io_create' = create download handle
'io_drop' = drop download handle
'io_download' = download URL to (string) stream
*/
;
void XML_app_quit(XmlApp_T xmlapp)
/* quit XML application; release resources */
;
XmlCtx_T XML_init
(
XmlApp_T xmlapp,
void (*prMsg)(c_string msg), c_bool verbose, c_bool diagnose
)
/* init XML parsing;
'prMsg' --> print function or NULL
'verbose' --> (de)activate progress information
'diagnose' --> (de)activate diagnose information
*/
;
void XML_quit(XmlCtx_T xmlctx); /* quit XML compilation; release resources */
/* ---------------------------- Set & Get ----------------------------------- */
void XML_set_verbose(XmlCtx_T xmlctx, c_bool verbose)
/* (de)activate progress information */
;
void XML_set_diagnose(XmlCtx_T xmlctx, c_bool diagnose)
/* (de)activate diagnose information */
;
void XML_set_context(XmlCtx_T xmlctx, Any_T extctx)
/* set external context information */
;
Any_T XML_get_context(XmlCtx_T xmlctx); /* get external context information */
void XML_get_trees(XmlCtx_T xmlctx, symbol* root, MAP(symbol,PT_Term)* trees)
/* get document trees */
;
/* ---------------------------- Parsing & Tree construction ----------------- */
int XML_load_file
(
XmlCtx_T xmlctx, c_string xmldoc, c_string cset, c_bool dtd, c_bool all
)
/* parses XML/DTD definition in file 'xmldoc' and
constructs the corresponding tree;
'cset' = character set name ( UCS4, UTF-8, MS:CodePage / GNU:iconv-based )
'dtd' = True --> 'xmldoc' contains DTD definitions
'all' = True --> loads all referenced documents
RC > 0: number of (syntax and semantic) errors
RC = -1: tree construction failed
RC = 0: successful load
*/
;
int XML_load_string
(
XmlCtx_T xmlctx, c_string xmldoc, unsigned int len,
c_string cset, c_bool dtd, c_bool all
)
/* parses XML definition in string 'xmldoc' and
constructs the corresponding tree;
'len' = string size in bytes, inclusive terminating bytes
'cset' = character set name ( UCS4, UTF-8, MS:CodePage / GNU:iconv-based )
'dtd' = True --> 'xmldoc' contains DTD definitions
'all' = True --> loads all referenced documents
RC > 0: number of syntax and semantic errors
RC = -1: tree construction failed
RC = 0: successful load
*/
;
int XML_load_url
(
XmlCtx_T xmlctx, c_string xmldoc,
c_string cset, c_string auth, c_bool dtd, c_bool all
)
/* parses XML definition identified by URL 'xmldoc' and
constructs the corresponding tree;
'cset' = character set name ( UCS4, UTF-8, MS:CodePage / GNU:iconv-based )
'auth' = optional user authentification ( format: user:passwd )
'dtd' = True --> 'xmldoc' contains DTD definitions
'all' = True --> loads all referenced documents
RC > 0: number of syntax and semantic errors
RC = -1: tree construction failed
RC = 0: successful load
assertion: valid I/O handler
*/
;
#ifdef __cplusplus
}
#endif
#endif
styx-2.0.1/incxml/xml_io.h 0000664 0001750 0001750 00000003452 07634632052 012411 0000000 0000000 /* ------------------------------------------------------------------------- */
/* */
/* [xml_io.h] curl Wrapper */
/* - fetch files identified by an URL - */
/* */
/* Copyright (c) 2003 by D\olle, Manns. */
/* ------------------------------------------------------------------------- */
/* File generated by 'ctoh'. Don't change manually. */
#ifndef xml_io_INCL
#define xml_io_INCL
#include "standard.h"
#include "xml_dfn.h"
#include "gstream.h"
#ifdef __cplusplus
extern "C" {
#endif
/*
The module [xml_io] uses the library libcurl to fetch files identified
by an URL.
*/
/* ---------------------------- Init & Quit --------------------------------- */
c_bool XML_io_init()
/* init URL-based I/O; to be called once during application setup */
;
void XML_io_quit()
/* quit URL-based I/O; to be called once during application cleanup */
;
/* ----------------------------- Creation & Disposal ------------------------- */
UrlHdl_T XML_io_create_handle()
/* create a new handle to access URL-based resources;
RC: handle or NULL
*/
;
void XML_io_drop_handle(UrlHdl_T hdl); /* drop handle 'hdl' */
/* ----------------------------- URL Access ---------------------------------- */
c_bool XML_io_download
(
UrlHdl_T hdl, c_string url, c_string auth,
GStream_T stream, void (*prMsg)(c_string msg)
)
/* download resource 'url' and put it to 'stream';
optionally, use 'auth' (format: user:passwd) for authorisation
and 'prMsg' as error callback
*/
;
#ifdef __cplusplus
}
#endif
#endif
styx-2.0.1/incxml/xml_pim.h 0000664 0001750 0001750 00000000500 07634632053 012557 0000000 0000000 /* [xml_pim.h] Parser table for 'xml' */
/* File generated by 'ctoh'. Don't change manually. */
#ifndef xml_pim_INCL
#define xml_pim_INCL
#include "prs.h"
#ifdef __cplusplus
extern "C" {
#endif
PLR_Tab PLR_get_xml(); /* simulates a PLR_getTab */
#ifdef __cplusplus
}
#endif
#endif
styx-2.0.1/incxml/dtd_lim.h 0000664 0001750 0001750 00000000504 07634632052 012531 0000000 0000000 /* [dtd_lim.h] Scanner table for 'dtd' */
/* File generated by 'ctoh'. Don't change manually. */
#ifndef dtd_lim_INCL
#define dtd_lim_INCL
#include "scn_io.h"
#ifdef __cplusplus
extern "C" {
#endif
void Scn_get_dtd(Scn_T *scn); /* simulates a Scn_get */
#ifdef __cplusplus
}
#endif
#endif
styx-2.0.1/incxml/dtd_int.h 0000644 0001750 0001750 00000026430 12002551733 012535 0000000 0000000 /* ------------------------------------------------------------------------ */
/* */
/* [dtd_int.h] Language Interface */
/* */
/* ------------------------------------------------------------------------ */
/* File generated by 'ctoh'. Don't change manually. */
#ifndef dtd_int_INCL
#define dtd_int_INCL
#include "ptm.h"
#include "gls.h"
#ifdef __cplusplus
extern "C" {
#endif
/* --------------------- symbol objects - init & quit --------------------- */
void dtd_initSymbols(); /* */
void dtd_quitSymbols(); /* */
/* -------------------------- Types & Constants --------------------------- */
AbstractType( dtd );
AbstractType( dtdRoot );
AbstractType( dtdEmbed );
AbstractType( dtdExtern );
AbstractType( dtdXDecl );
AbstractType( dtdExtID );
AbstractType( dtdXLiteral );
AbstractType( dtdDecl );
AbstractType( dtdCond );
AbstractType( dtdAttribute );
AbstractType( dtdAType );
AbstractType( dtdADefault );
AbstractType( dtdFixed );
AbstractType( dtdEntity );
AbstractType( dtdEntityVal );
AbstractType( dtdNData );
AbstractType( dtdContent );
AbstractType( dtdROpr );
AbstractType( dtdXName );
/* --------------------------- Access to Tokens --------------------------- */
c_bool Tdtd_PERef(GLS_Tok x); /* */
c_bool Tdtd_Nmtoken(GLS_Tok x); /* */
c_bool Tdtd_XMLDecl(GLS_Tok x); /* */
c_bool Tdtd_PI(GLS_Tok x); /* */
c_bool Tdtd_Keyset(GLS_Tok x); /* */
c_bool Tdtd_Name(GLS_Tok x); /* */
c_bool Tdtd_Literal(GLS_Tok x); /* */
c_bool Tdtd_DTDStart(GLS_Tok x); /* */
c_bool Tdtd_IgnSect(GLS_Tok x); /* */
/* --------------------------- Access to Terms ---------------------------- */
c_bool dtd_dtd(PT_Term x, dtd* x1); /* */
c_bool dtd_Root(PT_Term x, dtdRoot* x1); /* */
c_bool dtd_Embed(PT_Term x, dtdEmbed* x1); /* */
c_bool dtd_Extern(PT_Term x, dtdExtern* x1); /* */
c_bool dtd_XDecl(PT_Term x, dtdXDecl* x1); /* */
c_bool dtd_ExtID(PT_Term x, dtdExtID* x1); /* */
c_bool dtd_XLiteral(PT_Term x, dtdXLiteral* x1); /* */
c_bool dtd_Decl(PT_Term x, dtdDecl* x1); /* */
c_bool dtd_Cond(PT_Term x, dtdCond* x1); /* */
c_bool dtd_Attribute(PT_Term x, dtdAttribute* x1); /* */
c_bool dtd_AType(PT_Term x, dtdAType* x1); /* */
c_bool dtd_ADefault(PT_Term x, dtdADefault* x1); /* */
c_bool dtd_Fixed(PT_Term x, dtdFixed* x1); /* */
c_bool dtd_Entity(PT_Term x, dtdEntity* x1); /* */
c_bool dtd_EntityVal(PT_Term x, dtdEntityVal* x1); /* */
c_bool dtd_NData(PT_Term x, dtdNData* x1); /* */
c_bool dtd_Content(PT_Term x, dtdContent* x1); /* */
c_bool dtd_ROpr(PT_Term x, dtdROpr* x1); /* */
c_bool dtd_XName(PT_Term x, dtdXName* x1); /* */
/* --------------------------------- dtd ---------------------------------- */
c_bool dtd_Start_Root(dtd x, dtdRoot* x1)
#define dtd_Start_0 dtd_Start_Root
;
c_bool dtd_Start_Embed(dtd x, dtdEmbed* x1)
#define dtd_Start_1 dtd_Start_Embed
;
/* --------------------------------- Root --------------------------------- */
c_bool dtdRoot_text(dtdRoot x, dtdExtern* x1); /* */
c_bool dtdRoot_tdoc(dtdRoot x, GLS_Tok* x1, dtdEmbed* x2); /* */
/* -------------------------------- Embed --------------------------------- */
c_bool dtdEmbed_dfn(dtdEmbed x, dtdXName* x1, dtdExtID* x2,
GLS_Lst(dtdDecl)* x3)
;
/* -------------------------------- Extern -------------------------------- */
c_bool dtdExtern_dfn(dtdExtern x, dtdXDecl* x1, GLS_Lst(dtdDecl)* x2); /* */
/* -------------------------------- XDecl --------------------------------- */
c_bool dtdXDecl_nul(dtdXDecl x); /* */
c_bool dtdXDecl_dfn(dtdXDecl x, GLS_Tok* x1); /* */
/* -------------------------------- ExtID --------------------------------- */
c_bool dtdExtID_pub(dtdExtID x, dtdXLiteral* x1, dtdXLiteral* x2); /* */
c_bool dtdExtID_pref(dtdExtID x, GLS_Tok* x1); /* */
c_bool dtdExtID_sys(dtdExtID x, dtdXLiteral* x1); /* */
c_bool dtdExtID_nul(dtdExtID x); /* */
/* ------------------------------- XLiteral ------------------------------- */
c_bool dtdXLiteral_pref(dtdXLiteral x, GLS_Tok* x1); /* */
c_bool dtdXLiteral_lit(dtdXLiteral x, GLS_Tok* x1); /* */
c_bool dtdXLiteral_nul(dtdXLiteral x); /* */
/* --------------------------------- Decl --------------------------------- */
c_bool dtdDecl_pi(dtdDecl x, GLS_Tok* x1); /* */
c_bool dtdDecl_cond(dtdDecl x, dtdCond* x1); /* */
c_bool dtdDecl_pref(dtdDecl x, GLS_Tok* x1); /* */
c_bool dtdDecl_note(dtdDecl x, dtdXName* x1, dtdExtID* x2); /* */
c_bool dtdDecl_elm(dtdDecl x, dtdXName* x1, dtdContent* x2); /* */
c_bool dtdDecl_attr(dtdDecl x, dtdXName* x1, GLS_Lst(dtdAttribute)* x2);/* */
c_bool dtdDecl_ent(dtdDecl x, dtdEntity* x1); /* */
/* --------------------------------- Cond --------------------------------- */
c_bool dtdCond_cinc(dtdCond x, dtdExtern* x1); /* */
c_bool dtdCond_ccnd(dtdCond x, GLS_Tok* x1, dtdExtern* x2); /* */
c_bool dtdCond_cign(dtdCond x, GLS_Tok* x1); /* */
/* ------------------------------ Attribute ------------------------------- */
c_bool dtdAttribute_dft(dtdAttribute x, dtdADefault* x1); /* */
c_bool dtdAttribute_typ(dtdAttribute x, dtdAType* x1); /* */
c_bool dtdAttribute_nam(dtdAttribute x, dtdXName* x1); /* */
/* -------------------------------- AType --------------------------------- */
c_bool dtdAType_id(dtdAType x); /* */
c_bool dtdAType_ref(dtdAType x); /* */
c_bool dtdAType_nmts(dtdAType x); /* */
c_bool dtdAType_ents(dtdAType x); /* */
c_bool dtdAType_nmt(dtdAType x); /* */
c_bool dtdAType_etyp(dtdAType x, GLS_Lst(dtdXName)* x1); /* */
c_bool dtdAType_ent(dtdAType x); /* */
c_bool dtdAType_ntyp(dtdAType x); /* */
c_bool dtdAType_refs(dtdAType x); /* */
c_bool dtdAType_str(dtdAType x); /* */
/* ------------------------------- ADefault ------------------------------- */
c_bool dtdADefault_fix(dtdADefault x, dtdFixed* x1, GLS_Tok* x2); /* */
c_bool dtdADefault_req(dtdADefault x); /* */
c_bool dtdADefault_imp(dtdADefault x); /* */
/* -------------------------------- Fixed --------------------------------- */
c_bool dtdFixed_nul(dtdFixed x); /* */
c_bool dtdFixed_fix(dtdFixed x); /* */
/* -------------------------------- Entity -------------------------------- */
c_bool dtdEntity_pent(dtdEntity x, dtdXName* x1, dtdEntityVal* x2); /* */
c_bool dtdEntity_gent(dtdEntity x, dtdXName* x1, dtdEntityVal* x2); /* */
/* ------------------------------ EntityVal ------------------------------- */
c_bool dtdEntityVal_ient(dtdEntityVal x, dtdXLiteral* x1); /* */
c_bool dtdEntityVal_eent(dtdEntityVal x, dtdExtID* x1, dtdNData* x2); /* */
/* -------------------------------- NData --------------------------------- */
c_bool dtdNData_dfn(dtdNData x, dtdXName* x1, dtdXName* x2); /* */
c_bool dtdNData_nul(dtdNData x); /* */
/* ------------------------------- Content -------------------------------- */
c_bool dtdContent_alt(dtdContent x, dtdContent* x1, dtdContent* x2); /* */
c_bool dtdContent_mix(dtdContent x, GLS_Lst(dtdXName)* x1); /* */
c_bool dtdContent_any(dtdContent x); /* */
c_bool dtdContent_seq(dtdContent x, dtdContent* x1, dtdContent* x2); /* */
c_bool dtdContent_pref(dtdContent x, GLS_Tok* x1); /* */
c_bool dtdContent_none(dtdContent x); /* */
c_bool dtdContent_nam(dtdContent x, dtdXName* x1, dtdROpr* x2); /* */
c_bool dtdContent_rexp(dtdContent x, dtdContent* x1, dtdROpr* x2); /* */
/* --------------------------------- ROpr --------------------------------- */
c_bool dtdROpr_qry(dtdROpr x); /* */
c_bool dtdROpr_plus(dtdROpr x); /* */
c_bool dtdROpr_nul(dtdROpr x); /* */
c_bool dtdROpr_star(dtdROpr x); /* */
/* -------------------------------- XName --------------------------------- */
c_bool dtdXName_elm(dtdXName x); /* */
c_bool dtdXName_none(dtdXName x); /* */
c_bool dtdXName_key(dtdXName x, GLS_Tok* x1); /* */
c_bool dtdXName_ktyp(dtdXName x, dtdAType* x1); /* */
c_bool dtdXName_sys(dtdXName x); /* */
c_bool dtdXName_ide(dtdXName x, GLS_Tok* x1); /* */
c_bool dtdXName_req(dtdXName x); /* */
c_bool dtdXName_alst(dtdXName x); /* */
c_bool dtdXName_nmtk(dtdXName x, GLS_Tok* x1); /* */
c_bool dtdXName_fix(dtdXName x); /* */
c_bool dtdXName_any(dtdXName x); /* */
c_bool dtdXName_pub(dtdXName x); /* */
c_bool dtdXName_ndat(dtdXName x); /* */
c_bool dtdXName_impl(dtdXName x); /* */
c_bool dtdXName_pref(dtdXName x, GLS_Tok* x1); /* */
c_bool dtdXName_inc(dtdXName x); /* */
c_bool dtdXName_pdat(dtdXName x); /* */
#ifdef __cplusplus
}
#endif
#endif
styx-2.0.1/incxml/xml_int.h 0000644 0001750 0001750 00000014402 12002551733 012556 0000000 0000000 /* ------------------------------------------------------------------------ */
/* */
/* [xml_int.h] Language Interface */
/* */
/* ------------------------------------------------------------------------ */
/* File generated by 'ctoh'. Don't change manually. */
#ifndef xml_int_INCL
#define xml_int_INCL
#include "ptm.h"
#include "gls.h"
#ifdef __cplusplus
extern "C" {
#endif
/* --------------------- symbol objects - init & quit --------------------- */
void xml_initSymbols(); /* */
void xml_quitSymbols(); /* */
/* -------------------------- Types & Constants --------------------------- */
AbstractType( xml );
AbstractType( xmlXDoc );
AbstractType( xmlXDecl );
AbstractType( xmlWhite );
AbstractType( xmlEDecl );
AbstractType( xmlEBody );
AbstractType( xmlAttr );
AbstractType( xmlCDecl );
/* --------------------------- Access to Tokens --------------------------- */
c_bool Txml_DCharRef(GLS_Tok x); /* */
c_bool Txml_HCharRef(GLS_Tok x); /* */
c_bool Txml_ERef(GLS_Tok x); /* */
c_bool Txml_PERef(GLS_Tok x); /* */
c_bool Txml_Nmtoken(GLS_Tok x); /* */
c_bool Txml_XMLDecl(GLS_Tok x); /* */
c_bool Txml_PI(GLS_Tok x); /* */
c_bool Txml_CDSect(GLS_Tok x); /* */
c_bool Txml_XMLOpr(GLS_Tok x); /* */
c_bool Txml_Name(GLS_Tok x); /* */
c_bool Txml_dtdEmbed(GLS_Tok x); /* */
c_bool Txml_DTDStart(GLS_Tok x); /* */
c_bool Txml_Literal(GLS_Tok x); /* */
c_bool Txml_CharData(GLS_Tok x); /* */
c_bool Txml_Empty(GLS_Tok x); /* */
c_bool Txml_Comment(GLS_Tok x); /* */
c_bool Txml__other_(GLS_Tok x); /* */
/* --------------------------- Access to Terms ---------------------------- */
c_bool xml_xml(PT_Term x, xml* x1); /* */
c_bool xml_XDoc(PT_Term x, xmlXDoc* x1); /* */
c_bool xml_XDecl(PT_Term x, xmlXDecl* x1); /* */
c_bool xml_White(PT_Term x, xmlWhite* x1); /* */
c_bool xml_EDecl(PT_Term x, xmlEDecl* x1); /* */
c_bool xml_EBody(PT_Term x, xmlEBody* x1); /* */
c_bool xml_Attr(PT_Term x, xmlAttr* x1); /* */
c_bool xml_CDecl(PT_Term x, xmlCDecl* x1); /* */
/* --------------------------------- xml ---------------------------------- */
c_bool xml_Start_XDoc(xml x, xmlXDoc* x1)
#define xml_Start_0 xml_Start_XDoc
;
/* --------------------------------- XDoc --------------------------------- */
c_bool xmlXDoc_dfn(xmlXDoc x, xmlXDecl* x1, GLS_Lst(xmlCDecl)* x2); /* */
/* -------------------------------- XDecl --------------------------------- */
c_bool xmlXDecl_nul(xmlXDecl x); /* */
c_bool xmlXDecl_dfn(xmlXDecl x, GLS_Tok* x1); /* */
/* -------------------------------- White --------------------------------- */
c_bool xmlWhite_spc(xmlWhite x, GLS_Tok* x1); /* */
c_bool xmlWhite_nul(xmlWhite x); /* */
/* -------------------------------- EDecl --------------------------------- */
c_bool xmlEDecl_dfn(xmlEDecl x, GLS_Tok* x1, GLS_Lst(xmlAttr)* x2,
xmlEBody* x3)
;
/* -------------------------------- EBody --------------------------------- */
c_bool xmlEBody_nul(xmlEBody x); /* */
c_bool xmlEBody_dfn(xmlEBody x, GLS_Lst(xmlCDecl)* x1, GLS_Tok* x2,
xmlWhite* x3)
;
/* --------------------------------- Attr --------------------------------- */
c_bool xmlAttr_dfn(xmlAttr x, xmlWhite* x1, GLS_Tok* x2,
xmlWhite* x3, xmlWhite* x4,
GLS_Tok* x5)
;
c_bool xmlAttr_spc(xmlAttr x, xmlWhite* x1); /* */
/* -------------------------------- CDecl --------------------------------- */
c_bool xmlCDecl_nmtk(xmlCDecl x, GLS_Tok* x1); /* */
c_bool xmlCDecl_cref(xmlCDecl x, GLS_Tok* x1); /* */
c_bool xmlCDecl_href(xmlCDecl x, GLS_Tok* x1); /* */
c_bool xmlCDecl_xopr(xmlCDecl x, GLS_Tok* x1); /* */
c_bool xmlCDecl_etg1(xmlCDecl x); /* */
c_bool xmlCDecl_elm(xmlCDecl x, xmlEDecl* x1); /* */
c_bool xmlCDecl_etg0(xmlCDecl x); /* */
c_bool xmlCDecl_pi(xmlCDecl x, GLS_Tok* x1); /* */
c_bool xmlCDecl_xcom(xmlCDecl x, GLS_Tok* x1); /* */
c_bool xmlCDecl_sect(xmlCDecl x, GLS_Tok* x1); /* */
c_bool xmlCDecl_spc(xmlCDecl x, xmlWhite* x1); /* */
c_bool xmlCDecl_name(xmlCDecl x, GLS_Tok* x1); /* */
c_bool xmlCDecl_else(xmlCDecl x, GLS_Tok* x1); /* */
c_bool xmlCDecl_eref(xmlCDecl x, GLS_Tok* x1); /* */
c_bool xmlCDecl_typ(xmlCDecl x, GLS_Tok* x1, GLS_Tok* x2); /* */
c_bool xmlCDecl_pref(xmlCDecl x, GLS_Tok* x1); /* */
c_bool xmlCDecl_data(xmlCDecl x, GLS_Tok* x1); /* */
c_bool xmlCDecl_eq(xmlCDecl x); /* */
c_bool xmlCDecl_lit(xmlCDecl x, GLS_Tok* x1); /* */
#ifdef __cplusplus
}
#endif
#endif
styx-2.0.1/incxml/Makefile.am 0000664 0001750 0001750 00000000327 07634642277 013015 0000000 0000000 ## Process this file with automake to create incxml/Makefile.in
include_HEADERS = dtd_int.h dtd_lim.h dtd_pim.h xml_int.h xml_lim.h xml_pim.h xmllit_lim.h xml_test_cim.h xml_base.h
EXTRA_DIST = $(srcdir)/xml_io.h
styx-2.0.1/incxml/Makefile.in 0000644 0001750 0001750 00000034254 12116751125 013012 0000000 0000000 # Makefile.in generated by automake 1.11.6 from Makefile.am.
# @configure_input@
# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
# Foundation, Inc.
# This Makefile.in is free software; the Free Software Foundation
# gives unlimited permission to copy and/or distribute it,
# with or without modifications, as long as this notice is preserved.
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
# PARTICULAR PURPOSE.
@SET_MAKE@
VPATH = @srcdir@
am__make_dryrun = \
{ \
am__dry=no; \
case $$MAKEFLAGS in \
*\\[\ \ ]*) \
echo 'am--echo: ; @echo "AM" OK' | $(MAKE) -f - 2>/dev/null \
| grep '^AM OK$$' >/dev/null || am__dry=yes;; \
*) \
for am__flg in $$MAKEFLAGS; do \
case $$am__flg in \
*=*|--*) ;; \
*n*) am__dry=yes; break;; \
esac; \
done;; \
esac; \
test $$am__dry = yes; \
}
pkgdatadir = $(datadir)/@PACKAGE@
pkgincludedir = $(includedir)/@PACKAGE@
pkglibdir = $(libdir)/@PACKAGE@
pkglibexecdir = $(libexecdir)/@PACKAGE@
am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd
install_sh_DATA = $(install_sh) -c -m 644
install_sh_PROGRAM = $(install_sh) -c
install_sh_SCRIPT = $(install_sh) -c
INSTALL_HEADER = $(INSTALL_DATA)
transform = $(program_transform_name)
NORMAL_INSTALL = :
PRE_INSTALL = :
POST_INSTALL = :
NORMAL_UNINSTALL = :
PRE_UNINSTALL = :
POST_UNINSTALL = :
build_triplet = @build@
host_triplet = @host@
subdir = incxml
DIST_COMMON = $(include_HEADERS) $(srcdir)/Makefile.am \
$(srcdir)/Makefile.in
ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
am__aclocal_m4_deps = $(top_srcdir)/configure.in
am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
$(ACLOCAL_M4)
mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs
CONFIG_HEADER = $(top_builddir)/config.h
CONFIG_CLEAN_FILES =
CONFIG_CLEAN_VPATH_FILES =
SOURCES =
DIST_SOURCES =
am__can_run_installinfo = \
case $$AM_UPDATE_INFO_DIR in \
n|no|NO) false;; \
*) (install-info --version) >/dev/null 2>&1;; \
esac
am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`;
am__vpath_adj = case $$p in \
$(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \
*) f=$$p;; \
esac;
am__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;
am__install_max = 40
am__nobase_strip_setup = \
srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*|]/\\\\&/g'`
am__nobase_strip = \
for p in $$list; do echo "$$p"; done | sed -e "s|$$srcdirstrip/||"
am__nobase_list = $(am__nobase_strip_setup); \
for p in $$list; do echo "$$p $$p"; done | \
sed "s| $$srcdirstrip/| |;"' / .*\//!s/ .*/ ./; s,\( .*\)/[^/]*$$,\1,' | \
$(AWK) 'BEGIN { files["."] = "" } { files[$$2] = files[$$2] " " $$1; \
if (++n[$$2] == $(am__install_max)) \
{ print $$2, files[$$2]; n[$$2] = 0; files[$$2] = "" } } \
END { for (dir in files) print dir, files[dir] }'
am__base_list = \
sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \
sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g'
am__uninstall_files_from_dir = { \
test -z "$$files" \
|| { test ! -d "$$dir" && test ! -f "$$dir" && test ! -r "$$dir"; } \
|| { echo " ( cd '$$dir' && rm -f" $$files ")"; \
$(am__cd) "$$dir" && rm -f $$files; }; \
}
am__installdirs = "$(DESTDIR)$(includedir)"
HEADERS = $(include_HEADERS)
ETAGS = etags
CTAGS = ctags
DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
ACLOCAL = @ACLOCAL@
AMTAR = @AMTAR@
AR = @AR@
AUTOCONF = @AUTOCONF@
AUTOHEADER = @AUTOHEADER@
AUTOMAKE = @AUTOMAKE@
AWK = @AWK@
CC = @CC@
CCDEPMODE = @CCDEPMODE@
CFLAGS = @CFLAGS@
CPP = @CPP@
CPPFLAGS = @CPPFLAGS@
CXX = @CXX@
CXXCPP = @CXXCPP@
CXXDEPMODE = @CXXDEPMODE@
CXXFLAGS = @CXXFLAGS@
CYGPATH_W = @CYGPATH_W@
DEFS = @DEFS@
DEPDIR = @DEPDIR@
DLLTOOL = @DLLTOOL@
DSYMUTIL = @DSYMUTIL@
DUMPBIN = @DUMPBIN@
ECHO_C = @ECHO_C@
ECHO_N = @ECHO_N@
ECHO_T = @ECHO_T@
EGREP = @EGREP@
EXEEXT = @EXEEXT@
FGREP = @FGREP@
GREP = @GREP@
INSTALL = @INSTALL@
INSTALL_DATA = @INSTALL_DATA@
INSTALL_PROGRAM = @INSTALL_PROGRAM@
INSTALL_SCRIPT = @INSTALL_SCRIPT@
INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
LD = @LD@
LDFLAGS = @LDFLAGS@
LIBOBJS = @LIBOBJS@
LIBS = @LIBS@
LIBTOOL = @LIBTOOL@
LIPO = @LIPO@
LN_S = @LN_S@
LTLIBOBJS = @LTLIBOBJS@
MAKEINFO = @MAKEINFO@
MANIFEST_TOOL = @MANIFEST_TOOL@
MKDIR_P = @MKDIR_P@
NM = @NM@
NMEDIT = @NMEDIT@
OBJDUMP = @OBJDUMP@
OBJEXT = @OBJEXT@
OTOOL = @OTOOL@
OTOOL64 = @OTOOL64@
PACKAGE = @PACKAGE@
PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
PACKAGE_NAME = @PACKAGE_NAME@
PACKAGE_STRING = @PACKAGE_STRING@
PACKAGE_TARNAME = @PACKAGE_TARNAME@
PACKAGE_URL = @PACKAGE_URL@
PACKAGE_VERSION = @PACKAGE_VERSION@
PATH_SEPARATOR = @PATH_SEPARATOR@
RANLIB = @RANLIB@
SED = @SED@
SET_MAKE = @SET_MAKE@
SHELL = @SHELL@
STRIP = @STRIP@
VERSION = @VERSION@
abs_builddir = @abs_builddir@
abs_srcdir = @abs_srcdir@
abs_top_builddir = @abs_top_builddir@
abs_top_srcdir = @abs_top_srcdir@
ac_ct_AR = @ac_ct_AR@
ac_ct_CC = @ac_ct_CC@
ac_ct_CXX = @ac_ct_CXX@
ac_ct_DUMPBIN = @ac_ct_DUMPBIN@
am__include = @am__include@
am__leading_dot = @am__leading_dot@
am__quote = @am__quote@
am__tar = @am__tar@
am__untar = @am__untar@
bindir = @bindir@
build = @build@
build_alias = @build_alias@
build_cpu = @build_cpu@
build_os = @build_os@
build_vendor = @build_vendor@
builddir = @builddir@
datadir = @datadir@
datarootdir = @datarootdir@
docdir = @docdir@
dvidir = @dvidir@
exec_prefix = @exec_prefix@
host = @host@
host_alias = @host_alias@
host_cpu = @host_cpu@
host_os = @host_os@
host_vendor = @host_vendor@
htmldir = @htmldir@
includedir = @includedir@
infodir = @infodir@
install_sh = @install_sh@
libdir = @libdir@
libexecdir = @libexecdir@
localedir = @localedir@
localstatedir = @localstatedir@
mandir = @mandir@
mkdir_p = @mkdir_p@
oldincludedir = @oldincludedir@
pdfdir = @pdfdir@
prefix = @prefix@
program_transform_name = @program_transform_name@
psdir = @psdir@
sampledir = @sampledir@
sbindir = @sbindir@
sgmldir = @sgmldir@
sharedstatedir = @sharedstatedir@
srcdir = @srcdir@
sysconfdir = @sysconfdir@
target_alias = @target_alias@
top_build_prefix = @top_build_prefix@
top_builddir = @top_builddir@
top_srcdir = @top_srcdir@
include_HEADERS = dtd_int.h dtd_lim.h dtd_pim.h xml_int.h xml_lim.h xml_pim.h xmllit_lim.h xml_test_cim.h xml_base.h
EXTRA_DIST = $(srcdir)/xml_io.h
all: all-am
.SUFFIXES:
$(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps)
@for dep in $?; do \
case '$(am__configure_deps)' in \
*$$dep*) \
( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \
&& { if test -f $@; then exit 0; else break; fi; }; \
exit 1;; \
esac; \
done; \
echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign incxml/Makefile'; \
$(am__cd) $(top_srcdir) && \
$(AUTOMAKE) --foreign incxml/Makefile
.PRECIOUS: Makefile
Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status
@case '$?' in \
*config.status*) \
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \
*) \
echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \
cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \
esac;
$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
$(top_srcdir)/configure: $(am__configure_deps)
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
$(ACLOCAL_M4): $(am__aclocal_m4_deps)
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
$(am__aclocal_m4_deps):
mostlyclean-libtool:
-rm -f *.lo
clean-libtool:
-rm -rf .libs _libs
install-includeHEADERS: $(include_HEADERS)
@$(NORMAL_INSTALL)
@list='$(include_HEADERS)'; test -n "$(includedir)" || list=; \
if test -n "$$list"; then \
echo " $(MKDIR_P) '$(DESTDIR)$(includedir)'"; \
$(MKDIR_P) "$(DESTDIR)$(includedir)" || exit 1; \
fi; \
for p in $$list; do \
if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
echo "$$d$$p"; \
done | $(am__base_list) | \
while read files; do \
echo " $(INSTALL_HEADER) $$files '$(DESTDIR)$(includedir)'"; \
$(INSTALL_HEADER) $$files "$(DESTDIR)$(includedir)" || exit $$?; \
done
uninstall-includeHEADERS:
@$(NORMAL_UNINSTALL)
@list='$(include_HEADERS)'; test -n "$(includedir)" || list=; \
files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \
dir='$(DESTDIR)$(includedir)'; $(am__uninstall_files_from_dir)
ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
unique=`for i in $$list; do \
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
done | \
$(AWK) '{ files[$$0] = 1; nonempty = 1; } \
END { if (nonempty) { for (i in files) print i; }; }'`; \
mkid -fID $$unique
tags: TAGS
TAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \
$(TAGS_FILES) $(LISP)
set x; \
here=`pwd`; \
list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
unique=`for i in $$list; do \
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
done | \
$(AWK) '{ files[$$0] = 1; nonempty = 1; } \
END { if (nonempty) { for (i in files) print i; }; }'`; \
shift; \
if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \
test -n "$$unique" || unique=$$empty_fix; \
if test $$# -gt 0; then \
$(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
"$$@" $$unique; \
else \
$(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
$$unique; \
fi; \
fi
ctags: CTAGS
CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \
$(TAGS_FILES) $(LISP)
list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
unique=`for i in $$list; do \
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
done | \
$(AWK) '{ files[$$0] = 1; nonempty = 1; } \
END { if (nonempty) { for (i in files) print i; }; }'`; \
test -z "$(CTAGS_ARGS)$$unique" \
|| $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \
$$unique
GTAGS:
here=`$(am__cd) $(top_builddir) && pwd` \
&& $(am__cd) $(top_srcdir) \
&& gtags -i $(GTAGS_ARGS) "$$here"
distclean-tags:
-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
distdir: $(DISTFILES)
@srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
list='$(DISTFILES)'; \
dist_files=`for file in $$list; do echo $$file; done | \
sed -e "s|^$$srcdirstrip/||;t" \
-e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \
case $$dist_files in \
*/*) $(MKDIR_P) `echo "$$dist_files" | \
sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \
sort -u` ;; \
esac; \
for file in $$dist_files; do \
if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \
if test -d $$d/$$file; then \
dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \
if test -d "$(distdir)/$$file"; then \
find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
fi; \
if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \
cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \
find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
fi; \
cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \
else \
test -f "$(distdir)/$$file" \
|| cp -p $$d/$$file "$(distdir)/$$file" \
|| exit 1; \
fi; \
done
check-am: all-am
check: check-am
all-am: Makefile $(HEADERS)
installdirs:
for dir in "$(DESTDIR)$(includedir)"; do \
test -z "$$dir" || $(MKDIR_P) "$$dir"; \
done
install: install-am
install-exec: install-exec-am
install-data: install-data-am
uninstall: uninstall-am
install-am: all-am
@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
installcheck: installcheck-am
install-strip:
if test -z '$(STRIP)'; then \
$(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
install; \
else \
$(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \
fi
mostlyclean-generic:
clean-generic:
distclean-generic:
-test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES)
-test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES)
maintainer-clean-generic:
@echo "This command is intended for maintainers to use"
@echo "it deletes files that may require special tools to rebuild."
clean: clean-am
clean-am: clean-generic clean-libtool mostlyclean-am
distclean: distclean-am
-rm -f Makefile
distclean-am: clean-am distclean-generic distclean-tags
dvi: dvi-am
dvi-am:
html: html-am
html-am:
info: info-am
info-am:
install-data-am: install-includeHEADERS
install-dvi: install-dvi-am
install-dvi-am:
install-exec-am:
install-html: install-html-am
install-html-am:
install-info: install-info-am
install-info-am:
install-man:
install-pdf: install-pdf-am
install-pdf-am:
install-ps: install-ps-am
install-ps-am:
installcheck-am:
maintainer-clean: maintainer-clean-am
-rm -f Makefile
maintainer-clean-am: distclean-am maintainer-clean-generic
mostlyclean: mostlyclean-am
mostlyclean-am: mostlyclean-generic mostlyclean-libtool
pdf: pdf-am
pdf-am:
ps: ps-am
ps-am:
uninstall-am: uninstall-includeHEADERS
.MAKE: install-am install-strip
.PHONY: CTAGS GTAGS all all-am check check-am clean clean-generic \
clean-libtool ctags distclean distclean-generic \
distclean-libtool distclean-tags distdir dvi dvi-am html \
html-am info info-am install install-am install-data \
install-data-am install-dvi install-dvi-am install-exec \
install-exec-am install-html install-html-am \
install-includeHEADERS install-info install-info-am \
install-man install-pdf install-pdf-am install-ps \
install-ps-am install-strip installcheck installcheck-am \
installdirs maintainer-clean maintainer-clean-generic \
mostlyclean mostlyclean-generic mostlyclean-libtool pdf pdf-am \
ps ps-am tags uninstall uninstall-am uninstall-includeHEADERS
# Tell versions [3.59,3.63) of GNU make to not export all variables.
# Otherwise a system limit (for SysV at least) may be exceeded.
.NOEXPORT:
styx-2.0.1/mkinstalldirs 0000674 0001750 0001750 00000001334 06653706056 012266 0000000 0000000 #! /bin/sh
# mkinstalldirs --- make directory hierarchy
# Author: Noah Friedman
# Created: 1993-05-16
# Public domain
# $Id: mkinstalldirs,v 1.1.1.1 1999/01/27 20:59:10 manns Exp $
errstatus=0
for file
do
set fnord `echo ":$file" | sed -ne 's/^:\//#/;s/^://;s/\// /g;s/^#/\//;p'`
shift
pathcomp=
for d
do
pathcomp="$pathcomp$d"
case "$pathcomp" in
-* ) pathcomp=./$pathcomp ;;
esac
if test ! -d "$pathcomp"; then
echo "mkdir $pathcomp" 1>&2
mkdir "$pathcomp" || lasterr=$?
if test ! -d "$pathcomp"; then
errstatus=$lasterr
fi
fi
pathcomp="$pathcomp/"
done
done
exit $errstatus
# mkinstalldirs ends here
styx-2.0.1/bootstrap 0000775 0001750 0001750 00000000332 11274030142 011377 0000000 0000000 #! /bin/sh -ex
case $1 in
-v|--verbose) verbose=--verbose ;;
esac
aclocal-1.11 ${verbose}
libtoolize --force --copy
autoheader ${verbose}
automake-1.11 --foreign --add-missing --copy ${verbose}
autoconf ${verbose}
styx-2.0.1/pat/ 0000755 0001750 0001750 00000000000 12116751140 010304 5 0000000 0000000 styx-2.0.1/pat/pcmddoc_us.htm 0000666 0001750 0001750 00000005247 10103204662 013066 0000000 0000000 HPAT
\a
ä
\u
ü
\o
ö
\A
Ä
\U
Ü
\O
Ö
\s
ß
| &parid; | &partyp; | &doltxt;
| &parid; | &partyp; | &parval; | &doltxt;
Arguments
| Name | Type | Semantic
|
Options
An option will be specified as follows: -<Name>=<Value>
A flag is toggled that way: -<Name>
The default value will be applied when the option wasn't specified.
| Name | Type | Default value | Semantic
|
Environment
An environment variable will be specified as follows: -<Name>=<Value>
The default value will be applied when no environment variable was specified.
| Name | Type | Default value | Semantic
|
&doctxt;
&pgmid;
&pgmid;
&pgmid; Command description
contents
&pgmidlay; &doltxt;
&doctxt;
&argsec;
&optsec;
&envsec;
styx-2.0.1/pat/pcmdbook.xml 0000666 0001750 0001750 00000005071 10103204632 012544 0000000 0000000 HPAT
&parid;
&partyp;
&doltxt;
&parid;
&partyp;
&parval;
&doltxt;
Arguments
| Name | Type | Semantic
|
Options
An option will be specified as follows: -<Name>=<Value>
| Name | Type | Default value | Semantic
|
Environment
An environment variable will be specified as follows: -<Name>=<Value>
&doctxt;
&pgmid;
&pgmid;
&pgmid; Command description
&pgmidlay; &doltxt;
&doctxt;
&argsec;
&optsec;
&envsec;
styx-2.0.1/pat/tstydoc_us.htm 0000666 0001750 0001750 00000005124 10176731016 013150 0000000 0000000 HPAT
<
<
>
>
| | | | |
| | | | |
| | | | |
&grpcom; |
|---|
&optgrpcom;
&prdsec;
&optgrpcom;
&prdsec;
| &dfncat; | &dfnid; &dfnopt; | :: | &mbrsec; &dfncom; |
| | | | | &mbrsec; &dfncom; |
&mbrid;
&mbrid;
&mbrid;
&mbrid;
&cfgid; Language Reference
contents
&cfgid; Language Reference
Regular Grammar ( legend )
Context-free Grammar ( legend )
&botcom;
styx-2.0.1/pat/Makefile.am 0000664 0001750 0001750 00000000312 07572371713 012274 0000000 0000000 ## Process this file with automake to generate pat/Makefile.in
patdir = $(sampledir)/pat
pat_DATA = lstydoc_us.htm pcmdbook.xml pcmddoc_us.htm rstydoc_us.htm tstydoc_us.htm
EXTRA_DIST = $(pat_DATA)
styx-2.0.1/pat/lstydoc_us.htm 0000666 0001750 0001750 00000016556 10157065343 013155 0000000 0000000
lstydoc
Legend of the Regular Grammar
The regular grammar defines the basic language elements i.e. tokens as
certain classes of character sequences like numbers, identifiers, operators
and strings.
Each rule defining such a class of character
sequences has the following structure:
<Class Type>
<
[Member group :] Class Identifier [![+|-] Next group to activate]>
:: <Regular Expression>
We distinguish six types of classes:
-
let
Helper class, used to define the more complex tokens
They didn't belong to the language definition.
-
com
Comments
They didn't belong to the language definition.
-
tok
Tokens
They represent the regular grammar of the language definition.
-
ign
Character sequences which should be ignored i.e. skipped by the scanner
They didn't belong to the language definition.
-
ind
(De)indent tokens
Indent and dedent events will be forwarded to the parser.
Otherwise these character sequences will be skipped by the scanner.
-
lan
Embedded language tokens
These are special token classes which has been introduced in order to
integrate embedded languages.
A regular expression spezifies
the character sequences belonging to the class. Such a description usually
consists of the following elements and operators:
-
Expression1 Expression2 ... ExpressionN
Concatenation of partial expressions
-
Expression1 | Expression2 | ... | ExpressionN
Union of partial expressions ( alternatives )
-
Expression1 - Expression2 - ... - ExpressionN
Difference of partial expressions
-
[ Expression ]
Optional partial expression
-
{ Expression } or Expression *
Iteration of a partial expression ( 0 .. )
-
Expression +
Iteration of a partial expression ( 1 .. )
-
Expression N
Limited iteration of a partial expression ( N-times )
-
Expression Minimum , Maximum
Limited iteration of a partial expression ( min .. max )
-
Expression Minimum ,
Limited iteration of a partial expression ( min .. )
-
( Expression )
Combination of a partial expression ( subexpression )
-
Expression / 'QuotientCharacterset' or "QuotientSequence"
quotient expression
-
< LeftParanthesis > InnerExpression < RightParanthesis >
non-regular dyck expression
-
<= PatternPrefix > 'PatternCharacterset' < PatternSuffix >
start pattern expression
-
<? PatternPrefix > Pattern token identifier < PatternSuffix >
end pattern expression
-
Class identifier
Abreviation for the corresponding regular expression
-
"String"
Literal: string / character sequence
-
'Characterset'
Literal: characterset ( 1 .. )
Case ignore character classes
can be spezified with an [I]
behind the class identifier.
Legend of the Context-free Grammar
The syntax rules are described in
EBNF ( Extended Backus-Naur-Form ).
A startsymbol must exist for each source file type. That means the syntax
within each file has to be conform to the corresponding start rule.
The other are internal helper rules.
Each rule
is structured as follows: <Rule Type: start or let>
<Rule Identifier> :: <EBNF-konform Expression>
An EBNF-konform expression defines a part
of the language syntax. It consists of a set of alternative productions i.e.
partial expressions, separated by the character '|'.
A production can be spezified with the help of the following elements and operators:
-
Expression1 Expression2 ... ExpressionN
Concatenation of partial expressions
-
Expression1 | Expression2 | ... | ExpressionN
Union of partial expressions ( alternatives )
-
[ Expression ]
Optional partial expression
-
{ Expression }
Iteration of a partial expression ( 0 .. )
-
Expression +
Iteration of a partial expression ( 1 .. )
-
( Expression )
Combination of a partial expression ( subexpression )
-
Token Identifier
... from the regular grammar
-
Rule Identifier
... from the context-free grammar
-
Keyword
Constant string / character sequence
-
[other]
Special keyword denoting the
character sequences from the set 'Sigma* \ Tokenset'
styx-2.0.1/pat/Makefile.in 0000644 0001750 0001750 00000030423 12116751125 012276 0000000 0000000 # Makefile.in generated by automake 1.11.6 from Makefile.am.
# @configure_input@
# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
# Foundation, Inc.
# This Makefile.in is free software; the Free Software Foundation
# gives unlimited permission to copy and/or distribute it,
# with or without modifications, as long as this notice is preserved.
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
# PARTICULAR PURPOSE.
@SET_MAKE@
VPATH = @srcdir@
am__make_dryrun = \
{ \
am__dry=no; \
case $$MAKEFLAGS in \
*\\[\ \ ]*) \
echo 'am--echo: ; @echo "AM" OK' | $(MAKE) -f - 2>/dev/null \
| grep '^AM OK$$' >/dev/null || am__dry=yes;; \
*) \
for am__flg in $$MAKEFLAGS; do \
case $$am__flg in \
*=*|--*) ;; \
*n*) am__dry=yes; break;; \
esac; \
done;; \
esac; \
test $$am__dry = yes; \
}
pkgdatadir = $(datadir)/@PACKAGE@
pkgincludedir = $(includedir)/@PACKAGE@
pkglibdir = $(libdir)/@PACKAGE@
pkglibexecdir = $(libexecdir)/@PACKAGE@
am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd
install_sh_DATA = $(install_sh) -c -m 644
install_sh_PROGRAM = $(install_sh) -c
install_sh_SCRIPT = $(install_sh) -c
INSTALL_HEADER = $(INSTALL_DATA)
transform = $(program_transform_name)
NORMAL_INSTALL = :
PRE_INSTALL = :
POST_INSTALL = :
NORMAL_UNINSTALL = :
PRE_UNINSTALL = :
POST_UNINSTALL = :
build_triplet = @build@
host_triplet = @host@
subdir = pat
DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
am__aclocal_m4_deps = $(top_srcdir)/configure.in
am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
$(ACLOCAL_M4)
mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs
CONFIG_HEADER = $(top_builddir)/config.h
CONFIG_CLEAN_FILES =
CONFIG_CLEAN_VPATH_FILES =
SOURCES =
DIST_SOURCES =
am__can_run_installinfo = \
case $$AM_UPDATE_INFO_DIR in \
n|no|NO) false;; \
*) (install-info --version) >/dev/null 2>&1;; \
esac
am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`;
am__vpath_adj = case $$p in \
$(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \
*) f=$$p;; \
esac;
am__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;
am__install_max = 40
am__nobase_strip_setup = \
srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*|]/\\\\&/g'`
am__nobase_strip = \
for p in $$list; do echo "$$p"; done | sed -e "s|$$srcdirstrip/||"
am__nobase_list = $(am__nobase_strip_setup); \
for p in $$list; do echo "$$p $$p"; done | \
sed "s| $$srcdirstrip/| |;"' / .*\//!s/ .*/ ./; s,\( .*\)/[^/]*$$,\1,' | \
$(AWK) 'BEGIN { files["."] = "" } { files[$$2] = files[$$2] " " $$1; \
if (++n[$$2] == $(am__install_max)) \
{ print $$2, files[$$2]; n[$$2] = 0; files[$$2] = "" } } \
END { for (dir in files) print dir, files[dir] }'
am__base_list = \
sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \
sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g'
am__uninstall_files_from_dir = { \
test -z "$$files" \
|| { test ! -d "$$dir" && test ! -f "$$dir" && test ! -r "$$dir"; } \
|| { echo " ( cd '$$dir' && rm -f" $$files ")"; \
$(am__cd) "$$dir" && rm -f $$files; }; \
}
am__installdirs = "$(DESTDIR)$(patdir)"
DATA = $(pat_DATA)
DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
ACLOCAL = @ACLOCAL@
AMTAR = @AMTAR@
AR = @AR@
AUTOCONF = @AUTOCONF@
AUTOHEADER = @AUTOHEADER@
AUTOMAKE = @AUTOMAKE@
AWK = @AWK@
CC = @CC@
CCDEPMODE = @CCDEPMODE@
CFLAGS = @CFLAGS@
CPP = @CPP@
CPPFLAGS = @CPPFLAGS@
CXX = @CXX@
CXXCPP = @CXXCPP@
CXXDEPMODE = @CXXDEPMODE@
CXXFLAGS = @CXXFLAGS@
CYGPATH_W = @CYGPATH_W@
DEFS = @DEFS@
DEPDIR = @DEPDIR@
DLLTOOL = @DLLTOOL@
DSYMUTIL = @DSYMUTIL@
DUMPBIN = @DUMPBIN@
ECHO_C = @ECHO_C@
ECHO_N = @ECHO_N@
ECHO_T = @ECHO_T@
EGREP = @EGREP@
EXEEXT = @EXEEXT@
FGREP = @FGREP@
GREP = @GREP@
INSTALL = @INSTALL@
INSTALL_DATA = @INSTALL_DATA@
INSTALL_PROGRAM = @INSTALL_PROGRAM@
INSTALL_SCRIPT = @INSTALL_SCRIPT@
INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
LD = @LD@
LDFLAGS = @LDFLAGS@
LIBOBJS = @LIBOBJS@
LIBS = @LIBS@
LIBTOOL = @LIBTOOL@
LIPO = @LIPO@
LN_S = @LN_S@
LTLIBOBJS = @LTLIBOBJS@
MAKEINFO = @MAKEINFO@
MANIFEST_TOOL = @MANIFEST_TOOL@
MKDIR_P = @MKDIR_P@
NM = @NM@
NMEDIT = @NMEDIT@
OBJDUMP = @OBJDUMP@
OBJEXT = @OBJEXT@
OTOOL = @OTOOL@
OTOOL64 = @OTOOL64@
PACKAGE = @PACKAGE@
PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
PACKAGE_NAME = @PACKAGE_NAME@
PACKAGE_STRING = @PACKAGE_STRING@
PACKAGE_TARNAME = @PACKAGE_TARNAME@
PACKAGE_URL = @PACKAGE_URL@
PACKAGE_VERSION = @PACKAGE_VERSION@
PATH_SEPARATOR = @PATH_SEPARATOR@
RANLIB = @RANLIB@
SED = @SED@
SET_MAKE = @SET_MAKE@
SHELL = @SHELL@
STRIP = @STRIP@
VERSION = @VERSION@
abs_builddir = @abs_builddir@
abs_srcdir = @abs_srcdir@
abs_top_builddir = @abs_top_builddir@
abs_top_srcdir = @abs_top_srcdir@
ac_ct_AR = @ac_ct_AR@
ac_ct_CC = @ac_ct_CC@
ac_ct_CXX = @ac_ct_CXX@
ac_ct_DUMPBIN = @ac_ct_DUMPBIN@
am__include = @am__include@
am__leading_dot = @am__leading_dot@
am__quote = @am__quote@
am__tar = @am__tar@
am__untar = @am__untar@
bindir = @bindir@
build = @build@
build_alias = @build_alias@
build_cpu = @build_cpu@
build_os = @build_os@
build_vendor = @build_vendor@
builddir = @builddir@
datadir = @datadir@
datarootdir = @datarootdir@
docdir = @docdir@
dvidir = @dvidir@
exec_prefix = @exec_prefix@
host = @host@
host_alias = @host_alias@
host_cpu = @host_cpu@
host_os = @host_os@
host_vendor = @host_vendor@
htmldir = @htmldir@
includedir = @includedir@
infodir = @infodir@
install_sh = @install_sh@
libdir = @libdir@
libexecdir = @libexecdir@
localedir = @localedir@
localstatedir = @localstatedir@
mandir = @mandir@
mkdir_p = @mkdir_p@
oldincludedir = @oldincludedir@
pdfdir = @pdfdir@
prefix = @prefix@
program_transform_name = @program_transform_name@
psdir = @psdir@
sampledir = @sampledir@
sbindir = @sbindir@
sgmldir = @sgmldir@
sharedstatedir = @sharedstatedir@
srcdir = @srcdir@
sysconfdir = @sysconfdir@
target_alias = @target_alias@
top_build_prefix = @top_build_prefix@
top_builddir = @top_builddir@
top_srcdir = @top_srcdir@
patdir = $(sampledir)/pat
pat_DATA = lstydoc_us.htm pcmdbook.xml pcmddoc_us.htm rstydoc_us.htm tstydoc_us.htm
EXTRA_DIST = $(pat_DATA)
all: all-am
.SUFFIXES:
$(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps)
@for dep in $?; do \
case '$(am__configure_deps)' in \
*$$dep*) \
( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \
&& { if test -f $@; then exit 0; else break; fi; }; \
exit 1;; \
esac; \
done; \
echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign pat/Makefile'; \
$(am__cd) $(top_srcdir) && \
$(AUTOMAKE) --foreign pat/Makefile
.PRECIOUS: Makefile
Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status
@case '$?' in \
*config.status*) \
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \
*) \
echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \
cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \
esac;
$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
$(top_srcdir)/configure: $(am__configure_deps)
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
$(ACLOCAL_M4): $(am__aclocal_m4_deps)
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
$(am__aclocal_m4_deps):
mostlyclean-libtool:
-rm -f *.lo
clean-libtool:
-rm -rf .libs _libs
install-patDATA: $(pat_DATA)
@$(NORMAL_INSTALL)
@list='$(pat_DATA)'; test -n "$(patdir)" || list=; \
if test -n "$$list"; then \
echo " $(MKDIR_P) '$(DESTDIR)$(patdir)'"; \
$(MKDIR_P) "$(DESTDIR)$(patdir)" || exit 1; \
fi; \
for p in $$list; do \
if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
echo "$$d$$p"; \
done | $(am__base_list) | \
while read files; do \
echo " $(INSTALL_DATA) $$files '$(DESTDIR)$(patdir)'"; \
$(INSTALL_DATA) $$files "$(DESTDIR)$(patdir)" || exit $$?; \
done
uninstall-patDATA:
@$(NORMAL_UNINSTALL)
@list='$(pat_DATA)'; test -n "$(patdir)" || list=; \
files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \
dir='$(DESTDIR)$(patdir)'; $(am__uninstall_files_from_dir)
tags: TAGS
TAGS:
ctags: CTAGS
CTAGS:
distdir: $(DISTFILES)
@srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
list='$(DISTFILES)'; \
dist_files=`for file in $$list; do echo $$file; done | \
sed -e "s|^$$srcdirstrip/||;t" \
-e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \
case $$dist_files in \
*/*) $(MKDIR_P) `echo "$$dist_files" | \
sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \
sort -u` ;; \
esac; \
for file in $$dist_files; do \
if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \
if test -d $$d/$$file; then \
dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \
if test -d "$(distdir)/$$file"; then \
find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
fi; \
if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \
cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \
find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
fi; \
cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \
else \
test -f "$(distdir)/$$file" \
|| cp -p $$d/$$file "$(distdir)/$$file" \
|| exit 1; \
fi; \
done
check-am: all-am
check: check-am
all-am: Makefile $(DATA)
installdirs:
for dir in "$(DESTDIR)$(patdir)"; do \
test -z "$$dir" || $(MKDIR_P) "$$dir"; \
done
install: install-am
install-exec: install-exec-am
install-data: install-data-am
uninstall: uninstall-am
install-am: all-am
@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
installcheck: installcheck-am
install-strip:
if test -z '$(STRIP)'; then \
$(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
install; \
else \
$(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \
fi
mostlyclean-generic:
clean-generic:
distclean-generic:
-test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES)
-test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES)
maintainer-clean-generic:
@echo "This command is intended for maintainers to use"
@echo "it deletes files that may require special tools to rebuild."
clean: clean-am
clean-am: clean-generic clean-libtool mostlyclean-am
distclean: distclean-am
-rm -f Makefile
distclean-am: clean-am distclean-generic
dvi: dvi-am
dvi-am:
html: html-am
html-am:
info: info-am
info-am:
install-data-am: install-patDATA
install-dvi: install-dvi-am
install-dvi-am:
install-exec-am:
install-html: install-html-am
install-html-am:
install-info: install-info-am
install-info-am:
install-man:
install-pdf: install-pdf-am
install-pdf-am:
install-ps: install-ps-am
install-ps-am:
installcheck-am:
maintainer-clean: maintainer-clean-am
-rm -f Makefile
maintainer-clean-am: distclean-am maintainer-clean-generic
mostlyclean: mostlyclean-am
mostlyclean-am: mostlyclean-generic mostlyclean-libtool
pdf: pdf-am
pdf-am:
ps: ps-am
ps-am:
uninstall-am: uninstall-patDATA
.MAKE: install-am install-strip
.PHONY: all all-am check check-am clean clean-generic clean-libtool \
distclean distclean-generic distclean-libtool distdir dvi \
dvi-am html html-am info info-am install install-am \
install-data install-data-am install-dvi install-dvi-am \
install-exec install-exec-am install-html install-html-am \
install-info install-info-am install-man install-patDATA \
install-pdf install-pdf-am install-ps install-ps-am \
install-strip installcheck installcheck-am installdirs \
maintainer-clean maintainer-clean-generic mostlyclean \
mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \
uninstall uninstall-am uninstall-patDATA
# Tell versions [3.59,3.63) of GNU make to not export all variables.
# Otherwise a system limit (for SysV at least) may be exceeded.
.NOEXPORT:
styx-2.0.1/pat/rstydoc_us.htm 0000666 0001750 0001750 00000003357 07232025014 013145 0000000 0000000 HPAT
| | | |
| &dfncat; | &dfnid; &dfnopt; | :: | &mbrsec;
| | | | | &mbrsec;
<&hpat_key; &cfgid;_&dfnid;>
<&hpat_key; &cfgid;_&dfnid;>
&mbrid;
&mbrid;
&mbrid;
&cfgid; Language Reference
&cfgid; Language Reference
Regular Grammar
&tkmsec;
Context-free Grammar
&ntmsec;
styx-2.0.1/COPYING 0000664 0001750 0001750 00000043131 07443172661 010513 0000000 0000000 GNU GENERAL PUBLIC LICENSE
Version 2, June 1991
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The licenses for most software are designed to take away your
freedom to share and change it. By contrast, the GNU General Public
License is intended to guarantee your freedom to share and change free
software--to make sure the software is free for all its users. This
General Public License applies to most of the Free Software
Foundation's software and to any other program whose authors commit to
using it. (Some other Free Software Foundation software is covered by
the GNU Library General Public License instead.) You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
this service if you wish), that you receive source code or can get it
if you want it, that you can change the software or use pieces of it
in new free programs; and that you know you can do these things.
To protect your rights, we need to make restrictions that forbid
anyone to deny you these rights or to ask you to surrender the rights.
These restrictions translate to certain responsibilities for you if you
distribute copies of the software, or if you modify it.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must give the recipients all the rights that
you have. You must make sure that they, too, receive or can get the
source code. And you must show them these terms so they know their
rights.
We protect your rights with two steps: (1) copyright the software, and
(2) offer you this license which gives you legal permission to copy,
distribute and/or modify the software.
Also, for each author's protection and ours, we want to make certain
that everyone understands that there is no warranty for this free
software. If the software is modified by someone else and passed on, we
want its recipients to know that what they have is not the original, so
that any problems introduced by others will not reflect on the original
authors' reputations.
Finally, any free program is threatened constantly by software
patents. We wish to avoid the danger that redistributors of a free
program will individually obtain patent licenses, in effect making the
program proprietary. To prevent this, we have made it clear that any
patent must be licensed for everyone's free use or not licensed at all.
The precise terms and conditions for copying, distribution and
modification follow.
GNU GENERAL PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. This License applies to any program or other work which contains
a notice placed by the copyright holder saying it may be distributed
under the terms of this General Public License. The "Program", below,
refers to any such program or work, and a "work based on the Program"
means either the Program or any derivative work under copyright law:
that is to say, a work containing the Program or a portion of it,
either verbatim or with modifications and/or translated into another
language. (Hereinafter, translation is included without limitation in
the term "modification".) Each licensee is addressed as "you".
Activities other than copying, distribution and modification are not
covered by this License; they are outside its scope. The act of
running the Program is not restricted, and the output from the Program
is covered only if its contents constitute a work based on the
Program (independent of having been made by running the Program).
Whether that is true depends on what the Program does.
1. You may copy and distribute verbatim copies of the Program's
source code as you receive it, in any medium, provided that you
conspicuously and appropriately publish on each copy an appropriate
copyright notice and disclaimer of warranty; keep intact all the
notices that refer to this License and to the absence of any warranty;
and give any other recipients of the Program a copy of this License
along with the Program.
You may charge a fee for the physical act of transferring a copy, and
you may at your option offer warranty protection in exchange for a fee.
2. You may modify your copy or copies of the Program or any portion
of it, thus forming a work based on the Program, and copy and
distribute such modifications or work under the terms of Section 1
above, provided that you also meet all of these conditions:
a) You must cause the modified files to carry prominent notices
stating that you changed the files and the date of any change.
b) You must cause any work that you distribute or publish, that in
whole or in part contains or is derived from the Program or any
part thereof, to be licensed as a whole at no charge to all third
parties under the terms of this License.
c) If the modified program normally reads commands interactively
when run, you must cause it, when started running for such
interactive use in the most ordinary way, to print or display an
announcement including an appropriate copyright notice and a
notice that there is no warranty (or else, saying that you provide
a warranty) and that users may redistribute the program under
these conditions, and telling the user how to view a copy of this
License. (Exception: if the Program itself is interactive but
does not normally print such an announcement, your work based on
the Program is not required to print an announcement.)
These requirements apply to the modified work as a whole. If
identifiable sections of that work are not derived from the Program,
and can be reasonably considered independent and separate works in
themselves, then this License, and its terms, do not apply to those
sections when you distribute them as separate works. But when you
distribute the same sections as part of a whole which is a work based
on the Program, the distribution of the whole must be on the terms of
this License, whose permissions for other licensees extend to the
entire whole, and thus to each and every part regardless of who wrote it.
Thus, it is not the intent of this section to claim rights or contest
your rights to work written entirely by you; rather, the intent is to
exercise the right to control the distribution of derivative or
collective works based on the Program.
In addition, mere aggregation of another work not based on the Program
with the Program (or with a work based on the Program) on a volume of
a storage or distribution medium does not bring the other work under
the scope of this License.
3. You may copy and distribute the Program (or a work based on it,
under Section 2) in object code or executable form under the terms of
Sections 1 and 2 above provided that you also do one of the following:
a) Accompany it with the complete corresponding machine-readable
source code, which must be distributed under the terms of Sections
1 and 2 above on a medium customarily used for software interchange; or,
b) Accompany it with a written offer, valid for at least three
years, to give any third party, for a charge no more than your
cost of physically performing source distribution, a complete
machine-readable copy of the corresponding source code, to be
distributed under the terms of Sections 1 and 2 above on a medium
customarily used for software interchange; or,
c) Accompany it with the information you received as to the offer
to distribute corresponding source code. (This alternative is
allowed only for noncommercial distribution and only if you
received the program in object code or executable form with such
an offer, in accord with Subsection b above.)
The source code for a work means the preferred form of the work for
making modifications to it. For an executable work, complete source
code means all the source code for all modules it contains, plus any
associated interface definition files, plus the scripts used to
control compilation and installation of the executable. However, as a
special exception, the source code distributed need not include
anything that is normally distributed (in either source or binary
form) with the major components (compiler, kernel, and so on) of the
operating system on which the executable runs, unless that component
itself accompanies the executable.
If distribution of executable or object code is made by offering
access to copy from a designated place, then offering equivalent
access to copy the source code from the same place counts as
distribution of the source code, even though third parties are not
compelled to copy the source along with the object code.
4. You may not copy, modify, sublicense, or distribute the Program
except as expressly provided under this License. Any attempt
otherwise to copy, modify, sublicense or distribute the Program is
void, and will automatically terminate your rights under this License.
However, parties who have received copies, or rights, from you under
this License will not have their licenses terminated so long as such
parties remain in full compliance.
5. You are not required to accept this License, since you have not
signed it. However, nothing else grants you permission to modify or
distribute the Program or its derivative works. These actions are
prohibited by law if you do not accept this License. Therefore, by
modifying or distributing the Program (or any work based on the
Program), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying
the Program or works based on it.
6. Each time you redistribute the Program (or any work based on the
Program), the recipient automatically receives a license from the
original licensor to copy, distribute or modify the Program subject to
these terms and conditions. You may not impose any further
restrictions on the recipients' exercise of the rights granted herein.
You are not responsible for enforcing compliance by third parties to
this License.
7. If, as a consequence of a court judgment or allegation of patent
infringement or for any other reason (not limited to patent issues),
conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot
distribute so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you
may not distribute the Program at all. For example, if a patent
license would not permit royalty-free redistribution of the Program by
all those who receive copies directly or indirectly through you, then
the only way you could satisfy both it and this License would be to
refrain entirely from distribution of the Program.
If any portion of this section is held invalid or unenforceable under
any particular circumstance, the balance of the section is intended to
apply and the section as a whole is intended to apply in other
circumstances.
It is not the purpose of this section to induce you to infringe any
patents or other property right claims or to contest validity of any
such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system, which is
implemented by public license practices. Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.
This section is intended to make thoroughly clear what is believed to
be a consequence of the rest of this License.
8. If the distribution and/or use of the Program is restricted in
certain countries either by patents or by copyrighted interfaces, the
original copyright holder who places the Program under this License
may add an explicit geographical distribution limitation excluding
those countries, so that distribution is permitted only in or among
countries not thus excluded. In such case, this License incorporates
the limitation as if written in the body of this License.
9. The Free Software Foundation may publish revised and/or new versions
of the General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the Program
specifies a version number of this License which applies to it and "any
later version", you have the option of following the terms and conditions
either of that version or of any later version published by the Free
Software Foundation. If the Program does not specify a version number of
this License, you may choose any version ever published by the Free Software
Foundation.
10. If you wish to incorporate parts of the Program into other free
programs whose distribution conditions are different, write to the author
to ask for permission. For software which is copyrighted by the Free
Software Foundation, write to the Free Software Foundation; we sometimes
make exceptions for this. Our decision will be guided by the two goals
of preserving the free status of all derivatives of our free software and
of promoting the sharing and reuse of software generally.
NO WARRANTY
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
REPAIR OR CORRECTION.
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
POSSIBILITY OF SUCH DAMAGES.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
convey the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
Copyright (C)
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
Also add information on how to contact you by electronic and paper mail.
If the program is interactive, make it output a short notice like this
when it starts in an interactive mode:
Gnomovision version 69, Copyright (C) year name of author
Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, the commands you use may
be called something other than `show w' and `show c'; they could even be
mouse-clicks or menu items--whatever suits your program.
You should also get your employer (if you work as a programmer) or your
school, if any, to sign a "copyright disclaimer" for the program, if
necessary. Here is a sample; alter the names:
Yoyodyne, Inc., hereby disclaims all copyright interest in the program
`Gnomovision' (which makes passes at compilers) written by James Hacker.
, 1 April 1989
Ty Coon, President of Vice
This General Public License does not permit incorporating your program into
proprietary programs. If your program is a subroutine library, you may
consider it more useful to permit linking proprietary applications with the
library. If this is what you want to do, use the GNU Library General
Public License instead of this License.
styx-2.0.1/ChangeLog 0000644 0001750 0001750 00000026260 12116750201 011215 0000000 0000000 commit 3e98e44e7a23eec05d2279baed88d47f1b6ec904
Author: Heike Manns
Date: Sun Mar 10 01:09:51 2013 +0100
+
commit cbd9231cd2c775a9d00caf162574061bf419bb9f
Author: Heike Manns
Date: Sun Mar 10 01:00:43 2013 +0100
+ C++ runtime scanner and parser corrections regarding g++ 4.7
commit ca3fe241acd27222ffc17d1d6a8d4675ad1c54a7
Author: Heike Manns
Date: Sat Mar 9 23:24:55 2013 +0100
+
commit 3fbf7251c55f57f521493284a1e3a27eecc4fa2e
Author: Heike Manns
Date: Sat Mar 9 19:15:45 2013 +0100
+ extended exclusive scan group definition
+ lua syntax adjusted w.r.t long strings and comments
commit f7f74a788d78401401d085882352a0e75287c12a
Author: Heike Manns
Date: Sat Mar 9 15:05:38 2013 +0100
+
commit ea55d6c1a2be94642ef26a0c4583c3fc774029cf
Author: Heike Manns
Date: Sun Mar 3 16:18:15 2013 +0100
+
commit 844ad5e4833c111afc2e38cb5c95f46f6de36f65
Author: Heike Manns
Date: Sun Mar 3 15:36:59 2013 +0100
+ example documentation complemented
commit 87709a71648a946bc8c70304ac6273b0ee02bae5
Author: Heike Manns
Date: Sun Mar 3 15:32:32 2013 +0100
+ bootstrap 2.0.1
commit 640d3a3f823ae8959d903ff6f5db222daa071733
Author: Heike Manns
Date: Sun Mar 3 15:24:51 2013 +0100
ChangeLog 2.0.1
commit ff753b2c8b7421711637add9dffc744306266887
Author: Heike Manns
Date: Sun Mar 3 14:44:20 2013 +0100
+
commit be7cf46a1f8263af38a26c4e4153b77bef3f24af
Author: Heike Manns
Date: Sun Mar 3 14:23:40 2013 +0100
+
commit f6f37382173513c5a78d18757753d935aa57ba45
Author: Heike Manns
Date: Sat Mar 2 17:38:47 2013 +0100
+
commit 09875dd3b65befc3c9eca4ad61f97834ebb563e9
Author: Heike Manns
Date: Sat Mar 2 17:25:31 2013 +0100
+
commit 289867111439f0b683bb6803cfee6bf12a63a789
Author: Heike Manns
Date: Sat Mar 2 16:52:25 2013 +0100
+adjusted the documentation according the last changes
commit a923b20039865029b4d0f148691a65dd825f8597
Author: Heike Manns
Date: Fri Mar 1 17:40:27 2013 +0100
+
commit b51de7e4f130ea5169a01c0167421d4eb25ad77d
Author: Heike Manns
Date: Fri Mar 1 17:35:55 2013 +0100
+ lua syntax modified w.r.t. abstract syntax and semantic
commit 9acfc6f4ea302a1b1ac364551b8ca0d6a0cc3db3
Author: Heike Manns
Date: Sun Feb 24 17:29:20 2013 +0100
+
commit 797bdd76d898a42f00410a406ba0806107125d19
Author: Heike Manns
Date: Sun Feb 24 17:21:35 2013 +0100
+
commit 43fa52ed39218ea1fabdd3d68b2423309dc1700a
Author: Heike Manns
Date: Sun Feb 24 17:13:07 2013 +0100
+
commit 0bf8b39217922524373b9647e64f8394f51d58a6
Author: Heike Manns
Date: Sun Feb 24 17:08:14 2013 +0100
+
commit 31ab717b6a001d523adc801c63d2bf452410fd5c
Author: Heike Manns
Date: Sun Feb 24 17:02:27 2013 +0100
+
commit 925c61c7fac26f52192a1555d887d45d7030b113
Author: Heike Manns
Date: Sun Feb 24 16:04:50 2013 +0100
+
commit ba5c6be038410c9a5b63dedd35cad09b6513437c
Author: Heike Manns
Date: Sun Feb 24 16:01:13 2013 +0100
+
commit 7691757afed9553349c899ae639bffaee457272a
Author: Heike Manns
Date: Sun Feb 24 15:59:03 2013 +0100
+
commit d78e13b9c21458a78d312ff3d3df71e68afe09e1
Author: Heike Manns
Date: Sun Feb 24 15:56:31 2013 +0100
+
commit d64771e746080af809270262354e4b0c473bdecb
Author: Heike Manns
Date: Sun Feb 24 15:50:55 2013 +0100
+
commit 6c8d1aa3da268272b339d44aa5fdfe7691f6cec3
Author: Heike Manns
Date: Sun Feb 24 15:47:26 2013 +0100
+ example08 added (dynamic token)
commit e976642b80be4811b710bd412aff817e43674717
Author: Heike Manns
Date: Sun Feb 24 15:17:37 2013 +0100
+
commit 04f2092e35eea53712f1650c61edd8f1dfa3c126
Author: Heike Manns
Date: Sun Feb 17 17:48:03 2013 +0100
+
commit cfe36363e3c05f7d2fe008eae97fe9472e5a2f82
Author: Heike Manns
Date: Sat Feb 16 17:32:27 2013 +0100
+ bugfix cons#, nil#
commit e2a7a8d3925cf5b827481fadc2205d0ced997ae3
Author: Heike Manns
Date: Sat Feb 16 16:56:28 2013 +0100
+
commit 0ff457c9dab173851f03aaf312ffba36f0f97e88
Author: Heike Manns
Date: Sat Feb 16 15:08:47 2013 +0100
+
commit ab4503e48807ff910b180d0009bb578c6ecd4e9f
Author: Heike Manns
Date: Sat Feb 16 15:06:23 2013 +0100
+
commit 97437829f56dab8975753dd2c1d42873af3071ba
Author: Heike Manns
Date: Sat Feb 16 14:24:46 2013 +0100
+
commit fe39f2639aeb8a1a07f2d1e1b42691fade098988
Author: Heike Manns
Date: Sat Feb 16 14:19:33 2013 +0100
+ added syntax definition for lua (>= 5.1)
commit 2f6439c6089a067170597847464b5f0eadf897f6
Author: Heike Manns
Date: Sat Feb 16 14:08:52 2013 +0100
+added dynamic tokens to handle context sensitive constructs like the C-typedef
commit 5e053d4cd333b3528a3e9cf3483fd45f36b6587d
Author: Heike Manns
Date: Fri Jul 20 16:02:11 2012 +0200
+ styx grammar extension in order to solve reduce reduce conflicts explicitely
commit 9226c80bd16f2198417bc9c2d9e80b69ebb02f1e
Author: Heike Manns
Date: Sat Mar 3 14:50:19 2012 +0100
+ justification of pattern token matching
commit 7c448fcb9c366f4289efaf70a21191c74c51012c
Author: Heike Manns
Date: Sat Mar 26 18:06:04 2011 +0100
+
commit b5a442401cf555ab37f5d53260402c06595479f2
Author: Heike Manns
Date: Sat Mar 26 17:15:23 2011 +0100
+
commit cfe9b341c898b3ae58601bba9bc093bcb3e67c88
Author: Heike Manns
Date: Sat Mar 26 15:39:20 2011 +0100
+Patch Makefile.am (gcc-4.5 linker error)
commit abf1db87a93ec00b591f253150e351ec25dd99ec
Author: Heike Manns
Date: Mon Jan 31 15:10:10 2011 +0100
+ corrections regarding ebnf notation
commit 063b6803dc7855fdd4f384c582682b231003e4de
Author: Heike Manns
Date: Fri Nov 26 18:00:38 2010 +0100
+
commit 33a45061e7e5244396748605f57bf0db70ceaf77
Author: Heike Manns
Date: Fri Nov 26 17:21:51 2010 +0100
+ further adjustments for vs studio 2008
commit d8aafc73aee7786cf27e44766c2509d89216dc46
Author: Heike Manns
Date: Fri Nov 26 16:59:30 2010 +0100
+ workaround for odd problem (lst1, ...)
commit aaac17ae450b404a61c0de0050e2a007d3093cd6
Author: Heike Manns
Date: Sun Nov 21 16:01:39 2010 +0100
+
commit 976a2ed5905bb32ccf7d2088d4269ee89821895c
Author: Heike Manns
Date: Sun Nov 21 15:58:41 2010 +0100
+
commit eeddfccf38ed1785fe9ec7fcfa7a4c74d8b7e458
Author: Heike Manns
Date: Sun Nov 21 15:45:33 2010 +0100
+ grammar examples for languages json and php 5.2 added
commit 0b3f750c54e0fdf81bee56cdaef4e6c9dfacef4d
Author: Heike Manns
Date: Sun Nov 7 18:14:57 2010 +0100
+ ebnf feature documentation
commit d19c91f2edc968a90253046cc39e1b2de949e9f6
Author: Heike Manns
Date: Sun Nov 7 15:30:35 2010 +0100
+ pl0.sty modified. list productions replaced with the corresponding EBNF list notations.
commit 7fb5bec9a4c870eb62d6ce9802436d6cd813a33f
Author: Heike Manns
Date: Fri Oct 29 15:23:19 2010 +0200
+typo and spelling corrections
commit 9a899a8612fc32ecc18072fcae963352e4c05446
Author: Heike Manns
Date: Sun Oct 24 18:33:03 2010 +0200
+ set package version
commit 5acaab2acb2aab6eaca5fd2c53226f4cf26ade7f
Author: Heike Manns
Date: Sun Oct 24 17:52:11 2010 +0200
+
commit bdf135b84df50808db4d0691360e84936f0e9249
Author: Heike Manns
Date: Sun Oct 24 17:48:53 2010 +0200
+ obsolete source files removed
commit 728ab0fb550cbdba3e5062ddf1a1d80e18ea3f17
Author: Heike Manns
Date: Sun Oct 24 17:07:35 2010 +0200
+ introduces EBNF rules for lists and options to styx
+ as well as a version number in order to ensure backward compatibility
commit c323df0eb5775844343c4873c5e894c28c1cacda
Author: Heike Manns
Date: Sat Mar 13 17:52:31 2010 +0100
+ php5.2 grammar modifications
commit 456f0ac9138176e09592f0e0b819b57c9bca3fca
Author: Heike Manns
Date: Sun Feb 7 18:26:57 2010 +0100
+ iconv output buffer size corrected
commit 04aa31ab1ef45a64aff444adb02d63c9f75990ae
Author: Heike Manns
Date: Sun Feb 7 17:35:19 2010 +0100
+ documentation typos corrected
commit 075e675e85464625e96a8a2d5b045bb159b88fcd
Author: Heike Manns
Date: Tue Nov 3 14:41:05 2009 +0100
+changelog update
commit aaeb2d3793a0940e39fdb171ee3b4ef8b9696dfb
Author: Heike Manns
Date: Tue Nov 3 14:30:47 2009 +0100
+ upgrade to automake-1.11
commit 4d2089f51d2a604450ab11089e3f75d36138815a
Author: Heike Manns
Date: Mon Aug 10 17:10:33 2009 +0200
+ method documentation adjusted
commit 5ecb3bf9d1e496b5c9e899e81b265fe6ab67d45d
Author: Heike Manns
Date: Sun Jul 26 15:40:28 2009 +0200
+ ChangeLog 1.7.6
commit eadc729e1e29e20f33720cae741fbd9971f77467
Author: Heike Manns
Date: Sun Jul 26 15:34:37 2009 +0200
+ Doxyfile for c# runtime scanner added
commit 3e3095a96ebc9f1181b12bafe06b3f05612096c2
Author: Heike Manns
Date: Sun Jul 26 15:32:18 2009 +0200
+ c# runtime scanner integrated
commit 0da510760622874adf6f704457070aa7a135a7b2
Author: Heike Manns
Date: Sun Jul 19 17:03:19 2009 +0200
+ local getline function in ctoh.c renamed due to a conflict with the getline function in stdio.h
+ adjust version number
commit 83089deae287c2ddd5c471ed456ed0bd6db39ba0
Author: Heike Manns
Date: Sun Jul 19 16:25:05 2009 +0200
some adjustments due to new versions of gcc and vs.net
commit e82bd03db7ce62b156109557fcd23520ce4b52ef
Author: Heike Manns
Date: Sun Mar 29 16:46:29 2009 +0200
+ minor bugfix StyxScanner.C/evalInclude: add constraint "missing include path"
+ comment justification
commit 199b12fbddbd184140b9a6b1ccd94ff05c71e163
Author: root
Date: Sun Feb 22 17:37:20 2009 +0100
+adjustments with respect to warnings of gcc 4.x
commit 5fff9d8503b2828993f456bfa89c1f72596f2cc6
Author: Heike Manns
Date: Sat Apr 5 14:17:24 2008 +0200
+
commit 25134c92fcc0bd2c2c7b5b17cb1e7397dd0f8acb
Author: Heike Manns
Date: Sat Apr 5 14:14:36 2008 +0200
+initial git-release
styx-2.0.1/configure 0000755 0001750 0001750 00002141622 12116751125 011362 0000000 0000000 #! /bin/sh
# Guess values for system-dependent variables and create Makefiles.
# Generated by GNU Autoconf 2.69.
#
#
# Copyright (C) 1992-1996, 1998-2012 Free Software Foundation, Inc.
#
#
# This configure script is free software; the Free Software Foundation
# gives unlimited permission to copy, distribute and modify it.
## -------------------- ##
## M4sh Initialization. ##
## -------------------- ##
# Be more Bourne compatible
DUALCASE=1; export DUALCASE # for MKS sh
if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
emulate sh
NULLCMD=:
# Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
# is contrary to our usage. Disable this feature.
alias -g '${1+"$@"}'='"$@"'
setopt NO_GLOB_SUBST
else
case `(set -o) 2>/dev/null` in #(
*posix*) :
set -o posix ;; #(
*) :
;;
esac
fi
as_nl='
'
export as_nl
# Printing a long string crashes Solaris 7 /usr/bin/printf.
as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
# Prefer a ksh shell builtin over an external printf program on Solaris,
# but without wasting forks for bash or zsh.
if test -z "$BASH_VERSION$ZSH_VERSION" \
&& (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
as_echo='print -r --'
as_echo_n='print -rn --'
elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
as_echo='printf %s\n'
as_echo_n='printf %s'
else
if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
as_echo_n='/usr/ucb/echo -n'
else
as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
as_echo_n_body='eval
arg=$1;
case $arg in #(
*"$as_nl"*)
expr "X$arg" : "X\\(.*\\)$as_nl";
arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
esac;
expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
'
export as_echo_n_body
as_echo_n='sh -c $as_echo_n_body as_echo'
fi
export as_echo_body
as_echo='sh -c $as_echo_body as_echo'
fi
# The user is always right.
if test "${PATH_SEPARATOR+set}" != set; then
PATH_SEPARATOR=:
(PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
(PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
PATH_SEPARATOR=';'
}
fi
# IFS
# We need space, tab and new line, in precisely that order. Quoting is
# there to prevent editors from complaining about space-tab.
# (If _AS_PATH_WALK were called with IFS unset, it would disable word
# splitting by setting IFS to empty value.)
IFS=" "" $as_nl"
# Find who we are. Look in the path if we contain no directory separator.
as_myself=
case $0 in #((
*[\\/]* ) as_myself=$0 ;;
*) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
for as_dir in $PATH
do
IFS=$as_save_IFS
test -z "$as_dir" && as_dir=.
test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
done
IFS=$as_save_IFS
;;
esac
# We did not find ourselves, most probably we were run as `sh COMMAND'
# in which case we are not to be found in the path.
if test "x$as_myself" = x; then
as_myself=$0
fi
if test ! -f "$as_myself"; then
$as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
exit 1
fi
# Unset variables that we do not need and which cause bugs (e.g. in
# pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1"
# suppresses any "Segmentation fault" message there. '((' could
# trigger a bug in pdksh 5.2.14.
for as_var in BASH_ENV ENV MAIL MAILPATH
do eval test x\${$as_var+set} = xset \
&& ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
done
PS1='$ '
PS2='> '
PS4='+ '
# NLS nuisances.
LC_ALL=C
export LC_ALL
LANGUAGE=C
export LANGUAGE
# CDPATH.
(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
# Use a proper internal environment variable to ensure we don't fall
# into an infinite loop, continuously re-executing ourselves.
if test x"${_as_can_reexec}" != xno && test "x$CONFIG_SHELL" != x; then
_as_can_reexec=no; export _as_can_reexec;
# We cannot yet assume a decent shell, so we have to provide a
# neutralization value for shells without unset; and this also
# works around shells that cannot unset nonexistent variables.
# Preserve -v and -x to the replacement shell.
BASH_ENV=/dev/null
ENV=/dev/null
(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV
case $- in # ((((
*v*x* | *x*v* ) as_opts=-vx ;;
*v* ) as_opts=-v ;;
*x* ) as_opts=-x ;;
* ) as_opts= ;;
esac
exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"}
# Admittedly, this is quite paranoid, since all the known shells bail
# out after a failed `exec'.
$as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2
as_fn_exit 255
fi
# We don't want this to propagate to other subprocesses.
{ _as_can_reexec=; unset _as_can_reexec;}
if test "x$CONFIG_SHELL" = x; then
as_bourne_compatible="if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then :
emulate sh
NULLCMD=:
# Pre-4.2 versions of Zsh do word splitting on \${1+\"\$@\"}, which
# is contrary to our usage. Disable this feature.
alias -g '\${1+\"\$@\"}'='\"\$@\"'
setopt NO_GLOB_SUBST
else
case \`(set -o) 2>/dev/null\` in #(
*posix*) :
set -o posix ;; #(
*) :
;;
esac
fi
"
as_required="as_fn_return () { (exit \$1); }
as_fn_success () { as_fn_return 0; }
as_fn_failure () { as_fn_return 1; }
as_fn_ret_success () { return 0; }
as_fn_ret_failure () { return 1; }
exitcode=0
as_fn_success || { exitcode=1; echo as_fn_success failed.; }
as_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; }
as_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; }
as_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; }
if ( set x; as_fn_ret_success y && test x = \"\$1\" ); then :
else
exitcode=1; echo positional parameters were not saved.
fi
test x\$exitcode = x0 || exit 1
test -x / || exit 1"
as_suggested=" as_lineno_1=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_1a=\$LINENO
as_lineno_2=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_2a=\$LINENO
eval 'test \"x\$as_lineno_1'\$as_run'\" != \"x\$as_lineno_2'\$as_run'\" &&
test \"x\`expr \$as_lineno_1'\$as_run' + 1\`\" = \"x\$as_lineno_2'\$as_run'\"' || exit 1
test -n \"\${ZSH_VERSION+set}\${BASH_VERSION+set}\" || (
ECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
ECHO=\$ECHO\$ECHO\$ECHO\$ECHO\$ECHO
ECHO=\$ECHO\$ECHO\$ECHO\$ECHO\$ECHO\$ECHO
PATH=/empty FPATH=/empty; export PATH FPATH
test \"X\`printf %s \$ECHO\`\" = \"X\$ECHO\" \\
|| test \"X\`print -r -- \$ECHO\`\" = \"X\$ECHO\" ) || exit 1
test \$(( 1 + 1 )) = 2 || exit 1"
if (eval "$as_required") 2>/dev/null; then :
as_have_required=yes
else
as_have_required=no
fi
if test x$as_have_required = xyes && (eval "$as_suggested") 2>/dev/null; then :
else
as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
as_found=false
for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH
do
IFS=$as_save_IFS
test -z "$as_dir" && as_dir=.
as_found=:
case $as_dir in #(
/*)
for as_base in sh bash ksh sh5; do
# Try only shells that exist, to save several forks.
as_shell=$as_dir/$as_base
if { test -f "$as_shell" || test -f "$as_shell.exe"; } &&
{ $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$as_shell"; } 2>/dev/null; then :
CONFIG_SHELL=$as_shell as_have_required=yes
if { $as_echo "$as_bourne_compatible""$as_suggested" | as_run=a "$as_shell"; } 2>/dev/null; then :
break 2
fi
fi
done;;
esac
as_found=false
done
$as_found || { if { test -f "$SHELL" || test -f "$SHELL.exe"; } &&
{ $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$SHELL"; } 2>/dev/null; then :
CONFIG_SHELL=$SHELL as_have_required=yes
fi; }
IFS=$as_save_IFS
if test "x$CONFIG_SHELL" != x; then :
export CONFIG_SHELL
# We cannot yet assume a decent shell, so we have to provide a
# neutralization value for shells without unset; and this also
# works around shells that cannot unset nonexistent variables.
# Preserve -v and -x to the replacement shell.
BASH_ENV=/dev/null
ENV=/dev/null
(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV
case $- in # ((((
*v*x* | *x*v* ) as_opts=-vx ;;
*v* ) as_opts=-v ;;
*x* ) as_opts=-x ;;
* ) as_opts= ;;
esac
exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"}
# Admittedly, this is quite paranoid, since all the known shells bail
# out after a failed `exec'.
$as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2
exit 255
fi
if test x$as_have_required = xno; then :
$as_echo "$0: This script requires a shell more modern than all"
$as_echo "$0: the shells that I found on your system."
if test x${ZSH_VERSION+set} = xset ; then
$as_echo "$0: In particular, zsh $ZSH_VERSION has bugs and should"
$as_echo "$0: be upgraded to zsh 4.3.4 or later."
else
$as_echo "$0: Please tell bug-autoconf@gnu.org about your system,
$0: including any error possibly output before this
$0: message. Then install a modern shell, or manually run
$0: the script under such a shell if you do have one."
fi
exit 1
fi
fi
fi
SHELL=${CONFIG_SHELL-/bin/sh}
export SHELL
# Unset more variables known to interfere with behavior of common tools.
CLICOLOR_FORCE= GREP_OPTIONS=
unset CLICOLOR_FORCE GREP_OPTIONS
## --------------------- ##
## M4sh Shell Functions. ##
## --------------------- ##
# as_fn_unset VAR
# ---------------
# Portably unset VAR.
as_fn_unset ()
{
{ eval $1=; unset $1;}
}
as_unset=as_fn_unset
# as_fn_set_status STATUS
# -----------------------
# Set $? to STATUS, without forking.
as_fn_set_status ()
{
return $1
} # as_fn_set_status
# as_fn_exit STATUS
# -----------------
# Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
as_fn_exit ()
{
set +e
as_fn_set_status $1
exit $1
} # as_fn_exit
# as_fn_mkdir_p
# -------------
# Create "$as_dir" as a directory, including parents if necessary.
as_fn_mkdir_p ()
{
case $as_dir in #(
-*) as_dir=./$as_dir;;
esac
test -d "$as_dir" || eval $as_mkdir_p || {
as_dirs=
while :; do
case $as_dir in #(
*\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
*) as_qdir=$as_dir;;
esac
as_dirs="'$as_qdir' $as_dirs"
as_dir=`$as_dirname -- "$as_dir" ||
$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
X"$as_dir" : 'X\(//\)[^/]' \| \
X"$as_dir" : 'X\(//\)$' \| \
X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
$as_echo X"$as_dir" |
sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
s//\1/
q
}
/^X\(\/\/\)[^/].*/{
s//\1/
q
}
/^X\(\/\/\)$/{
s//\1/
q
}
/^X\(\/\).*/{
s//\1/
q
}
s/.*/./; q'`
test -d "$as_dir" && break
done
test -z "$as_dirs" || eval "mkdir $as_dirs"
} || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
} # as_fn_mkdir_p
# as_fn_executable_p FILE
# -----------------------
# Test if FILE is an executable regular file.
as_fn_executable_p ()
{
test -f "$1" && test -x "$1"
} # as_fn_executable_p
# as_fn_append VAR VALUE
# ----------------------
# Append the text in VALUE to the end of the definition contained in VAR. Take
# advantage of any shell optimizations that allow amortized linear growth over
# repeated appends, instead of the typical quadratic growth present in naive
# implementations.
if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
eval 'as_fn_append ()
{
eval $1+=\$2
}'
else
as_fn_append ()
{
eval $1=\$$1\$2
}
fi # as_fn_append
# as_fn_arith ARG...
# ------------------
# Perform arithmetic evaluation on the ARGs, and store the result in the
# global $as_val. Take advantage of shells that can avoid forks. The arguments
# must be portable across $(()) and expr.
if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
eval 'as_fn_arith ()
{
as_val=$(( $* ))
}'
else
as_fn_arith ()
{
as_val=`expr "$@" || test $? -eq 1`
}
fi # as_fn_arith
# as_fn_error STATUS ERROR [LINENO LOG_FD]
# ----------------------------------------
# Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are
# provided, also output the error to LOG_FD, referencing LINENO. Then exit the
# script with STATUS, using 1 if that was 0.
as_fn_error ()
{
as_status=$1; test $as_status -eq 0 && as_status=1
if test "$4"; then
as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
$as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
fi
$as_echo "$as_me: error: $2" >&2
as_fn_exit $as_status
} # as_fn_error
if expr a : '\(a\)' >/dev/null 2>&1 &&
test "X`expr 00001 : '.*\(...\)'`" = X001; then
as_expr=expr
else
as_expr=false
fi
if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
as_basename=basename
else
as_basename=false
fi
if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
as_dirname=dirname
else
as_dirname=false
fi
as_me=`$as_basename -- "$0" ||
$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
X"$0" : 'X\(//\)$' \| \
X"$0" : 'X\(/\)' \| . 2>/dev/null ||
$as_echo X/"$0" |
sed '/^.*\/\([^/][^/]*\)\/*$/{
s//\1/
q
}
/^X\/\(\/\/\)$/{
s//\1/
q
}
/^X\/\(\/\).*/{
s//\1/
q
}
s/.*/./; q'`
# Avoid depending upon Character Ranges.
as_cr_letters='abcdefghijklmnopqrstuvwxyz'
as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
as_cr_Letters=$as_cr_letters$as_cr_LETTERS
as_cr_digits='0123456789'
as_cr_alnum=$as_cr_Letters$as_cr_digits
as_lineno_1=$LINENO as_lineno_1a=$LINENO
as_lineno_2=$LINENO as_lineno_2a=$LINENO
eval 'test "x$as_lineno_1'$as_run'" != "x$as_lineno_2'$as_run'" &&
test "x`expr $as_lineno_1'$as_run' + 1`" = "x$as_lineno_2'$as_run'"' || {
# Blame Lee E. McMahon (1931-1989) for sed's syntax. :-)
sed -n '
p
/[$]LINENO/=
' <$as_myself |
sed '
s/[$]LINENO.*/&-/
t lineno
b
:lineno
N
:loop
s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/
t loop
s/-\n.*//
' >$as_me.lineno &&
chmod +x "$as_me.lineno" ||
{ $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2; as_fn_exit 1; }
# If we had to re-execute with $CONFIG_SHELL, we're ensured to have
# already done that, so ensure we don't try to do so again and fall
# in an infinite loop. This has already happened in practice.
_as_can_reexec=no; export _as_can_reexec
# Don't try to exec as it changes $[0], causing all sort of problems
# (the dirname of $[0] is not the place where we might find the
# original and so on. Autoconf is especially sensitive to this).
. "./$as_me.lineno"
# Exit status is that of the last command.
exit
}
ECHO_C= ECHO_N= ECHO_T=
case `echo -n x` in #(((((
-n*)
case `echo 'xy\c'` in
*c*) ECHO_T=' ';; # ECHO_T is single tab character.
xy) ECHO_C='\c';;
*) echo `echo ksh88 bug on AIX 6.1` > /dev/null
ECHO_T=' ';;
esac;;
*)
ECHO_N='-n';;
esac
rm -f conf$$ conf$$.exe conf$$.file
if test -d conf$$.dir; then
rm -f conf$$.dir/conf$$.file
else
rm -f conf$$.dir
mkdir conf$$.dir 2>/dev/null
fi
if (echo >conf$$.file) 2>/dev/null; then
if ln -s conf$$.file conf$$ 2>/dev/null; then
as_ln_s='ln -s'
# ... but there are two gotchas:
# 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
# 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
# In both cases, we have to default to `cp -pR'.
ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
as_ln_s='cp -pR'
elif ln conf$$.file conf$$ 2>/dev/null; then
as_ln_s=ln
else
as_ln_s='cp -pR'
fi
else
as_ln_s='cp -pR'
fi
rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
rmdir conf$$.dir 2>/dev/null
if mkdir -p . 2>/dev/null; then
as_mkdir_p='mkdir -p "$as_dir"'
else
test -d ./-p && rmdir ./-p
as_mkdir_p=false
fi
as_test_x='test -x'
as_executable_p=as_fn_executable_p
# Sed expression to map a string onto a valid CPP name.
as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
# Sed expression to map a string onto a valid variable name.
as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
SHELL=${CONFIG_SHELL-/bin/sh}
test -n "$DJDIR" || exec 7<&0 &1
# Name of the host.
# hostname on some systems (SVR3.2, old GNU/Linux) returns a bogus exit status,
# so uname gets run too.
ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q`
#
# Initializations.
#
ac_default_prefix=/usr/local
ac_clean_files=
ac_config_libobj_dir=.
LIBOBJS=
cross_compiling=no
subdirs=
MFLAGS=
MAKEFLAGS=
# Identity of this package.
PACKAGE_NAME=
PACKAGE_TARNAME=
PACKAGE_VERSION=
PACKAGE_STRING=
PACKAGE_BUGREPORT=
PACKAGE_URL=
ac_unique_file="pgm/Makefile.in"
# Factoring default headers for most tests.
ac_includes_default="\
#include
#ifdef HAVE_SYS_TYPES_H
# include
#endif
#ifdef HAVE_SYS_STAT_H
# include
#endif
#ifdef STDC_HEADERS
# include
# include
#else
# ifdef HAVE_STDLIB_H
# include
# endif
#endif
#ifdef HAVE_STRING_H
# if !defined STDC_HEADERS && defined HAVE_MEMORY_H
# include
# endif
# include | | | | | | | | | |