1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
|
/**
* PLL (version 1.0.0) a software library for phylogenetic inference
* Copyright (C) 2013 Tomas Flouri and Alexandros Stamatakis
*
* Derived from
* RAxML-HPC, a program for sequential and parallel estimation of phylogenetic
* trees by Alexandros Stamatakis
*
* 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 3 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, see <http://www.gnu.org/licenses/>.
*
* For any other enquiries send an Email to Tomas Flouri
* Tomas.Flouri@h-its.org
*
* When publishing work that uses PLL please cite PLL
*
* @file lexer.h
*/
#ifndef __pll_LEXER__
#define __pll_LEXER__
#define PLL_ASCII_SIZE 128
#define PLL_EOS 0x00000200
#define PLL_SYM_CR 1 << 0
#define PLL_SYM_LF 1 << 1
#define PLL_SYM_LFCR 1 << 2
#define PLL_SYM_DIGIT 1 << 3
#define PLL_SYM_CHAR 1 << 4
#define PLL_SYM_SPACE 1 << 5
#define PLL_SYM_TAB 1 << 6
#define PLL_SYM_EOF 1 << 7
#define PLL_SYM_UNKNOWN 1 << 8
#define PLL_SYM_DOT 1 << 9
#define PLL_SYM_COLON 1 << 10
#define PLL_SYM_OPAREN 1 << 11
#define PLL_SYM_CPAREN 1 << 12
#define PLL_SYM_COMMA 1 << 13
#define PLL_SYM_SEMICOLON 1 << 14
#define PLL_SYM_EQUAL 1 << 15
#define PLL_SYM_DASH 1 << 16
#define PLL_SYM_SLASH 1 << 17
#define PLL_SYM_PLUS 1 << 18
#define PLL_TOKEN_NUMBER 1 << 0
#define PLL_TOKEN_STRING 1 << 1
#define PLL_TOKEN_EOF 1 << 2
#define PLL_TOKEN_WHITESPACE 1 << 3
#define PLL_TOKEN_NEWLINE 1 << 4
#define PLL_TOKEN_UNKNOWN 1 << 5
#define PLL_TOKEN_COLON 1 << 6
#define PLL_TOKEN_OPAREN 1 << 7
#define PLL_TOKEN_CPAREN 1 << 8
#define PLL_TOKEN_FLOAT 1 << 9
#define PLL_TOKEN_COMMA 1 << 10
#define PLL_TOKEN_SEMICOLON 1 << 11
#define PLL_TOKEN_EQUAL 1 << 12
#define PLL_TOKEN_DASH 1 << 13
#define PLL_TOKEN_SLASH 1 << 14
#define CONSUME(x) while (token.tokenType & (x)) token = get_token (&input);
#define NEXT_TOKEN token = get_token (&input);
typedef struct
{
int tokenType;
const char * lexeme;
int len;
} pllLexToken;
int get_next_byte (void);
int get_next_symbol (void);
pllLexToken get_token (int * input);
void init_lexan (const char * text, long n);
void lex_table_amend_phylip (void);
void lex_table_amend_fasta (void);
void lex_table_restore (void);
#endif
|
