• Announcements

    • khawk

      Download the Game Design and Indie Game Marketing Freebook   07/19/17

      GameDev.net and CRC Press have teamed up to bring a free ebook of content curated from top titles published by CRC Press. The freebook, Practices of Game Design & Indie Game Marketing, includes chapters from The Art of Game Design: A Book of Lenses, A Practical Guide to Indie Game Marketing, and An Architectural Approach to Level Design. The GameDev.net FreeBook is relevant to game designers, developers, and those interested in learning more about the challenges in game development. We know game development can be a tough discipline and business, so we picked several chapters from CRC Press titles that we thought would be of interest to you, the GameDev.net audience, in your journey to design, develop, and market your next game. The free ebook is available through CRC Press by clicking here. The Curated Books The Art of Game Design: A Book of Lenses, Second Edition, by Jesse Schell Presents 100+ sets of questions, or different lenses, for viewing a game’s design, encompassing diverse fields such as psychology, architecture, music, film, software engineering, theme park design, mathematics, anthropology, and more. Written by one of the world's top game designers, this book describes the deepest and most fundamental principles of game design, demonstrating how tactics used in board, card, and athletic games also work in video games. It provides practical instruction on creating world-class games that will be played again and again. View it here. A Practical Guide to Indie Game Marketing, by Joel Dreskin Marketing is an essential but too frequently overlooked or minimized component of the release plan for indie games. A Practical Guide to Indie Game Marketing provides you with the tools needed to build visibility and sell your indie games. With special focus on those developers with small budgets and limited staff and resources, this book is packed with tangible recommendations and techniques that you can put to use immediately. As a seasoned professional of the indie game arena, author Joel Dreskin gives you insight into practical, real-world experiences of marketing numerous successful games and also provides stories of the failures. View it here. An Architectural Approach to Level Design This is one of the first books to integrate architectural and spatial design theory with the field of level design. The book presents architectural techniques and theories for level designers to use in their own work. It connects architecture and level design in different ways that address the practical elements of how designers construct space and the experiential elements of how and why humans interact with this space. Throughout the text, readers learn skills for spatial layout, evoking emotion through gamespaces, and creating better levels through architectural theory. View it here. Learn more and download the ebook by clicking here. Did you know? GameDev.net and CRC Press also recently teamed up to bring GDNet+ Members up to a 20% discount on all CRC Press books. Learn more about this and other benefits here.
Sign in to follow this  
Followers 0
assainator

Trouble in building parser for compiler.

3 posts in this topic

Hello all,
 
I have a question related to parsing in a compiler. I'm having troubles comming up with a proper approach to parse certain statements.
For example, take this grammar:
 
A:= literal | variable
B:= '+' | '-'
C_1:= A
C_2:= C, B, C
C_3:= '(', C, ')'
C = C_1 | C_2 | C_3
D:= 'return', C, ';'
 
example of parsable code:
return (5+a) - 3;
 
My question is, what approach can I best to convert these rules into functions?
My main concern is, how do I make sure that for "return 3 + 5;" the proper rules (D and C_2) are used?
After having started D, thus encountering the token '3', C_1 is also satisfactory. But then the parser encounters '+' instead of the expected ';'.
 
I would like to write this myself for learning purposes so parser generators like yacc/bison are a no go.
 
Every time I think I came up with something I end up with a function so long and ugly (and non operational) that I can't help but think I'm missing something. Does anyone have some pointers?
 
Thanks a lot in advance.
0

Share this post


Link to post
Share on other sites

Personally - I know this is going to be unpopular - I suggest to not think at the grammar at all.

There has been a time in the past in which I was all around BNF and stuff. My last parser has been going for a while now and I still have no explicitly written grammar.

 

 


how do I make sure that for "return 3 + 5;" the proper rules (D and C_2) are used?

I'd do first a keyword match - just for stuff as for, which got pretty odd syntax for example. In this case we match return.

Then we find a literal. Looking ahead 1 token (the whole point of LR) we find a + token which is recognized as a operator. It's a binary op because we found it after a literal, so we fetch something else. The point is: don't be greedy! Don't switch just because you matched now

At this point we have this expression parsed: the compiler will have to find what 3 and 5 are so it can emit proper ADD instruction.

I actually do expression assembly in the compiler, someone could say because of poor design.


Every time I think I came up with something I end up with a function so long and ugly (and non operational) that I can't help but think I'm missing something. Does anyone have some pointers?

Are you trying to parse and compile at the same time? This will end in tears in my experience. Pre-tokenization is a must in my opinion (and no, I don't care about what GCC/CompilerX does).

Object orientation might help you - in my experience this comes at a negligible cost for example you can have a loop "by keyword match" which is very compact and yet dispatches the correct syntax without visible ifs. You'll need to provide a set of basic compiler features such as type lookup. I've done this successfully with an base interface.

Performance wise, I once had... a problem with my data import routines. So I made a Notepad++ script which would encode all that data in a program... which turned out like 3000 lines long. It took a while to process (like 10 secs) but it was acceptable as a band-aid solution.

 

edit: two small clarifications.

Edited by Krohm
1

Share this post


Link to post
Share on other sites

how do I make sure that for "return 3 + 5;" the proper rules (D and C_2) are used?

Looking ahead 1 token (the whole point of LR) we find a + token which is recognized as a operator. It's a binary op because we found it after a literal, so we fetch something else. The point is: don't be greedy! Don't switch just because you matched now

Thanks, that was my main thought-problem. For some reason, the idea of simply looking ahead didn't come to mind.

As for my 'long and ugly code', looking ahead makes the code a lot simpler.

 

Nypyren: Thanks for the links, I had read them before, but only in a theoretical context. Now I've read them in a practical context, thanks.

0

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!


Register a new account

Sign in

Already have an account? Sign in here.


Sign In Now
Sign in to follow this  
Followers 0