Click here to Skip to main content
Click here to Skip to main content
 
Add your own
alternative version
Go to top

PXPerlWrap (PXPerl, reloaded)

, 3 Nov 2004
A comprehensive Perl embedding solution.
pxperldemo.zip
PXPerlDemo.dsp
PXPerlDemo.dsw
PXPerlDemo.suo
PERL_CORE
arpa
perl58.lib
PerlEz.lib
sys
Release
lib
auto
PerlIO
encoding
encoding.dll
scalar
scalar.dll
via
via.dll
Carp.pm
Exporter.pm
PerlIO
encoding.pm
scalar.pm
via
QuotedPrint.pm
via.pm
PerlIO.pm
strict.pm
Symbol.pm
THESE ARE REQUIRED LIBs
warnings.pm
XSLoader.pm
perl58.dll
PXPerlDemo.exe
res
perl.ico
perl2.ico
perl3.ico
perlsistent.pl
PXPerlDemo.ico
PXPerlDemo.manifest
PXPerlDemo.clw
PXPerlDemo.mak
pxperl_demo.zip
PXPerlDemo.mak
PXPerlDemo.dsp
PXPerlDemo.dsw
PXPerlDemo.suo
perl58.lib
PerlEz.lib
encoding.dll
scalar.dll
via.dll
Carp.pm
Exporter.pm
encoding.pm
scalar.pm
QuotedPrint.pm
via.pm
PerlIO.pm
strict.pm
Symbol.pm
THESE ARE REQUIRED LIBs
warnings.pm
XSLoader.pm
perl58.dll
PXPerlDemo.exe
perl.ico
perl2.ico
perl3.ico
perlsistent.pl
PXPerlDemo.ico
PXPerlDemo.manifest
PXPerlDemo.aps
PXPerlDemo.clw
PXPerlDemo.dep
PXPerlDemo.opt
PXPerlDemo.plg
/* !!!!!!!   DO NOT EDIT THIS FILE   !!!!!!!
   This file is built by regcomp.pl from regcomp.sym.
   Any changes made here will be lost!
*/

#define	END	0	/*    0 End of program. */
#define	SUCCEED	1	/*  0x1 Return from a subroutine, basically. */
#define	BOL	2	/*  0x2 Match "" at beginning of line. */
#define	MBOL	3	/*  0x3 Same, assuming multiline. */
#define	SBOL	4	/*  0x4 Same, assuming singleline. */
#define	EOS	5	/*  0x5 Match "" at end of string. */
#define	EOL	6	/*  0x6 Match "" at end of line. */
#define	MEOL	7	/*  0x7 Same, assuming multiline. */
#define	SEOL	8	/*  0x8 Same, assuming singleline. */
#define	BOUND	9	/*  0x9 Match "" at any word boundary */
#define	BOUNDL	10	/*  0xa Match "" at any word boundary */
#define	NBOUND	11	/*  0xb Match "" at any word non-boundary */
#define	NBOUNDL	12	/*  0xc Match "" at any word non-boundary */
#define	GPOS	13	/*  0xd Matches where last m//g left off. */
#define	REG_ANY	14	/*  0xe Match any one character (except newline). */
#define	SANY	15	/*  0xf Match any one character. */
#define	CANY	16	/* 0x10 Match any one byte. */
#define	ANYOF	17	/* 0x11 Match character in (or not in) this class. */
#define	ALNUM	18	/* 0x12 Match any alphanumeric character */
#define	ALNUML	19	/* 0x13 Match any alphanumeric char in locale */
#define	NALNUM	20	/* 0x14 Match any non-alphanumeric character */
#define	NALNUML	21	/* 0x15 Match any non-alphanumeric char in locale */
#define	SPACE	22	/* 0x16 Match any whitespace character */
#define	SPACEL	23	/* 0x17 Match any whitespace char in locale */
#define	NSPACE	24	/* 0x18 Match any non-whitespace character */
#define	NSPACEL	25	/* 0x19 Match any non-whitespace char in locale */
#define	DIGIT	26	/* 0x1a Match any numeric character */
#define	DIGITL	27	/* 0x1b Match any numeric character in locale */
#define	NDIGIT	28	/* 0x1c Match any non-numeric character */
#define	NDIGITL	29	/* 0x1d Match any non-numeric character in locale */
#define	CLUMP	30	/* 0x1e Match any combining character sequence */
#define	BRANCH	31	/* 0x1f Match this alternative, or the next... */
#define	BACK	32	/* 0x20 Match "", "next" ptr points backward. */
#define	EXACT	33	/* 0x21 Match this string (preceded by length). */
#define	EXACTF	34	/* 0x22 Match this string, folded (prec. by length). */
#define	EXACTFL	35	/* 0x23 Match this string, folded in locale (w/len). */
#define	NOTHING	36	/* 0x24 Match empty string. */
#define	TAIL	37	/* 0x25 Match empty string. Can jump here from outside. */
#define	STAR	38	/* 0x26 Match this (simple) thing 0 or more times. */
#define	PLUS	39	/* 0x27 Match this (simple) thing 1 or more times. */
#define	CURLY	40	/* 0x28 Match this simple thing {n,m} times. */
#define	CURLYN	41	/* 0x29 Match next-after-this simple thing  */
#define	CURLYM	42	/* 0x2a Match this medium-complex thing {n,m} times. */
#define	CURLYX	43	/* 0x2b Match this complex thing {n,m} times. */
#define	WHILEM	44	/* 0x2c Do curly processing and see if rest matches. */
#define	OPEN	45	/* 0x2d Mark this point in input as start of #n. */
#define	CLOSE	46	/* 0x2e Analogous to OPEN. */
#define	REF	47	/* 0x2f Match some already matched string */
#define	REFF	48	/* 0x30 Match already matched string, folded */
#define	REFFL	49	/* 0x31 Match already matched string, folded in loc. */
#define	IFMATCH	50	/* 0x32 Succeeds if the following matches. */
#define	UNLESSM	51	/* 0x33 Fails if the following matches. */
#define	SUSPEND	52	/* 0x34 "Independent" sub-RE. */
#define	IFTHEN	53	/* 0x35 Switch, should be preceeded by switcher . */
#define	GROUPP	54	/* 0x36 Whether the group matched. */
#define	LONGJMP	55	/* 0x37 Jump far away. */
#define	BRANCHJ	56	/* 0x38 BRANCH with long offset. */
#define	EVAL	57	/* 0x39 Execute some Perl code. */
#define	MINMOD	58	/* 0x3a Next operator is not greedy. */
#define	LOGICAL	59	/* 0x3b Next opcode should set the flag only. */
#define	RENUM	60	/* 0x3c Group with independently numbered parens. */
#define	OPTIMIZED	61	/* 0x3d Placeholder for dump. */

#ifndef DOINIT
EXTCONST U8 PL_regkind[];
#else
EXTCONST U8 PL_regkind[] = {
	END,		/* END */
	END,		/* SUCCEED */
	BOL,		/* BOL */
	BOL,		/* MBOL */
	BOL,		/* SBOL */
	EOL,		/* EOS */
	EOL,		/* EOL */
	EOL,		/* MEOL */
	EOL,		/* SEOL */
	BOUND,		/* BOUND */
	BOUND,		/* BOUNDL */
	NBOUND,		/* NBOUND */
	NBOUND,		/* NBOUNDL */
	GPOS,		/* GPOS */
	REG_ANY,		/* REG_ANY */
	REG_ANY,		/* SANY */
	REG_ANY,		/* CANY */
	ANYOF,		/* ANYOF */
	ALNUM,		/* ALNUM */
	ALNUM,		/* ALNUML */
	NALNUM,		/* NALNUM */
	NALNUM,		/* NALNUML */
	SPACE,		/* SPACE */
	SPACE,		/* SPACEL */
	NSPACE,		/* NSPACE */
	NSPACE,		/* NSPACEL */
	DIGIT,		/* DIGIT */
	DIGIT,		/* DIGITL */
	NDIGIT,		/* NDIGIT */
	NDIGIT,		/* NDIGITL */
	CLUMP,		/* CLUMP */
	BRANCH,		/* BRANCH */
	BACK,		/* BACK */
	EXACT,		/* EXACT */
	EXACT,		/* EXACTF */
	EXACT,		/* EXACTFL */
	NOTHING,		/* NOTHING */
	NOTHING,		/* TAIL */
	STAR,		/* STAR */
	PLUS,		/* PLUS */
	CURLY,		/* CURLY */
	CURLY,		/* CURLYN */
	CURLY,		/* CURLYM */
	CURLY,		/* CURLYX */
	WHILEM,		/* WHILEM */
	OPEN,		/* OPEN */
	CLOSE,		/* CLOSE */
	REF,		/* REF */
	REF,		/* REFF */
	REF,		/* REFFL */
	BRANCHJ,		/* IFMATCH */
	BRANCHJ,		/* UNLESSM */
	BRANCHJ,		/* SUSPEND */
	BRANCHJ,		/* IFTHEN */
	GROUPP,		/* GROUPP */
	LONGJMP,		/* LONGJMP */
	BRANCHJ,		/* BRANCHJ */
	EVAL,		/* EVAL */
	MINMOD,		/* MINMOD */
	LOGICAL,		/* LOGICAL */
	BRANCHJ,		/* RENUM */
	NOTHING,		/* OPTIMIZED */
};
#endif


#ifdef REG_COMP_C
static const U8 regarglen[] = {
	0,		/* END */
	0,		/* SUCCEED */
	0,		/* BOL */
	0,		/* MBOL */
	0,		/* SBOL */
	0,		/* EOS */
	0,		/* EOL */
	0,		/* MEOL */
	0,		/* SEOL */
	0,		/* BOUND */
	0,		/* BOUNDL */
	0,		/* NBOUND */
	0,		/* NBOUNDL */
	0,		/* GPOS */
	0,		/* REG_ANY */
	0,		/* SANY */
	0,		/* CANY */
	0,		/* ANYOF */
	0,		/* ALNUM */
	0,		/* ALNUML */
	0,		/* NALNUM */
	0,		/* NALNUML */
	0,		/* SPACE */
	0,		/* SPACEL */
	0,		/* NSPACE */
	0,		/* NSPACEL */
	0,		/* DIGIT */
	0,		/* DIGITL */
	0,		/* NDIGIT */
	0,		/* NDIGITL */
	0,		/* CLUMP */
	0,		/* BRANCH */
	0,		/* BACK */
	0,		/* EXACT */
	0,		/* EXACTF */
	0,		/* EXACTFL */
	0,		/* NOTHING */
	0,		/* TAIL */
	0,		/* STAR */
	0,		/* PLUS */
	EXTRA_SIZE(struct regnode_2),		/* CURLY */
	EXTRA_SIZE(struct regnode_2),		/* CURLYN */
	EXTRA_SIZE(struct regnode_2),		/* CURLYM */
	EXTRA_SIZE(struct regnode_2),		/* CURLYX */
	0,		/* WHILEM */
	EXTRA_SIZE(struct regnode_1),		/* OPEN */
	EXTRA_SIZE(struct regnode_1),		/* CLOSE */
	EXTRA_SIZE(struct regnode_1),		/* REF */
	EXTRA_SIZE(struct regnode_1),		/* REFF */
	EXTRA_SIZE(struct regnode_1),		/* REFFL */
	EXTRA_SIZE(struct regnode_1),		/* IFMATCH */
	EXTRA_SIZE(struct regnode_1),		/* UNLESSM */
	EXTRA_SIZE(struct regnode_1),		/* SUSPEND */
	EXTRA_SIZE(struct regnode_1),		/* IFTHEN */
	EXTRA_SIZE(struct regnode_1),		/* GROUPP */
	EXTRA_SIZE(struct regnode_1),		/* LONGJMP */
	EXTRA_SIZE(struct regnode_1),		/* BRANCHJ */
	EXTRA_SIZE(struct regnode_1),		/* EVAL */
	0,		/* MINMOD */
	0,		/* LOGICAL */
	EXTRA_SIZE(struct regnode_1),		/* RENUM */
	0,		/* OPTIMIZED */
};

static const char reg_off_by_arg[] = {
	0,		/* END */
	0,		/* SUCCEED */
	0,		/* BOL */
	0,		/* MBOL */
	0,		/* SBOL */
	0,		/* EOS */
	0,		/* EOL */
	0,		/* MEOL */
	0,		/* SEOL */
	0,		/* BOUND */
	0,		/* BOUNDL */
	0,		/* NBOUND */
	0,		/* NBOUNDL */
	0,		/* GPOS */
	0,		/* REG_ANY */
	0,		/* SANY */
	0,		/* CANY */
	0,		/* ANYOF */
	0,		/* ALNUM */
	0,		/* ALNUML */
	0,		/* NALNUM */
	0,		/* NALNUML */
	0,		/* SPACE */
	0,		/* SPACEL */
	0,		/* NSPACE */
	0,		/* NSPACEL */
	0,		/* DIGIT */
	0,		/* DIGITL */
	0,		/* NDIGIT */
	0,		/* NDIGITL */
	0,		/* CLUMP */
	0,		/* BRANCH */
	0,		/* BACK */
	0,		/* EXACT */
	0,		/* EXACTF */
	0,		/* EXACTFL */
	0,		/* NOTHING */
	0,		/* TAIL */
	0,		/* STAR */
	0,		/* PLUS */
	0,		/* CURLY */
	0,		/* CURLYN */
	0,		/* CURLYM */
	0,		/* CURLYX */
	0,		/* WHILEM */
	0,		/* OPEN */
	0,		/* CLOSE */
	0,		/* REF */
	0,		/* REFF */
	0,		/* REFFL */
	2,		/* IFMATCH */
	2,		/* UNLESSM */
	1,		/* SUSPEND */
	1,		/* IFTHEN */
	0,		/* GROUPP */
	1,		/* LONGJMP */
	1,		/* BRANCHJ */
	0,		/* EVAL */
	0,		/* MINMOD */
	0,		/* LOGICAL */
	1,		/* RENUM */
	0,		/* OPTIMIZED */
};

#ifdef DEBUGGING
static const char * const reg_name[] = {
	"END",		/*    0 */
	"SUCCEED",		/*  0x1 */
	"BOL",		/*  0x2 */
	"MBOL",		/*  0x3 */
	"SBOL",		/*  0x4 */
	"EOS",		/*  0x5 */
	"EOL",		/*  0x6 */
	"MEOL",		/*  0x7 */
	"SEOL",		/*  0x8 */
	"BOUND",		/*  0x9 */
	"BOUNDL",		/*  0xa */
	"NBOUND",		/*  0xb */
	"NBOUNDL",		/*  0xc */
	"GPOS",		/*  0xd */
	"REG_ANY",		/*  0xe */
	"SANY",		/*  0xf */
	"CANY",		/* 0x10 */
	"ANYOF",		/* 0x11 */
	"ALNUM",		/* 0x12 */
	"ALNUML",		/* 0x13 */
	"NALNUM",		/* 0x14 */
	"NALNUML",		/* 0x15 */
	"SPACE",		/* 0x16 */
	"SPACEL",		/* 0x17 */
	"NSPACE",		/* 0x18 */
	"NSPACEL",		/* 0x19 */
	"DIGIT",		/* 0x1a */
	"DIGITL",		/* 0x1b */
	"NDIGIT",		/* 0x1c */
	"NDIGITL",		/* 0x1d */
	"CLUMP",		/* 0x1e */
	"BRANCH",		/* 0x1f */
	"BACK",		/* 0x20 */
	"EXACT",		/* 0x21 */
	"EXACTF",		/* 0x22 */
	"EXACTFL",		/* 0x23 */
	"NOTHING",		/* 0x24 */
	"TAIL",		/* 0x25 */
	"STAR",		/* 0x26 */
	"PLUS",		/* 0x27 */
	"CURLY",		/* 0x28 */
	"CURLYN",		/* 0x29 */
	"CURLYM",		/* 0x2a */
	"CURLYX",		/* 0x2b */
	"WHILEM",		/* 0x2c */
	"OPEN",		/* 0x2d */
	"CLOSE",		/* 0x2e */
	"REF",		/* 0x2f */
	"REFF",		/* 0x30 */
	"REFFL",		/* 0x31 */
	"IFMATCH",		/* 0x32 */
	"UNLESSM",		/* 0x33 */
	"SUSPEND",		/* 0x34 */
	"IFTHEN",		/* 0x35 */
	"GROUPP",		/* 0x36 */
	"LONGJMP",		/* 0x37 */
	"BRANCHJ",		/* 0x38 */
	"EVAL",		/* 0x39 */
	"MINMOD",		/* 0x3a */
	"LOGICAL",		/* 0x3b */
	"RENUM",		/* 0x3c */
	"OPTIMIZED",		/* 0x3d */
};

static const int reg_num = 62;

#endif /* DEBUGGING */
#endif /* REG_COMP_C */

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.

License

This article has no explicit license attached to it but may contain usage terms in the article text or the download files themselves. If in doubt please contact the author via the discussion board below.

A list of licenses authors might use can be found here

Share

About the Author

PixiGreg
Software Developer
France France
Bouh

| Advertise | Privacy | Mobile
Web02 | 2.8.140916.1 | Last Updated 3 Nov 2004
Article Copyright 2003 by PixiGreg
Everything else Copyright © CodeProject, 1999-2014
Terms of Service
Layout: fixed | fluid