Enough Goofing Off (in a Dopamine Hole), Time to Dive into Hard Tasks Again
The previous post (here) was a digression away from the below, partial flowchart.
Now it's time to explain the details, BEFORE writing the corresponding Python code.
(click on the image to enlarge it, back a page to return to here)
(a) I decided I was going to parse the incoming text into three buffers (sometimes only the first two) using a three state, sequential state machine.
(b) The flow is started at the step labeled "ENTER" (also labeled as number 05b)
(c) In initializing step 05c, we set the State tracker to zero (purely for debug purposes, it's not needed by the algorithm itself)
(c) In initializing step 05c, we set the State tracker to zero (purely for debug purposes, it's not needed by the algorithm itself)
(d) Recall that we have two possible characters that can act as triggers, P3 and/or P4. We initialize the P counts to zero in step 05c.
(e) In step 00 we do a negative test for presence of one of the P3 or P4 triggers. If not present, we loop around and keep dumping the incoming texts into buffer Buff_0.
Comments
Post a Comment