Compare commits
2 Commits
810c5c4470
...
27b50b6b08
| Author | SHA1 | Date | |
|---|---|---|---|
| 27b50b6b08 | |||
| 1917765561 |
35
.obsidian/workspace.json
vendored
35
.obsidian/workspace.json
vendored
@@ -13,8 +13,8 @@
|
||||
"state": {
|
||||
"type": "markdown",
|
||||
"state": {
|
||||
"file": "WS2425/Web Tech/Übung/2/Ü2.md",
|
||||
"mode": "source",
|
||||
"file": "WS2425/Web Tech/Übung/3/ü3.md",
|
||||
"mode": "preview",
|
||||
"source": false
|
||||
}
|
||||
}
|
||||
@@ -93,7 +93,7 @@
|
||||
"state": {
|
||||
"type": "backlink",
|
||||
"state": {
|
||||
"file": "WS2425/Web Tech/Übung/2/Ü2.md",
|
||||
"file": "WS2425/Web Tech/Übung/3/ü3.md",
|
||||
"collapseAll": false,
|
||||
"extraContext": false,
|
||||
"sortOrder": "alphabetical",
|
||||
@@ -110,7 +110,7 @@
|
||||
"state": {
|
||||
"type": "outgoing-link",
|
||||
"state": {
|
||||
"file": "WS2425/Web Tech/Übung/2/Ü2.md",
|
||||
"file": "WS2425/Web Tech/Übung/3/ü3.md",
|
||||
"linksCollapsed": false,
|
||||
"unlinkedCollapsed": true
|
||||
}
|
||||
@@ -133,7 +133,7 @@
|
||||
"state": {
|
||||
"type": "outline",
|
||||
"state": {
|
||||
"file": "WS2425/Web Tech/Übung/2/Ü2.md"
|
||||
"file": "WS2425/Web Tech/Übung/3/ü3.md"
|
||||
}
|
||||
}
|
||||
},
|
||||
@@ -190,8 +190,6 @@
|
||||
},
|
||||
"left-ribbon": {
|
||||
"hiddenItems": {
|
||||
"obsidian-livesync:Replicate": false,
|
||||
"obsidian-livesync:Show log": false,
|
||||
"switcher:Open quick switcher": false,
|
||||
"graph:Open graph view": false,
|
||||
"canvas:Create new canvas": false,
|
||||
@@ -208,39 +206,25 @@
|
||||
},
|
||||
"active": "8f0d65f1974eff73",
|
||||
"lastOpenFiles": [
|
||||
<<<<<<< HEAD
|
||||
"CCN/Ex02/Exercise 2.md",
|
||||
"CCN/Ex01/Exercise 1.md",
|
||||
"Algorithmen und Datenstrukturen/UEB01/UEB01.md",
|
||||
"CCN/Ex01",
|
||||
"Algorithmen und Datenstrukturen/UEB01",
|
||||
"CCN",
|
||||
"Algorithmen und Datenstrukturen",
|
||||
=======
|
||||
"WS2425/Web Tech/Übung/2/Ü2.md",
|
||||
"WS2425/Web Tech/Übung/3/ü3.md",
|
||||
"WS2425/Web Tech/Übung/3",
|
||||
"WS2425/SWT D/P2.md",
|
||||
"WS2425/SWT D/swtd-p-02.pdf",
|
||||
"WS2425/SWT D/swtd-ue-02.pdf",
|
||||
"WS2425/SWT D/Ue 2.md",
|
||||
"WS2425/Web Tech/Praktikum/Untitled.md",
|
||||
"WS2425/SWT D",
|
||||
>>>>>>> 84b31479197e817700bc02c2141ffd8de7f2982c
|
||||
"WS2425/Web Tech/Übung/1/uebung01.pdf",
|
||||
"WS2425/Web Tech/Praktikum",
|
||||
"WS2425/Web Tech/Übung/1/Ü1.md",
|
||||
"SS24/SWT2/KW19/03_SWT2_Architekturstile_I.pdf",
|
||||
"WS2425/Web Tech/Übung/1",
|
||||
<<<<<<< HEAD
|
||||
"SS24/TdS/Canvas.canvas",
|
||||
"SS24/SWT2/KW19/KW19.md",
|
||||
"SS24/SWT2/KW16/KW16.md",
|
||||
=======
|
||||
"WS2425/Web Tech/Übung",
|
||||
"WS2425/Theoretische Informatik/Blatt0-Einfuehrung (1).pdf",
|
||||
"WS2425/Web Tech",
|
||||
"SS24/TdS/Canvas.canvas",
|
||||
"SS24/SWT2/KW19/KW19.md",
|
||||
"SS24/SWT2/SWT2.canvas",
|
||||
>>>>>>> 84b31479197e817700bc02c2141ffd8de7f2982c
|
||||
"SS24/SWT2/KW17/KW17.md",
|
||||
"SS24/SWT2/KW16/KW16.md",
|
||||
"SS24/SWT2/KW24/KW24.md",
|
||||
@@ -269,7 +253,6 @@
|
||||
"IHK/Selbsttest/Selbsttest Teil 1.md",
|
||||
"WS2324/Untitled.md",
|
||||
"WS2324/Datenbank/Unterricht/13 Tutorium/Aufgaben.md",
|
||||
"WS2324/Datenbank/Unterricht/08. Datenbankanfragen (Teil 2) (28.11.2023)/Praktikum/Aufgaben.md",
|
||||
"SS23/Informationssicherheit/Ueb4/Ueb4.md"
|
||||
"WS2324/Datenbank/Unterricht/08. Datenbankanfragen (Teil 2) (28.11.2023)/Praktikum/Aufgaben.md"
|
||||
]
|
||||
}
|
||||
47
WS2425/Web Tech/Übung/3/ü3.md
Normal file
47
WS2425/Web Tech/Übung/3/ü3.md
Normal file
@@ -0,0 +1,47 @@
|
||||
### Aufgabe 1: Beispiele für den regulären Ausdruck `[A-Z]{1,4}#+[123]?`
|
||||
|
||||
#### Erklärungen
|
||||
- `[A-Z]{1,4}`: Ein bis vier Großbuchstaben (z.B. A, B, Z, AB, XYZ).
|
||||
- `#+`: Ein oder mehrere `#`-Zeichen.
|
||||
- `[123]?`: Optional eine Ziffer, wobei es sich um eine der Ziffern `1`, `2` oder `3` handeln kann.
|
||||
|
||||
#### Gültige Wörter:
|
||||
1. `A##`
|
||||
2. `XYZ#1`
|
||||
3. `ABCD###3`
|
||||
|
||||
#### Ungültige Wörter:
|
||||
1. `abc#` (enthält Kleinbuchstaben, die nicht erlaubt sind)
|
||||
2. `ABCDE#` (mehr als vier Großbuchstaben)
|
||||
3. `AB##4` (enthält die Ziffer `4`, die nicht erlaubt ist)
|
||||
|
||||
### Aufgabe 2: Regulärer Ausdruck für gültige und ungültige Wörter
|
||||
|
||||
#### Gültige Wörter:
|
||||
1. `TicTicTicTac`
|
||||
2. `TicToc`
|
||||
3. `TicTicTocTac`
|
||||
4. `TicTacToc`
|
||||
|
||||
#### Ungültige Wörter:
|
||||
1. `TacTic`
|
||||
2. `TicTicTicTic`
|
||||
3. `TocTacTac`
|
||||
4. `Tic`
|
||||
|
||||
#### Regulärer Ausdruck:
|
||||
Ein möglicher regulärer Ausdruck, der die gültigen Wörter abdeckt und die ungültigen ausschließt, lautet:
|
||||
```
|
||||
^Tic(Tac|Toc|TicTac|TicToc)+$
|
||||
```
|
||||
|
||||
#### Erklärung:
|
||||
- `^` und `$` markieren den Anfang und das Ende des Wortes.
|
||||
- `Tic` muss immer zu Beginn stehen.
|
||||
- Danach darf nur eine Folge von:
|
||||
- `Tac`
|
||||
- `Toc`
|
||||
- `TicTac`
|
||||
- `TicToc`
|
||||
|
||||
vorkommen, und dies mindestens einmal, um alle gültigen Wörter zu erfassen.
|
||||
Reference in New Issue
Block a user