blob: 44e241a1bdbc3809631d2aa0b78158a818cc06d7 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
|
2023-01-22 Jean Sévère Durand <durand@jsdurand.xyz>
* forest: Correctly clone nodes.
Now the forest can detect if a node is packed or cloned, and
correctly clones a node in those circumstances. But it still
needs to be tested.
2023-01-20 Jean Sévère Durand <durand@jsdurand.xyz>
* chain: A prototype is added, and passes some tests. But I am
still testing if its performance meets the time complexity
requirement.
2023-01-13 Jean Sévère Durand <durand@jsdurand.xyz>
* forest: A prototype is completed, and passes some tests.
2022-11-15 Jean Sévère Durand <durand@jsdurand.xyz>
* nfa: Stop worrying about monadic anamorphisms.
I was trying to design a way to use monadic anamorphisms to build
and parse regular expressions. But, after some more thoughts, I
can only think about implementations that affect the performance
and are quite specifically tailored to my use-cases. This means
the design is neither efficient nor generic. So what is the use
of it anyways?
In the end, I decided to mildly generalize my usual pattern of
recursive descent parsing. After all, my current focus is to
implement a version of NFA that can show me derivatives of the
atomic languages in a human-friendly and easy-to-use way. This
will help me catch errors in my algorithms.
2022-11-13 Jean Sévère Durand <durand@jsdurand.xyz>
* gnu-standards: Add basic files required by the GNU standard.
|
