Talk:S-expressions: Difference between revisions
Content added Content deleted
mNo edit summary |
|||
Line 183: | Line 183: | ||
:::::i removed the list intentionally because i think there are now enough examples of how a native structure might look like. at least the lisp solutions, pike, python and ruby produce directly native results. (for the other languages i can't tell how native lists look like.)--[[User:EMBee|eMBee]] 00:22, 21 October 2011 (UTC) |
:::::i removed the list intentionally because i think there are now enough examples of how a native structure might look like. at least the lisp solutions, pike, python and ruby produce directly native results. (for the other languages i can't tell how native lists look like.)--[[User:EMBee|eMBee]] 00:22, 21 October 2011 (UTC) |
||
== |
== Lisp Solutions == |
||
The lisp solutions demonstrate the steps needed to actually read an s-expression from a string, but for those interested in learning how to write a simple parser in lisp it would also be nice if we could also have solutions that re-implement a parser with basic lisp tools. assume for example the s-expressions are written with [] instead of (). |
|||
how would a parser look like that turns |
how would a parser look like that turns |
||
Line 194: | Line 194: | ||
(data (|!@#| (4.5) "[more" "data]")))</lang> |
(data (|!@#| (4.5) "[more" "data]")))</lang> |
||
and back?--[[User:EMBee|eMBee]] 09:49, 20 October 2011 (UTC) |
and back?--[[User:EMBee|eMBee]] 09:49, 20 October 2011 (UTC) |
||
:Aside from the Python and Ruby implementations, I haven't seen any other languages writing native code back to S-Exps. Perhaps the writer should be spunoff as a separate sub-task? Also, many of the implementations don't show any kind of output. --[[User:Lhignight|Larry Hignight]] 22:28, 22 June 2012 (UTC) |
|||
== TCL native types == |
== TCL native types == |