Dependence analysis, automatic vectorization, and automatic parallelization were invented after 1971.
Fast algorithms for computing dominators[2] were late-70s.
Graph coloring register allocators were introduced in the early 1980s.
[0] https://en.m.wikipedia.org/wiki/Very_long_instruction_word
[1] https://en.m.wikipedia.org/wiki/Trace_scheduling
[2] https://en.m.wikipedia.org/wiki/Dominator_(graph_theory)