As a quite serious question, what do you use instead? Hand-written
recursive descent? Some other form of machine generated parser?
Thanks,
Arnold
Rob Pike <robpike(a)gmail.com> wrote:
And today, we understand parsing so well we don't
need yacc.
-rob
On Wed, May 26, 2021 at 10:20 AM Nelson H. F. Beebe <beebe(a)math.utah.edu>
wrote:
> The last article of the latest issue of the Communications of the ACM
> that appeared electronically earlier today is a brief interview with
> this year's ACM Turing Award winners, Al Aho and Jeff Ullman.
>
> The article is
>
> Last byte: Shaping the foundations of programming languages
>
https://doi.org/10.1145/3460442
> Comm. ACM 64(6), 120, 119, June 2021.
>
> and it includes a picture of the two winners sitting on Dennis
> Ritchie's couch.
>
> I liked this snippet from Jeff Ullman, praising fellow list member
> Steve Johnson's landmark program, yacc:
>
> >> ...
> >> At the time of the first Fortran compiler, it took several
> >> person-years to write a parser. By the time yacc came around,
> >> you could do it in an afternoon.
> >> ...
>
>
> -------------------------------------------------------------------------------
> - Nelson H. F. Beebe Tel: +1 801 581 5254
> -
> - University of Utah FAX: +1 801 581 4148
> -
> - Department of Mathematics, 110 LCB Internet e-mail:
> beebe(a)math.utah.edu -
> - 155 S 1400 E RM 233 beebe(a)acm.org
> beebe(a)computer.org -
> - Salt Lake City, UT 84112-0090, USA URL:
>
http://www.math.utah.edu/~beebe/ -
>
> -------------------------------------------------------------------------------
>