Skip to content
#

ast

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 93 public repositories matching this topic...

kodonnell
kodonnell commented May 12, 2019

I'm trying to learn more about astroid - in particular inference - so I can (try to) help speed things up. However, I can't seem to find any higher level discussion of what's going on (e.g. "why do we need contexts? call contexts? why is the cache key (...)?" etc.). This issue is to request that this be provided in a "developer/contributors guide", along with maybe some examples of particular poin

okomarov
okomarov commented Jan 28, 2020

I am looking at the example for how to create Object Models and leverage walkers.

The docs are out of date there too as the model now does not explicitly produce the __init__()s:

#!/usr/bin/env python
# -*- coding: utf-8 -*-

# CAVEAT UTILITOR
#
# This file was automatically generated by TatSu.
#
#    
You can’t perform that action at this time.