905 search results - page 18 / 181 » Parsing of Context-Sensitive Languages |
156
click to vote
FPL
2001
Springer
15 years 10 months ago
2001
Springer
This paper presents an FPGA-based implementation of a syntactic parser that can process languages generated by almost unrestricted real-life context-free grammars (CFGs). More prec...
165
click to vote
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
Abstract—In this paper, we introduce FlowSifter, a systematic framework for online application protocol field extraction. FlowSifter introduces a new grammar model Counting Regu...
144
click to vote
IPL
2008
15 years 6 months ago
2008
We study the complexity of the membership or parsing problem for pictures generated by a family of picture grammars: Siromoney's Context-Free Kolam Array grammars (coincident...
142
click to vote
BIRTHDAY
2001
Springer
15 years 10 months ago
2001
Springer
A uniquely parsable grammar (UPG) introduced by Morita et al. (1997) is a kind of generative grammar, where parsing can be performed without backtracking. In this paper, we invest...
157
click to vote
IWPT
2001
15 years 7 months ago
2001
This paper presents two optimalizations of standard parsing techniques applied to Czech as a representative of a free word order language with rich morphology. Our approach is bas...