2007-05-02 01:07:00 +00:00
|
|
|
/*
|
2008-03-04 05:15:37 +00:00
|
|
|
* $Id: rex.h 116 2008-03-03 11:15:37Z baconevi $
|
2007-05-02 01:07:00 +00:00
|
|
|
*
|
|
|
|
* {License}
|
|
|
|
*/
|
|
|
|
|
2008-03-04 03:31:41 +00:00
|
|
|
#ifndef _ASE_CMN_REX_H_
|
|
|
|
#define _ASE_CMN_REX_H_
|
2007-05-02 01:07:00 +00:00
|
|
|
|
2008-03-04 03:31:41 +00:00
|
|
|
#include <ase/cmn/types.h>
|
|
|
|
#include <ase/cmn/macros.h>
|
2007-05-02 01:07:00 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Regular Esseression Syntax
|
|
|
|
* A regular expression is zero or more branches, separated by '|'.
|
|
|
|
* ......
|
|
|
|
* ......
|
|
|
|
*
|
|
|
|
* Compiled form of a regular expression:
|
|
|
|
*
|
|
|
|
* | expression |
|
|
|
|
* | header | branch | branch | branch |
|
|
|
|
* | nb | el | na | bl | cmd | arg | cmd | arg | na | bl | cmd | arg | na | bl | cmd |
|
|
|
|
*
|
|
|
|
* nb: the number of branches
|
|
|
|
* el: the length of a expression including the length of nb and el
|
|
|
|
* na: the number of atoms
|
|
|
|
* bl: the length of a branch including the length of na and bl
|
|
|
|
* cmd: The command and repetition info encoded together.
|
|
|
|
* Some commands require an argument to follow them but some other don't.
|
|
|
|
* It is encoded as follows:
|
|
|
|
*
|
|
|
|
* Subexpressions can be nested by having the command "GROUP"
|
|
|
|
* and a subexpression as its argument.
|
|
|
|
*
|
|
|
|
* Examples:
|
|
|
|
* a.c -> |1|6|5|ORD_CHAR(no bound)|a|ANY_CHAR(no bound)|ORD_CHAR(no bound)|c|
|
|
|
|
* ab|xy -> |2|10|4|ORD_CHAR(no bound)|a|ORD_CHAR(no bound)|b|4|ORD_CHAR(no bound)|x|ORD_CHAR(no bound)|y|
|
|
|
|
*/
|
|
|
|
|
2008-03-04 03:31:41 +00:00
|
|
|
#define ASE_REX_NA(code) (*(ase_size_t*)(code))
|
2007-05-02 01:07:00 +00:00
|
|
|
|
2008-03-04 03:31:41 +00:00
|
|
|
#define ASE_REX_LEN(code) \
|
2007-05-02 01:07:00 +00:00
|
|
|
(*(ase_size_t*)((ase_byte_t*)(code)+ASE_SIZEOF(ase_size_t)))
|
|
|
|
|
2008-03-04 03:31:41 +00:00
|
|
|
enum ase_rex_option_t
|
2007-05-02 01:07:00 +00:00
|
|
|
{
|
2008-03-04 03:31:41 +00:00
|
|
|
ASE_REX_IGNORECASE = (1 << 0)
|
|
|
|
};
|
|
|
|
|
|
|
|
enum ase_rex_errnum_t
|
|
|
|
{
|
|
|
|
ASE_REX_ENOERR = 0,
|
|
|
|
ASE_REX_ENOMEM,
|
|
|
|
ASE_REX_ERECUR, /* recursion too deep */
|
|
|
|
ASE_REX_ERPAREN, /* a right parenthesis is expected */
|
|
|
|
ASE_REX_ERBRACKET, /* a right bracket is expected */
|
|
|
|
ASE_REX_ERBRACE, /* a right brace is expected */
|
|
|
|
ASE_REX_EUNBALPAR, /* unbalanced parenthesis */
|
|
|
|
ASE_REX_ECOLON, /* a colon is expected */
|
|
|
|
ASE_REX_ECRANGE, /* invalid character range */
|
|
|
|
ASE_REX_ECCLASS, /* invalid character class */
|
|
|
|
ASE_REX_EBRANGE, /* invalid boundary range */
|
|
|
|
ASE_REX_EEND, /* unexpected end of the pattern */
|
|
|
|
ASE_REX_EGARBAGE /* garbage after the pattern */
|
2007-05-02 01:07:00 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
#ifdef __cplusplus
|
|
|
|
extern "C" {
|
|
|
|
#endif
|
|
|
|
|
2008-03-04 03:31:41 +00:00
|
|
|
void* ase_buildrex (
|
|
|
|
ase_mmgr_t* mmgr, ase_size_t depth,
|
|
|
|
const ase_char_t* ptn, ase_size_t len, int* errnum);
|
2007-05-02 01:07:00 +00:00
|
|
|
|
2008-03-04 03:31:41 +00:00
|
|
|
int ase_matchrex (
|
|
|
|
ase_mmgr_t* mmgr, ase_ccls_t* ccls, ase_size_t depth,
|
|
|
|
void* code, int option,
|
2007-05-02 01:07:00 +00:00
|
|
|
const ase_char_t* str, ase_size_t len,
|
|
|
|
const ase_char_t** match_ptr, ase_size_t* match_len, int* errnum);
|
|
|
|
|
2008-03-04 03:31:41 +00:00
|
|
|
void ase_freerex (ase_mmgr_t* mmgr, void* code);
|
2007-05-02 01:07:00 +00:00
|
|
|
|
2008-03-04 03:31:41 +00:00
|
|
|
ase_bool_t ase_isemptyrex (void* code);
|
2007-05-02 01:07:00 +00:00
|
|
|
|
2008-03-04 03:31:41 +00:00
|
|
|
#if 0
|
|
|
|
void ase_dprintrex (ase_rex_t* rex, void* rex);
|
|
|
|
#endif
|
2007-05-02 01:07:00 +00:00
|
|
|
|
|
|
|
#ifdef __cplusplus
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#endif
|