Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrank DeRemer
Person information
- affiliation: University of California Santa Cruz, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1980 – 1989
- 1984
[c12]Richard Jüllig, Frank DeRemer:
Regular right-part attribute grammars. SIGPLAN Symposium on Compiler Construction 1984: 171-178- 1982
- [j8]Frank DeRemer, Thomas J. Pennello:
Efficient Computation of LALR(1) Look-Ahead Sets. ACM Trans. Program. Lang. Syst. 4(4): 615-649 (1982) - 1981
- [j7]Frank DeRemer, Thomas J. Pennello, William M. McKeeman:
Ada syntax chart. ACM SIGPLAN Notices 16(9): 48-59 (1981) - 1980
- [j6]Frank DeRemer, Thomas J. Pennello, Richard Meyers:
A syntax diagram for (preliminary) Ada. ACM SIGPLAN Notices 15(7-8): 36-47 (1980) - [j5]Thomas J. Pennello, Frank DeRemer, Richard Meyers:
A simplified operator identification scheme for Ada. ACM SIGPLAN Notices 15(7-8): 82-87 (1980) - [c11]Frank DeRemer, Richard Jüllig:
Tree-affix dendrogrammars for languages and compilers. Semantics-Directed Compiler Generation 1980: 300-319
1970 – 1979
- 1979
- [j4]Frank DeRemer, Philip Levy, Steve Hanson, Philip Jackson
, Richard Jüllig, Tom Pittman:
Summary of the characteristics of several "modern" programming languages. ACM SIGPLAN Notices 14(5): 28-45 (1979) - [c10]Thomas J. Pennello, Frank DeRemer:
Efficient computation of LALR(1) look-ahead sets (with retrospective). Best of PLDI 1979: 14-27 - [c9]Frank DeRemer, Thomas J. Pennello:
Efficient computation of LALR(1) look-ahead sets. SIGPLAN Symposium on Compiler Construction 1979: 176-187 - 1978
- [c8]Thomas J. Pennello, Frank DeRemer:
A Forward Move Algorithm for LR Error Recovery. POPL 1978: 241-254 - 1976
- [j3]Frank DeRemer, Hans H. Kron:
Programming-in-the-Large Versus Programming-in-the-Small. IEEE Trans. Software Eng. 2(2): 80-86 (1976) - [c7]Frank DeRemer:
Review of Formalisms and Notation. Compiler Construction 1976: 37-56 - [c6]Frank DeRemer:
Lexical Analysis. Compiler Construction 1976: 109-120 - [c5]Frank DeRemer:
Transformational Grammars. Compiler Construction 1976: 121-145 - [c4]Frank DeRemer, Hans H. Kron:
Programming-in-the-Large versus Programming-in-the-Small. Fachtagung über Programmiersprachen 1976: 80-89 - 1975
- [c3]Frank DeRemer, Hans H. Kron:
Programming-in-the large versus programming-in-the-small. Reliable Software 1975: 114-121 - 1974
- [c2]William M. McKeeman, Frank DeRemer:
Feedback-free Modularization of Compilers. Fachtagung über Programmiersprachen 1974: 78-88 - 1971
- [j2]Frank DeRemer:
Simple LR(k) Grammars. Commun. ACM 14(7): 453-460 (1971) - 1970
- [j1]Franklin L. Deremer:
Optimization using LR(k) techniques. ACM SIGPLAN Notices 5(10): 32-34 (1970)
1960 – 1969
- 1969
- [c1]Franklin L. Deremer:
Generating parsers for BNF grammars. AFIPS Spring Joint Computing Conference 1969: 793-799
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-09-28 02:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
