Thank you for your interest. I note that your "about" mentions the Y-combinator Ξ»π.(Ξ»π₯.π(π₯π₯ π₯))(Ξ»π₯.π(π₯ π₯)) and I would be happy to have your opinion on this page http://lambdaway.free.fr/lambdawalks/?view=lambda_calculus2
And about your question I will say that I didn't know that it was impossible (Chomsky & Co) to parse s-expressions with regular expressions and, thanks to StevenLevithan, I built one. And definitely, at least for me, the standard way using an AST doesn't fit my needs, as you could see here http://lambdaway.free.fr/lambdawalks/?view=lambdacode.
Comments
Thank you for your interest. I note that your "about" mentions the Y-combinator Ξ»π.(Ξ»π₯.π(π₯π₯ π₯))(Ξ»π₯.π(π₯ π₯)) and I would be happy to have your opinion on this page http://lambdaway.free.fr/lambdawalks/?view=lambda_calculus2
And about your question I will say that I didn't know that it was impossible (Chomsky & Co) to parse s-expressions with regular expressions and, thanks to StevenLevithan, I built one. And definitely, at least for me, the standard way using an AST doesn't fit my needs, as you could see here http://lambdaway.free.fr/lambdawalks/?view=lambdacode.