Previous    Next

garbage collection, 151, 257-282, 321, 333 and cache, 267, 480-481 Baker's algorithm, 274 compiler interface, 275-278 concurrent, 272 conservative, 281 copying, 264-269 cost, 259, 264, 268, 271, 275 flip, 274 generational, 269-271, 480 incremental, 272-275 mark-sweep, 257-262 reference counts, 262-264 generic, 336, 348 Generic Java, 336 GJ, 336 grammar, 5, 40-45, see also syntax ambiguous, 42, 50, 51, 67-68, 90, 185 attribute, 12 factoring, 53 for intermediate representation, 7-9 for parser generator, 89 hierarchy of classes, 66 LALR, 66, 67 LL(1), 51 of straight-line programs, 7 to specify instruction set, 183-186 transformations, 51, 88, 90 unambiguous, 51 graph coloring, 219-223, 250, 286, 360 optimistic, 221 with coalescing, 223-240, 245, 320 work-list algorithm, 232-240 interference, see interference graph Graph module, 214 graph, flow, see flow graph
JaVaScreenshot Previous    Next
Comments