Sciweavers

705 search results - page 67 / 141
» New Compilation Languages Based on Structured Decomposabilit...
Sort
View
ACL
1998
14 years 11 months ago
A Flexible Example-Based Parser Based on the SSTC
In this paper we sketch an approach for Natural Language parsing. Our approach is an example-based approach, which relies mainly on examples that already parsed to their represent...
Mosleh Hmoud Al-Adhaileh, Tang Enya Kong
CN
2007
135views more  CN 2007»
14 years 10 months ago
Handling feature interactions in the language for end system services
Since traditional telecommunication networks assume dumb terminals, there are rarely feature interactions involving end systems. However, in Internet telephony systems, such featur...
Xiaotao Wu, Henning Schulzrinne
IJAR
2006
91views more  IJAR 2006»
14 years 10 months ago
Sequential influence diagrams: A unified asymmetry framework
We describe a new graphical language for specifying asymmetric decision problems. The language is based on a filtered merge of several existing languages including sequential valu...
Finn Verner Jensen, Thomas D. Nielsen, Prakash P. ...
OOPSLA
2004
Springer
15 years 3 months ago
Modular generics
This paper presents the design of G, a new language specifically created for generic programming. We review and identify important language features of C++ and Haskell in light o...
Jeremy G. Siek
IMC
2006
ACM
15 years 3 months ago
binpac: a yacc for writing application protocol parsers
A key step in the semantic analysis of network traffic is to parse the traffic stream according to the high-level protocols it contains. This process transforms raw bytes into s...
Ruoming Pang, Vern Paxson, Robin Sommer, Larry L. ...