382 search results - page 5 / 77 » Generalized Multitext Grammars |
DCC
2011
IEEE
13 years 1 months ago
2011
IEEE
Larsson and Moffat’s RePair algorithm is generalized from strings to trees. The new algorithm (TreeRePair) produces straight-line linear context-free tree (SLT) grammars which a...
ACL
2011
12 years 11 months ago
2011
We discuss some of the practical issues that arise from decoding with general synchronous context-free grammars. We examine problems caused by unary rules and we also examine how ...
VL
2003
IEEE
14 years 18 days ago
2003
IEEE
Thispaper presents an approach to spatial specifications for Web information transformation'. Extended from the Reserved Graph Grammar (RGG), a Spatial Graph Grammar (SGG) is...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
In 2004, Klavins et al. introduced the use of graph grammars to describe--and to program--systems of self-assembly. It turns out that these graph grammars can be embedded in a gra...
CC
1999
Springer
13 years 11 months ago
1999
Springer
Tomita devised a method of generalized LR GLR parsing to parse ambiguous grammars e ciently. A GLR parser uses linear-time LR parsing techniques as long as possible, falling back...