Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,031,209 papers from all fields of science
Search
Sign In
Create Free Account
Compiler-compiler
Known as:
Semantic action routine
, Compiler Compiler
, Parser generators
Expand
In computer science, a compiler-compiler or compiler generator is a programming tool that creates a parser, interpreter, or compiler from some form…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
42 relations
ANTLR
Abstract syntax tree
Atlas Autocode
Attribute grammar
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Deep Biaffine Attention for Neural Dependency Parsing
Timothy Dozat
,
Christopher D. Manning
International Conference on Learning…
2016
Corpus ID: 7942973
This paper builds off recent work from Kiperwasser & Goldberg (2016) using neural attention in a simple graph-based dependency…
Expand
Highly Cited
2016
Highly Cited
2016
Dependent types and multi-monadic effects in F*
N. Swamy
,
Cătălin Hriţcu
,
+9 authors
Santiago Zanella-Béguelin
ACM-SIGACT Symposium on Principles of Programming…
2016
Corpus ID: 567397
We present a new, completely redesigned, version of F*, a language that works both as a proof assistant as well as a general…
Expand
Highly Cited
1999
Highly Cited
1999
Partial Evaluation of Computation Process--An Approach to a Compiler-Compiler
Y. Futamura
High. Order Symb. Comput.
1999
Corpus ID: 12673078
This paper reports the relationship between formal description of semantics (i.e., interpreter) of a programming language and an…
Expand
Highly Cited
1997
Highly Cited
1997
Defining and Parsing Visual Languages with Layered Graph Grammars
J. Rekers
,
Andy Schürr
Journal of Visual Languages and Computing
1997
Corpus ID: 40088910
Abstract Sentences of Visual Languages (VLs) may often be regarded as assemblies of pictorial objects with spatial relationships…
Expand
Highly Cited
1994
Highly Cited
1994
SUIF: an infrastructure for research on parallelizing and optimizing compilers
Robert P. Wilson
,
R. French
,
+8 authors
J. Hennessy
SIGP
1994
Corpus ID: 2219157
Compiler infrastructures that support experimental research are crucial to the advancement of high-performance computing. New…
Expand
Highly Cited
1985
Highly Cited
1985
An experiment in partial evaluation: the generation of a compiler generator
N. Jones
,
P. Sestoft
,
H. Søndergaard
SIGP
1985
Corpus ID: 6564774
The present paper is an extended abstract of (Jones 1985), in which a running , non-trivial partial evaluator is described . As…
Expand
Highly Cited
1982
Highly Cited
1982
GAG: A Practical Compiler Generator
U. Kastens
,
Brigitte Hutt
,
Erich Zimmermann
Lecture Notes in Computer Science
1982
Corpus ID: 33752654
1: Introduction.- 2: The compiler generator GAG.- 3: ALADIN A language for distributed definitions.- 4: Development of an…
Expand
1982
1982
Compiler construction using attribute grammars
K. Koskimies
,
Kari-Jouko Räihä
,
Matti Sarjakoski
SIGPLAN Conferences and Workshops
1982
Corpus ID: 2090175
The adequacy of attribute grammars as a compiler writing tool is studied on the basis of the experiences on attribute grammars…
Expand
Highly Cited
1982
Highly Cited
1982
A semantics-directed compiler generator
Lawrence Charles Paulson
ACM-SIGACT Symposium on Principles of Programming…
1982
Corpus ID: 17953712
This paper introduces a formal notition, the semanfic grammar, for defining programming languages. Semantic grammars combine…
Expand
Review
1980
Review
1980
An Overview of the Production-Quality Compiler-Compiler Project
Bruce W. Leverett
,
R. Cattell
,
+4 authors
W. Wulf
Computer
1980
Corpus ID: 6985394
The PQCC experience reveals that—contrary to common practice and belief—retargetability and a high level of optimization are not…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE