Difference between revisions of "S-expression"
Jump to navigation
Jump to search
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
{{WikiEntry|key=S-expression|qCode=1113529}} | {{WikiEntry|key=S-expression|qCode=1113529}} short for [[symbolic expression]], abbreviated as '''sexpr''' or '''sexp''', is a computable data serialization format. In programming practice, [[S-expression]] is often denoted in the [[Backus-Naur Form]]. | ||
In [[computer programming]], an [[S-expression]] is an expression in a like-named notation for nested [[List (computing)|list]] ([[Tree (data structure)|tree]]-structured) data. [[S-expression]]s were invented for and popularized by the programming language [[Lisp (programming language)|Lisp]], which uses them for [[source code]] as well as data. | In [[computer programming]], an [[S-expression]] is an expression in a like-named notation for nested [[List (computing)|list]] ([[Tree (data structure)|tree]]-structured) data. [[S-expression]]s were invented for and popularized by the programming language [[Lisp (programming language)|Lisp]], which uses them for [[source code]] as well as data. | ||
Latest revision as of 12:27, 13 May 2022
S-expression(Q1113529) short for symbolic expression, abbreviated as sexpr or sexp, is a computable data serialization format. In programming practice, S-expression is often denoted in the Backus-Naur Form.
In computer programming, an S-expression is an expression in a like-named notation for nested list (tree-structured) data. S-expressions were invented for and popularized by the programming language Lisp, which uses them for source code as well as data.