May 10 Learn » Re: moving from classical lex/yacc to pegged parser | |||
|---|---|---|---|
| |||
...spec, and Pegged will drop the needless nodes for you. Or do the reverse, use... | |||
May 04 Announce » Redub v1.3.9 : A faster build system promising 90% compatibility with dub | |||
|---|---|---|---|
| |||
...finish implementation now only will traverse unvisited nodes - Fixed: Now elements with subConfigurations which aren... | |||
April 03 Announce » D Language Foundation January 2024 Quarterly Meeting Summary | |||
|---|---|---|---|
| |||
...out the member functions that mutate AST nodes so that they could be made immutable... | |||
March 27 Announce » D Language Foundation December 2023 Monthly Meeting Summary | |||
|---|---|---|---|
| |||
...the semantic routines out of the AST nodes, and that had been annoying Iain very... | |||
March 04 Announce » D Language Foundation October/November 2023 Planning Updates | |||
|---|---|---|---|
| |||
...the AST nodes so that `ASTBase` will only contain imports of AST nodes as opposed... | |||
February 22 Announce » DMD Compiler as a Library: A Call to Arms | |||
|---|---|---|---|
| |||
...working through a refactoring of the AST nodes in the DMD codebase. This is a... | |||
February 15, 2024 Learn » Circular enum member references in UDAs | |||
|---|---|---|---|
| |||
...I can think of that the graph-nodes and the graph-edges are declared separately... | |||
February 08, 2024 General » Re: Introduce a New DRuntime Hook Lowering Pass to Unify the Logic for All Hooks | |||
|---|---|---|---|
| |||
Indeed. Counting the nodes that require lowering in larger codebases (like phobos for example) might... | |||
February 09, 2024 General » Re: Introduce a New DRuntime Hook Lowering Pass to Unify the Logic for All Hooks | |||
|---|---|---|---|
| |||
...solution than an array to store the nodes. It depends how often lowering has to... | |||
February 08, 2024 General » Introduce a New DRuntime Hook Lowering Pass to Unify the Logic for All Hooks | |||
|---|---|---|---|
| |||
...would be enough to just store the nodes that require lowerings in an array so... | |||
Copyright © 1999-2021 by the D Language Foundation