Skip to content
#

grammar

A grammar describes the syntax of a programming language, and might be defined in Backus-Naur form (BNF). A lexer performs lexical analysis, turning text into tokens. A parser takes tokens and builds a data structure like an abstract syntax tree (AST). The parser is concerned with context: does the sequence of tokens fit the grammar? A compiler is a combined lexer and parser, built for a specific grammar.

Here are 603 public repositories matching this topic...

fnlearner
fnlearner commented Apr 10, 2020
  • I have searched the issues of this repository and believe that this is not a duplicate.

Reproduction link

Edit on CodeSandbox

Steps to reproduce

view the diagram in mobile or chorme opening devtool and click the icon of toggling

BizCharts
baarsrj
baarsrj commented Jan 4, 2020

It would be great if simple replace could be made (partly) case sensitive. By this I mean:

  • detect if there is uppercase in part before =
  • if so, change behaviour to suggest check left part case sensitively, and suggest the right parts the same; except for the first token when this is at the start of the sentence
felixvuo
felixvuo commented Dec 18, 2019

I think it would be nice to have the option to dump a raw graphviz DOT file instead of the sppf.png for a few reasons:

  • the file size is a lot smaller
  • it's nice to be able to "do things" with the resulting tree in its structured form, rather than navigate the rendered bitmap
  • it's only one extra (or no extra) line and could be optional, e.g. if you've turned on "debug" mode.

Any though

MTRNord
MTRNord commented Apr 25, 2018

Hi I want to check if the prevoius char is a :. The exact example code I have is this:

Prefix: !

I want basicly to be able to check based on if the previous char is a : the ! should get a string and later reuse the look back logic to check if I am inside an array which is defined like in yaml meaning to make sure the last 2 lines of the following example don't get into the ar

ThomasFrisendal
ThomasFrisendal commented Jul 16, 2018

Introduction

This is a proposal for adding more explicit and extensive, and even ASCII art inspired support for set algebra in openCypher.

In my opinion sets of graphs is a once-in-a-lifetime opportunity that is much more than a revival: Doing set algebra on sets of graphs is potentially several orders of magnitude more powerful than SQL-based set algebra (or the simple lists etc. offered

CIR
Grummfy
Grummfy commented Jun 2, 2017

When I read the following topics http://discourse.hoa-project.net/t/hoa-compiler-keyword-identifier-clash/252 I can understand that namespace permit to avoid collision between namespace but also to isolate each namespace (correct?).

So it could be intresting to add a section in the namespace documentation about that, on the why using namespace and they purpose with a good example ;)

<bountys

You can’t perform that action at this time.