Zeitpunkt Nutzer Delta Tröts TNR Titel Version maxTL Di 30.07.2024 00:01:04 3.753 0 357.082 95,1 Dresden.Network 4.2.10 1.000 Mo 29.07.2024 00:00:20 3.753 0 356.560 95,0 Dresden.Network 4.2.10 1.000 So 28.07.2024 00:01:04 3.753 +1 356.087 94,9 Dresden.Network 4.2.10 1.000 Sa 27.07.2024 00:01:01 3.752 0 355.608 94,8 Dresden.Network 4.2.10 1.000 Fr 26.07.2024 00:01:05 3.752 +1 355.019 94,6 Dresden.Network 4.2.10 1.000 Do 25.07.2024 00:01:03 3.751 0 354.614 94,5 Dresden.Network 4.2.10 1.000 Mi 24.07.2024 00:01:04 3.751 0 354.179 94,4 Dresden.Network 4.2.10 1.000 Di 23.07.2024 00:01:03 3.751 0 353.741 94,3 Dresden.Network 4.2.10 1.000 Mo 22.07.2024 00:01:07 3.751 0 353.223 94,2 Dresden.Network 4.2.10 1.000 So 21.07.2024 00:01:04 3.751 0 352.756 94,0 Dresden.Network 4.2.10 1.000
शून्यता (@wigalois) · 04/2022 · Tröts: 4.519 · Folger: 63
Di 30.07.2024 16:41
Programs based on patterns are much easier to understand, much less error prone, and can be much more compact. For instance, having a pattern embedded in a pattern can be equivalent to nested loops in the more conventional languages, e.g.
| list --> [ == [sentence == i ??verbphrase you == ] == ]
Here LIST is a list of lists, and it is to be searched for a list starting with the word "sentence". That list is then to be searched for a set of words occurring between "I" and "YOU", and the list of all those words assigned to VERBPHRASE. Try writing that in your favourite language. (a s) #POPLOG #POP11
[Öffentlich] Antw.: 0 Wtrl.: 0 Fav.: 0