Difference between revisions of "Nodal syntax highlighting"
m |
|||
| Line 1: | Line 1: | ||
[[Category:Nodal Concepts]] | [[Category:Nodal Concepts]] | ||
Rather than using a syntax highlighting library or creating a static nodal tree of rules, we intend | Rather than using a syntax highlighting library or creating a static nodal tree of rules, we intend | ||
| − | to ''[[borgification|borgify]]'' the language syntaxes directly from the [[w:EBNF|EBNF]] (see [[w:BNF| | + | to ''[[borgification|borgify]]'' the language syntaxes directly from the [[w:EBNF|EBNF]] (see [[w:BNF|Backus–Naur form]]) descriptions which are almost universally used to describe computer language syntax for producing the compilers and interpreters used to execute them. |
Nodal parsing rules can then be maintained directly from the language definitions and then placed within simpler higher level rules within actual program code to allow for multipley embedded language scenarios. | Nodal parsing rules can then be maintained directly from the language definitions and then placed within simpler higher level rules within actual program code to allow for multipley embedded language scenarios. | ||
In the nodal model, this is used for more than just syntax highlighting, its used so that the development environment can make sensible associations to the various kinds of constructs involved, for example to allow function and method calls to link to their implimentations, and to associate them with related documentation and tools. | In the nodal model, this is used for more than just syntax highlighting, its used so that the development environment can make sensible associations to the various kinds of constructs involved, for example to allow function and method calls to link to their implimentations, and to associate them with related documentation and tools. | ||
Revision as of 07:09, 23 October 2006
Rather than using a syntax highlighting library or creating a static nodal tree of rules, we intend to borgify the language syntaxes directly from the EBNF (see Backus–Naur form) descriptions which are almost universally used to describe computer language syntax for producing the compilers and interpreters used to execute them.
Nodal parsing rules can then be maintained directly from the language definitions and then placed within simpler higher level rules within actual program code to allow for multipley embedded language scenarios.
In the nodal model, this is used for more than just syntax highlighting, its used so that the development environment can make sensible associations to the various kinds of constructs involved, for example to allow function and method calls to link to their implimentations, and to associate them with related documentation and tools.
