#include <iostream>
#include <sstream>
#include <fstream>
#include <vector>
#include <algorithm>
#include "regexp-pcre++.h"
#include "freeling/traces.h"
#include "freeling/dep_rules.h"
#include "freeling/dependencies.h"
Defines | |
#define | MOD_TRACENAME "DEP_TXALA" |
#define | MOD_TRACECODE DEP_TRACE |
#define | closing(x) (x=='('?")":(x=='<'?">":(x=='{'?"}":(x=='['?"]":"")))) |
Separate extra lemma/form/class conditions from the chunk label. | |
#define | LEFT 1 |
Check if the current context matches the one specified in the given rule. | |
#define | RIGHT 2 |
#define | first_cond(d) (d==LEFT? core-1 : core+1) |
#define | first_chk(d) (d==LEFT? chk-1 : chk+2) |
#define | last(i, v, d) (d==LEFT? i<0 : i>=(int)v.size()) |
#define | next(i, d) (d==LEFT? i-1 : i+1); |
#define | prev(i, d) (d==LEFT? i+1 : i-1); |
Functions | |
void | PrintTree (parse_tree::iterator n, int depth) |
void | PrintDepTree (dep_tree::iterator n, int depth) |
#define closing | ( | x | ) | (x=='('?")":(x=='<'?">":(x=='{'?"}":(x=='['?"]":"")))) |
Separate extra lemma/form/class conditions from the chunk label.
#define first_chk | ( | d | ) | (d==LEFT? chk-1 : chk+2) |
#define first_cond | ( | d | ) | (d==LEFT? core-1 : core+1) |
#define last | ( | i, | |||
v, | |||||
d | ) | (d==LEFT? i<0 : i>=(int)v.size()) |
Referenced by completer::applyRule().
#define LEFT 1 |
Check if the current context matches the one specified in the given rule.
#define MOD_TRACECODE DEP_TRACE |
#define MOD_TRACENAME "DEP_TXALA" |
#define next | ( | i, | |||
d | ) | (d==LEFT? i-1 : i+1); |
#define prev | ( | i, | |||
d | ) | (d==LEFT? i+1 : i-1); |
#define RIGHT 2 |
void PrintDepTree | ( | dep_tree::iterator | n, | |
int | depth | |||
) |
void PrintTree | ( | parse_tree::iterator | n, | |
int | depth | |||
) |