var fDesc=new Array();
fDesc[0] = "Graph-expression is a high level automaton library for information extraction <br /> <br /> Features:<br /> <br /> -all standard reg exp operators: , {n,n}, {n,}, ....<br /> -much more: java predicates on groups, reluctant, greedy, cut operator, inner match...<br /> -structure of match -it is possible to build syntax tree based on match<br /> -weighted regexps allow you to encode preference of different graph path with your scoring functions, heuristic search will handle the rest.<br /> -easy extendable framework model. You can easily write new matchers and use them with existed.<br /> -dynamic structure of graph (allow you to use gexp to solve search problems like suduko, 8-qeen problems)<br /> -fast - it works faster then Jape transducer (gate.ac.uk) closest project to this one<br /> -scopes for variables: all you predicates can set/get variables from current scope/context to do their job<br /> -easy embeddable - few line of java code and you can use power of graph-expression in you project.";

function tShowHide(id, show)
{
	var s = document.getElementById("desc");

	if ((s.innerHTML.length<=212 || show==1) && show!=2)
	{
		s.innerHTML = fDesc[id];
		if (document.getElementById('m1'))
			document.getElementById('m1').style.display='none';
		if (document.getElementById('m2'))
			document.getElementById('m2').style.display='none';
		if (document.getElementById('more_txt'))
			document.getElementById('more_txt').style.display='inline';
	}
	else
	{
		s.innerHTML = '';
	}
}