EDBT 2026 Demo / reviewers in the wild / expert
Marc L. Joliat
dblp:65/2054
· DBLP profile ↗
3ranked-venue papers
1as first author
0since 2021 · last 1981
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 2Systems, architecture and hardware · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Software engineering, system software, and programming languages
2 papers |
Compilers and program optimization · 60% Programming languages and type systems · 40% |
Topics — the 2 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Compilers and program optimization › parsing
LR(k) parsers |
0.0 | 1 | 1976 | A Simple-Technique for Partial Elimination of Unit Productions from LR (k) Parsers · IEEE Trans. Computers 1976 |
Compilers and program optimization
parsing |
0.0 | 1 | 1976 | A Simple-Technique for Partial Elimination of Unit Productions from LR (k) Parsers · IEEE Trans. Computers 1976 |
Methods — techniques the papers use, named apart from their topics
aho-ullman algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1981 | Experience with a Modular Typed Language: PROTEL
P. M. Cashin, Marc L. Joliat, Rym F. Kamel, D. M. Lasker |
ICSE | 2 |
| 1979 | Protel: a high level language for telephonyabstractPROTEL is a state-of-the-art high-level programming language designed specifically for telephony applications. It is widely used at Bell-Northern Research in the development of modular software for the DMS-1001 series of digital switches. This paper describes the major features of the PROTEL language and its support system. David G. Foxall, Marc L. Joliat, Rym F. Kamel, J. J. Miceli |
COMPSAC | 2 |
| 1976 | A Simple-Technique for Partial Elimination of Unit Productions from LR (k) ParsersabstractA simplified version of Aho and Ullman's algorithm [1] is presented for the elimination of unit productions of the form A::= B from LR(k) parsers. The algorithm does not eliminate all such unit productions, but it is applicable in practical instances not handled by Aho and Ullman's technique. Marc L. Joliat |
IEEE Trans. Computers | 1 |