76 search results - page 3 / 16 » Executable Grammars in Newspeak |
VL
2005
IEEE
13 years 12 months ago
2005
IEEE
Structured program editors can lower the entry barrier for beginning computer science students by preventing syntax errors. However, when editors force programs to be executable a...
VL
1995
IEEE
13 years 9 months ago
1995
IEEE
Diagrams (e.g., flowcharts, trees for hierarchical structures, or graphs for finite state machines) are often needed as part of visual language systems and advanced user interfa...
ACL
2010
13 years 4 months ago
2010
As information extraction (IE) becomes more central to enterprise applications, rule-based IE engines have become increasingly important. In this paper, we describe SystemT, a rul...
IWPT
2001
13 years 7 months ago
2001
We define a new model of automata for the description of bidirectional parsing strategies for tree adjoining grammars and a tabulation mechanism that allow them to be executed in ...
DAGSTUHL
2006
13 years 7 months ago
2006
Abstract. The talk focused on a grammar-based technique for identifying redundancy in program code and taking advantage of that redundancy to reduce the memory required to store an...