From: 2weiEmu <saalbach.robert@outlook.de>
Date: Sat, 21 Feb 2026 19:27:56 +0000 (+0100)
Subject: updated and merged
X-Git-Url: https://git.saalbach.dev/?a=commitdiff_plain;h=fa8d6b200e578af6c6fc81a3cae6e5a47e8cacad;p=research-obsidian.git

updated and merged
---

diff --git a/List of things to do.md b/List of things to do.md
index 3f57530..6fdeed6 100644
--- a/List of things to do.md	
+++ b/List of things to do.md	
@@ -2,6 +2,7 @@ Stardew Valley Server
 
 Praktikum
 
+=======
 Finish setting up sending email:
 - https://wiki.archlinux.org/title/Postfix
 
@@ -25,4 +26,17 @@ Washing
 
 Have a section of my obsidian that can be posted on my blog!
 
-More games with Lisa!
\ No newline at end of file
+More games with Lisa!
+Birthday next weekend
+
+More games with Lisa!
+
+We need to do Karaoke again! (check if they still do it!)
+
+Go to cementing CPL
+
+First Lecture notes ACC / keep up with SC
+
+First Lecture LA / notes on that
+
+answers is fun. Do that.
diff --git a/University/Concepts of Programming Languages/Concepts of Programming Languages Full Notes.md b/University/Concepts of Programming Languages/Concepts of Programming Languages Full Notes.md
new file mode 100644
index 0000000..64ccd32
--- /dev/null
+++ b/University/Concepts of Programming Languages/Concepts of Programming Languages Full Notes.md	
@@ -0,0 +1,40 @@
+# Lecture 1
+Pass / Fail. Friday 10th 23:59
+Pass requires >= 5.0 on every mand. assignment
+There are 6 of these.
+
+Basis: many, do a few /when confused
+Exam Level: Recommended to do all
+Extra: if you are interested
+
+You are going to be making an interpreter. The assignments are kinda big. 6/10 hours / week.
+
+There is a skill circuit.
+
+[Third Edition](https://plai.org)
+Loads of Lecture Notes on WebLab.
+
+## Syntax and Parsing
+
+				  ------------ Semantics -------------------
+Stnax -> Parse -> Abstract Syntax -> Interpret -> Value
+------ Syntax -------------------
+
+Pages on slides (if you want to read them)
+
+### Syntax
+Program Text -> Parse -> Abstract Syntax
+
+Syntax: the arrangment of words and phrases to create well-formed sentences in a language.
+(The syntax is the structure of program phrases in a language)
+
+Abstract Syntax, often comes in tree form, therefore AST.
+
+### Grammars and Disambiguation
+Prioties, for example, associativity, maybe
+or you implement brackets in your language design.
+Or you do it based on the grammar construction
+
+We will use SDF3 grammars. (Context-Free Syntax).
+
+Higher context-free priority, means further down in the tree (i.e. something that has higher prio, it comes further down in the tree as it should be evaluated first.)
diff --git a/University/Functional Programming/Functional Programming Round 2 Full Notes.md b/University/Functional Programming/Functional Programming Round 2 Full Notes.md
index 6e36439..fd65f53 100644
--- a/University/Functional Programming/Functional Programming Round 2 Full Notes.md	
+++ b/University/Functional Programming/Functional Programming Round 2 Full Notes.md	
@@ -116,3 +116,5 @@ filtering lists also works:
 we can select only elements that satisfy a boolean predicate
 `[x | x <- [1..10], even x]`
 
+
+check slides for book -> should mostly be covered though (Lec 1)
\ No newline at end of file
diff --git a/University/Functional Programming/test.hs b/University/Functional Programming/test.hs
index e8c7970..e5ec5e2 100644
--- a/University/Functional Programming/test.hs	
+++ b/University/Functional Programming/test.hs	
@@ -1,4 +1,10 @@
-n =  a `div` length xs
-    where
-        a = 10
-        xs = [1,2,3,4,5]
+
+
+luhnDouble :: Int -> Int
+luhnDouble a = (a * 2) `mod` 9 
+
+luhn :: Int -> Int -> Int -> Int -> Bool
+luhn a b c d = ((sum [luhnDouble a, b, luhnDouble c, d]) `mod` 10) == 0 
+
+luhnFinal :: Int -> Int -> Int -> Int
+luhnFinal a b c = 10 - ((sum [luhnDouble a, b, luhnDouble c]) `mod` 10)