dependencies.cc File Reference

#include <iostream>
#include <sstream>
#include <fstream>
#include <vector>
#include <algorithm>
#include "freeling/morfo/traces.h"
#include "freeling/morfo/dep_rules.h"
#include "freeling/morfo/dependencies.h"

Include dependency graph for dependencies.cc:

Defines
#define	MOD_TRACENAME   L"DEP_TXALA"
#define	MOD_TRACECODE   DEP_TRACE
#define	closing(x)   (x==L'('?L")":(x==L'<'?L">":(x==L'{'?L"}":(x==L'['?L"]":L""))))
	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 k, int depth)
void	PrintDepTree (dep_tree::iterator n, int depth)

---

Define Documentation

#define closing

(

x

)

(x==L'('?L")":(x==L'<'?L">":(x==L'{'?L"}":(x==L'['?L"]":L""))))

Separate extra lemma/form/class conditions from the chunk label.

Referenced by completer::extract_conds().

#define first_chk

(

d

)

(d==LEFT? chk-1 : chk+2)

Referenced by completer::match_side().

#define first_cond

(

d

)

(d==LEFT? core-1 : core+1)

Referenced by completer::match_side().

#define last	(		i,
			v,
			d
	)		(d==LEFT? i<0 : i>=(int)v.size())

Referenced by tree< T >::append_child(), completer::applyRule(), tree< T >::clear(), tree< T >::clone(), completerRule::completerRule(), tree< T >::hang_child(), completer::match_side(), completerRule::operator=(), tree< T >::sibling_rbegin(), and tree< T >::tree().

#define LEFT   1

Check if the current context matches the one specified in the given rule.

Referenced by completer::match_side(), and completer::matching_context().

#define MOD_TRACECODE   DEP_TRACE

#define MOD_TRACENAME   L"DEP_TXALA"

#define next	(		i,
			d
	)		(d==LEFT? i-1 : i+1);

Referenced by tree< T >::clear(), tree< T >::clone(), completer::match_side(), and tree< T >::tree().

#define prev	(		i,
			d
	)		(d==LEFT? i+1 : i-1);

Referenced by tree< T >::clear(), tree< T >::clone(), completer::match_side(), List::push(), and tree< T >::tree().

#define RIGHT   2

Referenced by completer::matching_context().

---

Function Documentation

void PrintDepTree	(	dep_tree::iterator	n,
		int	depth
	)

References word::get_form(), word::get_lemma(), and word::get_tag().

void PrintTree	(	parse_tree::iterator	n,
		int	k,
		int	depth
	)

References word::get_form(), word::get_lemma(), and word::get_tag().