| 
|
Quote: efficient computation of LALR(1) look-ahead sets; used Tarjan's algorithm for strongly-connected components
topics >
all references >
references c-d >
Topic:
graphs
Group:
grammar
Topic:
application generator
Quotation Skeleton
We defined the correct relations that obtained true … of the relations. … Martin Chaney, a fellow graduate student of Tom's, … graph. Tom turned to the strongly-connected component algorithm … linear in the size of the DAG's nodes … Berkeley YACC and its cousin Bison also adopted … Other tools have adopted our technique Google-1 Google-2
Copyright clearance needed for quotation.
Topic: graphs (18 items)
Group: grammar (8 topics, 180 quotes)
Topic: application generator (21 items)