tag:blogger.com,1999:blog-6508797467947601724.post18209943361666309..comments2023-09-16T11:35:50.154-04:00Comments on smuglispweeny: The Foisting of An Infinite State MachineKenny Tiltonhttp://www.blogger.com/profile/17430816457662806163noreply@blogger.comBlogger4125tag:blogger.com,1999:blog-6508797467947601724.post-61132295041293119612015-07-31T09:43:00.241-04:002015-07-31T09:43:00.241-04:00I think the point is that an FSM doesn't have ...I think the point is that an FSM doesn't have a counter. It's just not part of an FSM. An FSM with a counter is more than just an FSM.Antsanhttps://www.blogger.com/profile/16993116520760182498noreply@blogger.comtag:blogger.com,1999:blog-6508797467947601724.post-57320696004896061162009-08-29T01:20:49.182-04:002009-08-29T01:20:49.182-04:00btw, PJB: "You cannot parse s-exps with a FSM...btw, PJB: "You cannot parse s-exps with a FSM. You need a stack machine, or at least, a FSM with a counter."<br /><br />The neat thing here being that the second statement nicely identifies the error in the first statement, so having written the second statement you could have simply gone back and erased the first in which case you could then erase the second. One of those matter/anti-matter deals.Kenny Tiltonhttps://www.blogger.com/profile/17430816457662806163noreply@blogger.comtag:blogger.com,1999:blog-6508797467947601724.post-49901523491935737242009-02-08T11:39:00.000-05:002009-02-08T11:39:00.000-05:00PJB: Well then I must be a god because I managed t...PJB: Well then I must be a god because I managed to do it. Moral: sometimes it helps not knowing what one cannot do.Kenny Tiltonhttps://www.blogger.com/profile/17430816457662806163noreply@blogger.comtag:blogger.com,1999:blog-6508797467947601724.post-47098677743301873852008-12-08T05:23:00.000-05:002008-12-08T05:23:00.000-05:00You cannot parse s-exps with a FSM. You need a st...You cannot parse s-exps with a FSM. You need a stack machine, or at least, a FSM with a counter.<BR/><BR/>Said otherwise, FSM are equivalent to regular expressions, and you cannot parse s-exps with regular expressions, you need a recursive parser.<BR/><BR/>Of course, given than we don't use TM, but finite VN computers, we only deal with FSM, and we don't parse s-exps in general, only s-exps that can be held in our computer memories.<BR/><BR/>But still, it's easier to write a Recursive Descend parser for s-exps than a FSM.Anonymousnoreply@blogger.com