Unparser

Known as: Unparsing 
In computing, an unparser is a system that constructs a set of characters or image components from a given parse tree. An unparser is in effect the… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1984-2016
024619842016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Danvy’s functional unparsing problem (Danvy 1998) is to implement a typesafe ‘printf’ function, which converts a sequence of… (More)
  • figure 1
  • figure 3
  • figure 6
  • figure 8
  • figure 9
Is this relevant?
2011
2011
A code generator is a program translating an input model into code. In this paper we focus on template-based code generators in… (More)
Is this relevant?
2009
2009
In “Functional Unparsing” (JFP 8(6): 621–625, 1998), Danvy presented a type-safe printf function using continuations and an… (More)
  • table 1
Is this relevant?
2006
2006
Often, independent organizations define and advocate different XML formats for a similar purpose and, as a result, application… (More)
  • figure 3
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Grammar deployment is the process of turning a given grammar specification into a working parser. The Grammar Deployment Kit (for… (More)
Is this relevant?
1998
1998
A string-formatting function such as printf in C seemingly requires dependent types, because its control string determines the… (More)
Is this relevant?
1996
1996
Across a range of software development activities, there i s typically no single best way to view the abstractions o f interest… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1995
1995
Database systems are concerned with structured data. Unfortunately,data is still often available in an unstructured manner (e.g… (More)
Is this relevant?
1988
1988
This paper describes a new parallel parsing scheme for context-free grammars and our experience of implementing this scheme, and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?