Sciweavers

24 search results - page 3 / 5
» Expressing generalizations in unification-based grammar form...
Sort
View
SAS
2001
Springer
13 years 10 months ago
Solving Regular Tree Grammar Based Constraints
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
Yanhong A. Liu, Ning Li, Scott D. Stoller
PASTE
2010
ACM
13 years 8 months ago
Packrat parsers can handle practical grammars in mostly constant space
Packrat parsing is a powerful parsing algorithm presented by Ford in 2002. Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily...
Kota Mizushima, Atusi Maeda, Yoshinori Yamaguchi
LREC
2008
97views Education» more  LREC 2008»
13 years 7 months ago
Enhancing an English-Polish Electronic Dictionary for Multiword Expression Research
This paper describes a project aimed at converting a legacy representation of English idioms into an XML-based format. The project is set in the context of a large electronic Engl...
Piotr Banski, Radoslaw Moszczynski
DLS
2008
213views Languages» more  DLS 2008»
13 years 7 months ago
A parsing machine for PEGs
Parsing Expression Grammar (PEG) is a recognition-based foundation for describing syntax that renewed interest in top-down parsing approaches. Generally, the implementation of PEG...
Sérgio Medeiros, Roberto Ierusalimschy
ICTAI
2008
IEEE
14 years 13 days ago
Discovering Program's Behavioral Patterns by Inferring Graph-Grammars from Execution Traces
Frequent patterns in program executions represent recurring sequences of events. These patterns can be used to reveal the hidden structures of a program, and ease the comprehensio...
Chunying Zhao, Keven Ates, Jun Kong, Kang Zhang