Sciweavers

77 search results - page 5 / 16
» Formal properties of XML grammars and languages
Sort
View
CLIN
2004
13 years 8 months ago
Trailfinder - A Case Study in Extracting Spatial Information Using Deep Language Processing
The present paper reports on an end-to-end application using a deep processing grammar to extract spatial and temporal information of prepositional and adverbial expressions from ...
Lars Hellan, Dorothee Beermann, Jon Atle Gulla, At...
BIRTHDAY
1992
Springer
13 years 11 months ago
Single Tree Grammars
A context-free grammar is a single-tree grammar (STG) if every nonterminal symbol has at most one production rule whose right hand side contains nonterminal symbols. Various prope...
Sheila A. Greibach, Weiping Shi, Shai Simonson
ICWE
2007
Springer
14 years 1 months ago
Structural Patterns for Descriptive Documents
Combining expressiveness and plainness in the design of web documents is a difficult task. Validation languages are very powerful and designers are tempted to over-design specific...
Antonina Dattolo, Angelo Di Iorio, Silvia Duca, An...
ISSTA
2004
ACM
14 years 25 days ago
Model checking XML manipulating software
The use of XML as the de facto data exchange standard has allowed integration of heterogeneous web based software systems regardless of implementation platforms and programming la...
Xiang Fu, Tevfik Bultan, Jianwen Su
CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 4 months ago
Precedence Automata and Languages
Abstract. Operator precedence grammars define a classical Boolean and deterministic context-free family (called Floyd languages or FLs). FLs have been shown to strictly include the...
Violetta Lonati, Dino Mandrioli, Matteo Pradella