I would like to move data back and fourth between clojure applications. Application settings and some state information. I can not decide between using xml or s-expressions, what do you think pros and cons of each approach? ...
what is the main differences between syntax language and s-expressions language ? does using s-expressions affects compiling time (in the parsing process) or does it bring any advantage to the language ? ...
I want to write C in s-expressions and use compile-time macros. Does anybody know of anything that does this? It should translate the s-expressions into standard C. ...
I would like to export from Org-Mode tables to s-expressions. | first | second | thrid | |--------+--------+--------| | value1 | value2 | value3 | | value4 | value5 | value6 | Would turn into: ((:FIRST "value1" :SECOND "value2" :THIRD "value3") (:FIRST "value4" :SECOND "value5" :THIRD "value6")) I plan on writing such a setup if...
What is a good way to evaluate the (+ 100 (+ 100 100)) part in (+ (+ 1 2) (+ 100 (+ 100 100))) ? For now, I do it by C-x C-e, which means I need to locate the ending parenthesis, which is difficult in most cases. Options > Paren Matching Highlighting helps, but still I need to move the cursor toward the ending parenthesis until the h...
How come most Lisps and Schemes are dynamically typed? Does static typing not mix with some of their common features? ...
I'm working with a service that provides data as a Lisp-like S-Expression string. This data is arriving thick and fast, and I want to churn through it as quickly as possible, ideally directly on the byte stream (it's only single-byte characters) without any backtracking. These strings can be quite lengthy and I don't want the GC churn ...
Can you name language with Static Type checking(like Java) and where Code is Data(like in LISP)? I mean both things in one language. ...
Hello, I was trying to parse simple Lisp/scheme-like code E.g. (func a (b c d) ) and build a tree from it, I could do the parsing in C without using bison (i.e, using only flex to return tokens and building the tree with recursion). But, with bison grammar, I am not sure where to add the code to build the list (i.e, which rule to...
Are there any python modules available for parsing and manipulating symbolic expressions in Python similar to how Lisp expressions are evaluated? ...
I am trying to evaluate a list that represents an expression in prefix notation. Here is an example of such a list: [+, [sin, 3], [- 10 5]] What is the best way to evaluate the value of the list ...
Hello stackoverflow, I have a python function that takes a string s-expression like "(add (sub 10 5) 5)", where "add" and "sub" are actually image processing functions, and evaluates and creates the image represented in the string. The image processing functions take constants, variables, or other images (represented as lists of vectors...
I was reading XML is not S-Expressions. XML scoping is kind of strict, as are S-expressions. And in every programming language I've seen, you can't have the following: <b>BOLD <i>BOTH </b>ITALIC</i> == BOLD BOTH ITALIC It's not even expressible with S-Expressions: (bold "BOLD" (italic "BOTH" ) "ITALIC" ) == :( Does any programming l...
I've been playing around with natural language parse trees and manipulating them in various ways. I've been using Stanford's Tregex and Tsurgeon tools but the code is a mess and doesn't fit in well with my mostly Python environment (those tools are Java and aren't ideal for tweaking). I'd like to have a toolset that would allow for easy ...
Hi all, I am working on gcrypt library and want to generate public/private key pair in C under linux environment. I want to use S-expressions for this. I have read the reference manuals which gives some idea about the functions which can be used but not very sure how to use it. Can someone point me to good sources or some sample codes ...