afl-material: comparison videos/01-intro.srt

equal deleted inserted replaced

-:a6e9fc38ae54
+:aad5957eb7e4
 this module is that you
 12
 00:00:46,130 --> 00:00:49,310
 do not need to be an
-Über hacker to implement your own
+Überhacker to implement your own
 13
 00:00:49,310 --> 00:00:51,305
 compiler for your
 own language, say.
 you reload the variable.
 110
 00:05:41,560 --> 00:05:45,935
 Even though we cut corners
-into could generate apart.
+in the code generater part
 111
 00:05:45,935 --> 00:05:48,575
-By producing code for the JVM,
+by producing code for the JVM,
 112
 00:05:48,575 --> 00:05:51,710
 we can still obtain quite
 impressive results.
 published on compilers.
 180
 00:08:52,190 --> 00:08:56,690
 Why on Earth studying
-compilers in 2020? And even worse
+compilers in 2020 (and of course in 2021)?
 181
 00:08:56,690 --> 00:08:59,659
-why implementing
+And even worse: Why implementing
 your own compiler?
 182
 00:08:59,659 --> 00:09:02,720
 Well, a slightly humorous take on
 First, he says
 hardware is getting
 192
 00:09:29,690 --> 00:09:32,585
-wierder, rather than
+weirder, rather than
 getting clocked faster.
 193
 00:09:32,585 --> 00:09:34,520
 And that's definitely true.
 crypto accelerators, etc.
 205
 00:10:07,189 --> 00:10:11,930
 We have TSPs, GPUs, ARM
-big,little, Xeon Phis,
+big,little, Xeon Phi,
 206
 00:10:11,930 --> 00:10:14,630
 and this only scratches the surface.
 slightly obscure
 programming language
 268
 00:13:15,770 --> 00:13:18,650
-bat is very well-known in
+but is very well-known in
 269
 00:13:18,650 --> 00:13:22,040
 areas where safety
 is really paramount.
 a interesting way to get
 295
 00:14:26,420 --> 00:14:30,195
 their airplanes up in the
-air and let them not crush.
+air and let them not crash.
 296
 00:14:30,195 --> 00:14:33,010
 In another example, I
 have friends working
 language, we had to look at.
 321
 00:15:40,280 --> 00:15:43,670
 This BF language contains
-the kind of memory and
+a kind of memory and
 322
 00:15:43,670 --> 00:15:45,680
-the memory pointer which can
+a memory pointer which can
 323
 00:15:45,680 --> 00:15:48,140
 be moved to the left
 or to the right,
 might recognize it.
 337
 00:16:22,865 --> 00:16:27,120
 And I run it with a
-benchmark program, which
+benchmark program, which you
 338
 00:16:27,760 --> 00:16:30,960
 might also recognize.
 This can be easily
 done by somehow
 350
 00:17:06,520 --> 00:17:09,490
-representing the BF memory in
+representing the BF memory in C.
 351
 00:17:09,490 --> 00:17:12,310
-C. We can do this
+We can do this
 by just an array of
 352
 00:17:12,310 --> 00:17:15,380
 characters and a memory pointer,
 But don't apply any optimization.
 395
 00:19:31,810 --> 00:19:38,395
 Keep this in mind.
-As a second try,
 396
 00:19:38,395 --> 00:19:42,595
-of course, I can try to now
+As a second try, of course, I can try to
 generate a better C program.
 397
 00:19:42,595 --> 00:19:46,060
 And as you'll remember from
 00:20:49,025 --> 00:20:51,530
 no optimizations switched on.
 421
 00:20:51,530 --> 00:20:54,050
-So there's minus O0.
+So it runs with minus O0.
 422
 00:20:54,050 --> 00:20:56,090
 And you can see
 it's now down from
 00:21:29,240 --> 00:21:31,700
 O0 to not introduce
 432
 00:21:31,700 --> 00:21:35,255
-any optimizations and run
+any optimizations and it runs
-essentially 20 seconds.
+essentially for 20 seconds.
 433
 00:21:35,255 --> 00:21:37,880
 If we then increment
 I take the first program which
 439
 00:21:55,430 --> 00:21:58,070
 increments everything
-in a single steps
+in single steps
 440
 00:21:58,070 --> 00:22:00,185
-or decremented in single steps.
+or decrements in single steps.
 441
 00:22:00,185 --> 00:22:04,835
 But now I use the full
 capacity of the GCC compiler
 00:23:22,960 --> 00:23:25,700
 Just a quick recap of what I did.
 468
 00:23:25,700 --> 00:23:28,160
-I first run the program with
+I first run the Mandelbrot program with
 469
 00:23:28,160 --> 00:23:31,730
 an interpreter and it took
 approximately 11 minutes.

changeset 833	aad5957eb7e4
parent 761	82a1315c128d