Super.

Wow! Superb explanation involving the tree nodes!

great stuff! cheers

du är bäst! räddare i nöden.

världsklass

Thank you for making this available for free great material and explanation.

Good stuff. Clearly explained.

Great explanation

THANKS!!!

Great lecture! Thanks for sharing

Great Lecturer , clear and concise

I appreciate your work, thank you for great explaining.

شكرا لك

Perfekt förklarat! Tack! / från en ingenjörsstudent i datateknik

Väldigt informativ och hjälpsam föreläsning, 10/10

DEKRYPERING av filer cipher /w:c/ skriver detta endast ned filer eller endast packar ned filer?

00:00:35 Recap 00:02:35 Quicksort 00:06:51 Three-address code 00:08:55 Basic blocks 00:16:32 Local optimizations 00:21:30 Global optimizations 00:39:45 Loop Optimizations 00:42:25 Move code out of the loop 00:48:25 Eliminate induction variables 00:51:10 Reduce strength of operations 01:00:55 Loop unrolling 01:10:10 Tail call optimization 01:17:05 Code Generator Learned a lot, thanks! Too bad the course site is geofenced. Fortunately there are workarounds. P.S. There is a bug in the inner loop of quicksort, it should be `while (a[j] > v && j > 0);`, otherwise it will throw a *runtime error: index -1 out of bounds* P.P.S The flickering projector is painful to look at.

00:00:45 Recap 00:02:43 Why do we have intermediate code generator? 00:04:42 Frontend and backend of compiler 00:06:10 Intermediate code optimization 00:10:42 Three-Address Code 00:20:16 Types of three-address instructions 00:28:12 Syntax-directed definition (attributes) 00:30:53 Semantic Rule 00:36:35 While statement 00:46:15 Code Optimization 00:54:00 Two rules of hand optimization 00:59:10 The Optimizer (machine independent optimizer) 01:06:05 Definition of terms 01:10:03 Some optimizations 01:14:50 Algebraic transformations 01:16:52 Loop Learned a lot, thanks!

00:00:20 Recap 00:03:45 Static checks and dynamic checks 00:05:55 Static checks 00:08:17 Dynamic checks 00:10:20 Type system 00:13:27 Strong typing and weak typing 00:17:34 Runtime checks 00:22:10 Type expressions 00:33:48 Type expression tree 00:38:03 Example program 00:41:45 Grammar 00:48:37 Data types 00:54:01 Semantic rules 01:10:14 Example expression 01:17:13 Equivalence of types (and type expressions) 01:21:15 Name equivalence and Structure equivalence 01:22:25 C structs For 01:14:45, some examples of languages that treat *if* as an expression that returns a value instead of a statement are ruby, elixir, and lisp. Love the irony that C structs does not have structural equivalence. Learned a lot, thanks!

00:00:15 Two ways of building interpreters 00:00:55 Other approaches 00:04:55 Syntax trees 00:08:20 execute() 00:16:29 if statement 00:23:13 while statement 00:29:45 Stack machines 00:37:02 jmp (if statement) 00:44:02 lvalue and rvalue 00:54:50 jmp (while statement) 01:01:12 *easter egg* :D 01:01:17 if statement with nested while statement 01:12:43 Short-circuit evaluation Learned a lot, thanks!

00:00:20 Recap 00:02:43 Some terms (definitions) 00:10:10 Activation record 00:23:25 Address space / Memory space 00:31:25 Call sequence 00:41:33 Lexical scope and dynamic scope 00:50:48 Call by value and Call by reference 00:56:00 Heap 01:05:40 Garbage collection 01:12:23 Mark and Sweep Learned a lot, thanks!

00:00:20 Parse tree recap 00:02:50 Syntax tree examples 00:17:37 How will these syntax trees be implemented? 00:20:57 C syntax tree 00:25:28 Syntax-directed definition 00:33:10 How to build a syntax tree? 00:46:50 Building a syntax tree 00:57:07 Bison implementation 01:01:00 Directed acyclic graphs Learned a lot, thanks!

00:00:20 History of scanners 00:01:40 Scanner recap 00:04:10 Flex input file (overview) 00:07:00 Regular expressions 00:12:50 Macros 00:15:55 Unsigned real numbers 00:26:20 More regexps 00:39:40 The Flex input file 00:44:40 Rules 00:52:10 Another example (listreader) 01:09:05 State machines / finite automata 01:16:33 Why state machines? Learned a lot, thanks!

00:00:14 Agenda 00:00:56 Grammar 00:04:30 Decorated parse tree 00:15:00 Two types of syntax-directed translation 00:17:24 [1] Syntax-directed definition 00:28:30 [2] Syntax-directed translation scheme 00:37:47 Yacc/Bison 00:44:15 Parts of a bison input file 00:45:10 Declarations 00:47:45 Productions (rules) 00:55:37 A calculator (example) 00:57:55 Grammar (productions) 01:07:40 C Code 01:19:20 Simplified bison file 01:27:00 Precedence conflict Learned a lot, thanks!

00:00:30 Top-Down Parser Recap 00:04:25 Bottom-Up Parser 00:09:08 Why Bottom-Up Parsing? 00:11:20 Grammar Example 00:16:50 Generate the expression (problem) 00:20:15 Generate the expression (solution) 00:24:00 Shift/Reduce Conflict 00:29:28 LR(1) Parser 00:33:45 Tree Traversal Recap 00:35:45 Top-Down (LL) Tree Building 00:37:40 Bottom-Up (LR) Tree Building 00:40:50 Difficulties with LR (bottom-up) parsing 00:49:30 Top-Down Parser Solution 00:52:00 Reduce-reduce conflicts 00:54:40 Typesetting example 01:01:15 Left Factoring Learned a lot, thanks!

00:02:16 Types of Parsers 00:04:45 Data Types in Pascal 00:07:40 Type Grammar 00:10:40 Source Program (example) 00:18:04 LL(1) Parser 00:19:06 Predictive Parser 00:21:00 Parser with Backtracking Swedish Example 00:24:13 Predictive Recursive Descent Parser 00:26:53 match() function 00:30:38 simple() function 00:36:50 type() function 00:47:06 Left Factoring 00:51:05 Left Recursion (problem) 00:57:13 Left Recursion (solution) 01:02:21 expr() function 01:03:03 rest() function 01:06:58 expr Grammar 01:08:48 How to write a top-down parser? 01:16:05 The "2.5" program 01:19:45 Semantic Action 01:25:44 term() function 01:26:25 expr() function Learned a lot, thanks!

00:02:35 Language Rules 00:04:25 Grammar 00:06:55 Terminal and Nonterminal 00:07:35 Production / Rule 00:10:14 Start Symbol 00:12:20 What language does a grammar describe? 00:14:52 An Infinite Language 00:20:55 More General Sums 00:28:35 Parse Tree / Concrete Syntax Tree 00:34:00 Syntax Tree / Abstract Syntax Tree 00:37:00 Bad Grammar 00:42:10 Ambiguous Grammar 00:44:50 Bigger Language 01:03:30 Different Notations 01:11:46 Postfix Evaluator using Stack 01:16:00 The "if" statement in C 01:22:00 Context Free Grammar 01:25:55 Empty Symbol Learned a lot, thanks!

00:00:42 What is a compiler? 00:01:30 Why do we need a course about compilers? 00:04:37 What's the difference between a compiler and an interpreter? 00:06:56 What you need to already know 00:09:00 Course Book (Dragon Book) 00:09:45 Syllabus 00:11:20 Compiler 00:14:50 gcc warning flags 00:15:40 Quick history recap 00:16:50 Translation 00:18:45 Analysis and Synthesis 00:20:00 Compiler and their context 00:24:30 Static vs Dynamic Linking 00:26:45 Interpreter 00:29:55 The Seven Phases (of a compiler) 00:30:45 [Phase 1] Lexical Analyzer / Scanner 00:35:25 [Phase 2] Syntax Analyzer / Parser 00:41:40 Semantics 00:48:53 Symbol Table 00:51:52 [Phase 3] Semantic Analyzer 00:55:15 [Phase 4] Intermediate Code Generator 00:58:33 [Phase 5] Machine Independent Code Optimizer 01:04:15 [Phase 6] Code Generator 01:09:55 [Phase 7] Machine Dependent Code Optimizer 01:13:40 Scanner 01:16:37 Parser Learned a lot, thanks!

Detta är den tråkigaste kursen jag har läst, men du lyckades sälja in detta på mig. Väldigt bra jobbat

Stort tack för allt material Thomas, läser en DB kurs vid UU och jag kan säga att din kurs håller mycket högre kvalite och pedagogik!

Thanks for this. Can you explain how to repair an corrup db ?

Riktig legend!💪

Riktig bra föreläsning som alltid!

Ljudet är väldigt dåligt, samt skit dåliga exempel, är du nybörjare så kommer inte du lära dig nåt alls av denna video 😏, sorry verkligen men man måste säga vad man tycker

Mycket intressant!

En av dom bästa Transaktions (DB kurs) genomgång på Svenska. Denna video borde ha flera tusen visningar. Stort Stort tack Thomas som lägger upp dessa guldkorn! Kan tillägga att jag har gått Databas1 kurs på annat Universitet MEN denna videoserien var överlägsen! Tempon på genomgången, dom exempel som tas upp och förklaringarna gör att man inte vill att avsnittet ska ta slut.

är det här lektion för Avancerad hårdvara och operativsystem??

är det för nybörjare ??

Sigma male at his finest

bäst

tänk att många av studenterna i den här videon nu har varit ingenjörer i ungefär 4 år

jag står nog för 150 av dom 160 visningarna på denna video

Jag lärde mig nyss en studieteknik utan att utöva det.

Läser pågående SQL-kurs. Ditt material och din föreläsningsstil bidrar extremt mycket. Tack för det :)!

king

Riktig konung !

För lite mer info om SQL 2011:s stöd för temporala databaser (som Thomas nämnde mot slutet av föreläsningen) finns denna artikel från 2012 författad av två personer på IBM: cs.ulb.ac.be/public/_media/teaching/infoh415/tempfeaturessql2011.pdf

Usch för tvestjärtar. Jag växte upp ganska nära ett stort sågverk. Jag vet inte om det är anledningen till att vi alltid hade massvis med tvestjärtar som tog sig in i huset genom skafferiventilen, morgontidningen i brevlådan (var ju fuktigt och mörkt där) och säkert andra ställen. Jobbigast var ju att de kom in i maten i skafferiet.

haha okeeeej

Jag studerar inte ämnen men ni förklarar super bra. Tack ska ni ha 🙏🏻 :) kan jag få veta vad är kurs koden. Tackar