Skip to content

A tutorial example of a simple, minimal implementation of an AST-based expression evaluator in winxed.

Notifications You must be signed in to change notification settings

ayardley/expeval

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 
 
 

Repository files navigation

NAME

parser.winxed - A simple, minimial parser, which will serve as the basis of a minimal abstract syntax tree (AST) based expression evaluator.[*]

SYNOPSIS

    $ winxed parser.winxed

DESCRIPTION

This is a winxed implementation of a simple, minimal parser with which to build a simple, minimal abstract syntax tree (AST) based expression evaluator.[1]

NOTES

[*] This example implementation is, at present, very incomplete.

[1] The purpose of this program is to serve as something of a tutorial on how to write a simple, minimal AST-based expression evaluator in the Winxed programming language.

COPYRIGHT

Copyright (C) 2012, Alvis Yardley

About

A tutorial example of a simple, minimal implementation of an AST-based expression evaluator in winxed.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published