Document Object Model (DOM) Level 3 Core Specification¶
World Wide Web Consortium. (2004). Document Object Model (DOM) Level 3 Core Specification.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Abstract Syntax Tree
- . Language tooling — linters, formatters, refactoring engines, syntax highlighters, and static-analysis and security tools, each written once against the uniform tree and composed, pattern-matching node shapes or pretty-printing back to source. Expression evaluation — calculators and spreadsheet formula engines that parse a formula to a tree and evaluate it bottom-up, supporting formatting and dependency tracking off the same structure. Query planning — SQL and similar query languages parsed to an AST before optimization, the planner transforming the tree rather than the query text. Symbolic-mathematics systems — computer-algebra engines that represent and rewrite expressions as trees of operators and operands. Markup and document processing — the HTML/XML DOM, the LaTeX tree, the Markdown AST, and pandoc's intermediate representation: the identical idea applied to a document grammar
This sourceW3C DOM Core specification defining the document as a tree of typed nodes (elements, text nodes, comments, processing instructions) with explicit parent/child relations.
Supported in partVerified against the source
- . Language tooling — linters, formatters, refactoring engines, syntax highlighters, and static-analysis and security tools, each written once against the uniform tree and composed, pattern-matching node shapes or pretty-printing back to source. Expression evaluation — calculators and spreadsheet formula engines that parse a formula to a tree and evaluate it bottom-up, supporting formatting and dependency tracking off the same structure. Query planning — SQL and similar query languages parsed to an AST before optimization, the planner transforming the tree rather than the query text. Symbolic-mathematics systems — computer-algebra engines that represent and rewrite expressions as trees of operators and operands. Markup and document processing — the HTML/XML DOM, the LaTeX tree, the Markdown AST, and pandoc's intermediate representation: the identical idea applied to a document grammar
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:e0032b0f311b · see in the full table