25:["$","title",null,{"children":"Matching Many Elements | Prathyush | Observable"}] 49:[] 29:{"id":"f69265e0c3b030e0","slug":null,"title":"Matching Many Elements","thumbnail":"638791a9acf0960ba00228ae053ea7a1007f484c4db62db201a90fb2cf46e73c","access_level":"public","create_time":"$D2023-04-04T23:26:46.403Z","update_time":"$D2023-08-06T19:07:48.990Z","view_time":null,"first_public_time":"$D2023-04-04T23:26:46.403Z","has_unpublished_edits":null,"fork":false,"stars":0,"starred":false,"owner":{"type":"team","id":"f33b22c086eea27f","login":"prathyvsh","name":"Prathyush","avatar_url":"https://avatars-next.observableusercontent.com/209a242aa240743240b9c0771686a44ba1950fce32c6180ced0d42027f5ab246","tier":"starter_2024","bio":"Software Designer","followed_by_you":false,"follows_you":false},"version":259,"publish_version":null,"role":null,"authored":false,"authors":[{"type":"individual","id":"3b0d270e1b775ddf","login":"prathyvsh","name":"Prathyush","avatar_url":"https://avatars-next.observableusercontent.com/209a242aa240743240b9c0771686a44ba1950fce32c6180ced0d42027f5ab246","tier":null,"bio":"Software Designer","followed_by_you":false,"follows_you":false}],"members":[{"type":"individual","id":"3b0d270e1b775ddf","login":"prathyvsh","name":"Prathyush","avatar_url":"https://avatars-next.observableusercontent.com/209a242aa240743240b9c0771686a44ba1950fce32c6180ced0d42027f5ab246","tier":null,"role":"editor"}],"comments":[],"custom_thumbnail":false,"trashed":false,"lapsed":null,"subscribed":null,"forks":0,"collection":null,"type":"notebook","body":{"titling":"auto","title":"Matching Many Elements","cells":[{"id":0,"value":"# Matching Many Elements","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":5,"value":"many = (p) => ({input, cursor}) => {\n \n let result = \"\";\n let cursorLoc = cursor;\n\n while(cursorLoc < input.length) {\n\n let {ast, cursor: newCursor, error, reason} = p({input, cursor: cursorLoc});\n\n if(error) break;\n\n cursorLoc = newCursor;\n\n result += ast;\n \n }\n \n if(result === \"\") return error({reason: \"Couldn’t parse with many predicates\", input, cursor: cursorLoc});\n \n return {ast: result, input, cursor: cursorLoc};\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":21,"value":"zero = char(\"0\");","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":23,"value":"one = char(\"1\");","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":25,"value":"parse(many(zero), \"00000\");","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":33,"value":"parse(many(one), \"11110000\");","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":71,"value":"parse(or(many(zero), many(one)), \"000111\");","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":75,"value":"parse(many(or(zero,one)),\"01010101102\");","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":82,"value":"bit = or(zero,one);","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":85,"value":"bits = many(bit);","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":120,"value":"ops = or(char(\"+\"), char(\"*\"));","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":78,"value":"parse(seq(bits, ops, bits), \"0+1\");","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":113,"value":"// or(all(bit, plus, bit), all(bit, times, bit)) vs. all(bit, bitOps, bit)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":96,"value":"

It would be great if I can write (0 | 1) (+ | *) (0 | 1) and get a parser out of it. Also, it would be great if I can apply a natural language style (many (or 0 1) (or + *) (or 0 1)) style composition here.

","pinned":true,"hidden":false,"mode":"html","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":100,"value":"

Or even better if I can code it as:\n \n \n

\n    binary:= \"0\" | \"1\"\n    op:= \"+\" | \"*\"\n    whitespace:= \" \"*\n    expr:= binary * binary * op * whitespace * binary\n    start: expr

\n \n\n as a DSL to get the parser out\n

","pinned":false,"hidden":false,"mode":"html","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":73,"value":"parse(and(many(one), many(zero)), \"111000\");","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":134,"value":"seq = (...parsers) => parsers.reduce((acc, n) => and(acc, n), success); // What is a good base case here?\n","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":146,"value":"any = (...parsers) => parsers.reduce((acc, n) => or(acc, n), success);","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":148,"value":"str = p => ({input, cursor}) => input.startsWith(p, cursor) ? ({ast: p, input, cursor: cursor + p.length}) : error({reason: \"String: \" + p + \" doesn’t match\", input, cursor});","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":162,"value":"whitespace = skip(many(char(\" \")));","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":156,"value":"parse(seq(or(str(\"let\"), str(\"const\")), whitespace, str(\"var\"), whitespace, str(\"=\"), whitespace, bit), \"let var = 1\");","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":177,"value":"skip = (p) => ({input, cursor}) => success({input, cursor: p({input, cursor}).cursor}) // Should I use seqMap here? What are the other ways to implement it?","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":13,"value":"import { error, or, and, char, parse, success } from \"@prathyvsh/simple-combinatory-parsing\";","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"}],"files":"$W49","stdlib":"1"}} 24:null