Backus-Naur Form (BNF) is a highly technical representation of an expression or programming language. As such, it describes with detail the inner workings of the Cyrious Formula Language (CFL) engine.
Those not familiar with BNF can skip this section without missing anything. It is provided only as a reference for individuals who might already be familiar with the syntax.
| Field Name | Example | |||||
| IDHead | ('A' … 'Z', 'a' … 'z') | |||||
| IDTail | ('A' … 'Z', 'a' … 'z', '0' … '9', '_') | |||||
| Digit | (0123456789) | |||||
| NumericLiteral | (Digit)* | (Digit)* . (Digit)* | ||||
| Printable | (' ' … '\~') | |||||
| StringLiteral | “(printable)*” | |||||
| :: (SyntaxDeclaration) | ||||||
| :: | 'Spreadsheet' | 'Program' | ||||
| :: ()* | ||||||
| ::'SECTION' SectionName 'ENDSECTION' | ||||||
| :: (; )* | ||||||
| :: | ||||||
| :: 'BEGIN' (;)+ 'END' | ||||||
| :: ':' | ||||||
You could leave a comment if you were logged in.