{
  "id": 20099071,
  "title": "Parsing nested lists in BQN",
  "url": "https://urgent.news/2026/11/15/parsing-nested-lists-in-bqn",
  "topic": "tech",
  "section": "Tech",
  "published": "2026-11-15T01:59:26.000Z",
  "source": {
    "name": "Lobsters",
    "slug": "lobsters",
    "url": "https://saltysylvi.github.io/blog/parsing-nested-lists-in-bqn.html"
  },
  "original_language": "en",
  "account": "Three methods are presented for parsing nested lists from Advent of Code 2022 day 13 in BQN. The first approach, known as cheating, utilizes the •BQN function to handle the heavy lifting. The second method involves writing a conventional recursive descent parser. The third method employs an array-style parser. Benchmarks are conducted to compare the performance of the three approaches. The data is tested using a file containing the Advent of Code input.",
  "summary": null,
  "key_points": [
    "Three methods presented for parsing nested lists in BQN",
    "Cheating method uses •BQN function to handle heavy lifting",
    "Benchmarks compare performance of three parsing approaches"
  ],
  "editors_take": "Comparing recursive descent against array-style parsing in BQN demonstrates how different functional programming paradigms trade implementation simplicity for computational efficiency when handling complex nested data structures.",
  "illustration": null,
  "coverage": {
    "outlets": 1,
    "also_reported_by": []
  },
  "ai_generated": true,
  "disclaimer": "Summaries, key points and the editor’s take are written by software from other outlets’ reporting and may contain errors — always check the linked original."
}