Parsers Presentation - Revision history

Egge: /* Parser Presentation for ThoughtWorks Oz Team Hug June 2007 */

2007-09-30T12:28:03Z

Parser Presentation for ThoughtWorks Oz Team Hug June 2007

← Older revision		Revision as of 12:28, 30 September 2007
Line 19:		Line 19:
	In this presentation, I'll show some real life examples where parser generators have saved time and increased simplicity. Here are some of the examples I'll be going into:		In this presentation, I'll show some real life examples where parser generators have saved time and increased simplicity. Here are some of the examples I'll be going into:
	* '''[[copybook parser]]''' - On this project we needed to interface with a COBOL mainframe using it's copybook format. Instead of crafting our message code by hand, I wrote a parser which took in the copy book format and generated Java code which could compose the messages.		* '''[[copybook parser]]''' - On this project we needed to interface with a COBOL mainframe using it's copybook format. Instead of crafting our message code by hand, I wrote a parser which took in the copy book format and generated Java code which could compose the messages.
	* '''code quality''' - PMD/Checkstyle can detect all sorts of patterns in your code. I've been collaborating on a project which detects code duplication using Abstract Syntax Trees.		* '''code quality''' - PMD/Checkstyle can detect all sorts of patterns in your code. I've been collaborating on a project which [[http://www.ohloh.net/projects/6693?p=same-code-duplication-detector detects code duplication using Abstract Syntax Trees]].
	* '''analytics DSL''' - Having a trading systems analytics all written in a DSL provided a number of advantages over directly implementing them in a general programming languages. One of the interesting abilities in this system was being able to do a topology dependency sort. This is similar to how Excel knows what cells in needs to recompute when you make a change, and in what order to do the computations.		* '''analytics DSL''' - Having a trading systems analytics all written in a DSL provided a number of advantages over directly implementing them in a general programming languages. One of the interesting abilities in this system was being able to do a topology dependency sort. This is similar to how Excel knows what cells in needs to recompute when you make a change, and in what order to do the computations.
	* '''[[regex reuse]]''' - Normalizing bond quotes in hundreds of different formats soon created more regular expressions than could be figured out. By migrating to a system built using a parser generator reduced the maintainability of the code.		* '''[[regex reuse]]''' - Normalizing bond quotes in hundreds of different formats soon created more regular expressions than could be figured out. By migrating to a system built using a parser generator reduced the maintainability of the code.

	Download [[http://www.theeggeadventure.com/2007/Parser%20Presentation.pdf full presentation (pdf)]]		Download [[http://www.theeggeadventure.com/2007/Parser%20Presentation.pdf full presentation (pdf)]]

Egge at 12:23, 30 September 2007

2007-09-30T12:23:56Z

← Older revision		Revision as of 12:23, 30 September 2007
Line 5:		Line 5:
	Presentation Type: '''Technical'''		Presentation Type: '''Technical'''

	Material used: '''~~Dead trees'''~~		Material used: '''Keynote'''

	~~Projector/white board: '''Not required~~'''

	Length: '''55 minutes'''		Length: '''55 minutes'''

Brianegge at 07:16, 16 June 2007

2007-06-16T07:16:42Z

← Older revision		Revision as of 07:16, 16 June 2007
Line 25:		Line 25:
	* '''[[regex reuse]]''' - Normalizing bond quotes in hundreds of different formats soon created more regular expressions than could be figured out. By migrating to a system built using a parser generator reduced the maintainability of the code.		* '''[[regex reuse]]''' - Normalizing bond quotes in hundreds of different formats soon created more regular expressions than could be figured out. By migrating to a system built using a parser generator reduced the maintainability of the code.

	Download [[~~Media~~:~~parser_presentation~~.pdf\|full presentation]]		Download [[http://www.theeggeadventure.com/2007/Parser%20Presentation.pdf full presentation (pdf)]]

Brianegge at 03:27, 15 June 2007

2007-06-15T03:27:25Z

← Older revision		Revision as of 03:27, 15 June 2007
Line 24:		Line 24:
	* '''analytics DSL''' - Having a trading systems analytics all written in a DSL provided a number of advantages over directly implementing them in a general programming languages. One of the interesting abilities in this system was being able to do a topology dependency sort. This is similar to how Excel knows what cells in needs to recompute when you make a change, and in what order to do the computations.		* '''analytics DSL''' - Having a trading systems analytics all written in a DSL provided a number of advantages over directly implementing them in a general programming languages. One of the interesting abilities in this system was being able to do a topology dependency sort. This is similar to how Excel knows what cells in needs to recompute when you make a change, and in what order to do the computations.
	* '''[[regex reuse]]''' - Normalizing bond quotes in hundreds of different formats soon created more regular expressions than could be figured out. By migrating to a system built using a parser generator reduced the maintainability of the code.		* '''[[regex reuse]]''' - Normalizing bond quotes in hundreds of different formats soon created more regular expressions than could be figured out. By migrating to a system built using a parser generator reduced the maintainability of the code.

			Download [[Media:parser_presentation.pdf\|full presentation]]

Brianegge at 06:51, 2 June 2007

2007-06-02T06:51:31Z

← Older revision		Revision as of 06:51, 2 June 2007
Line 23:		Line 23:
	* '''code quality''' - PMD/Checkstyle can detect all sorts of patterns in your code. I've been collaborating on a project which detects code duplication using Abstract Syntax Trees.		* '''code quality''' - PMD/Checkstyle can detect all sorts of patterns in your code. I've been collaborating on a project which detects code duplication using Abstract Syntax Trees.
	* '''analytics DSL''' - Having a trading systems analytics all written in a DSL provided a number of advantages over directly implementing them in a general programming languages. One of the interesting abilities in this system was being able to do a topology dependency sort. This is similar to how Excel knows what cells in needs to recompute when you make a change, and in what order to do the computations.		* '''analytics DSL''' - Having a trading systems analytics all written in a DSL provided a number of advantages over directly implementing them in a general programming languages. One of the interesting abilities in this system was being able to do a topology dependency sort. This is similar to how Excel knows what cells in needs to recompute when you make a change, and in what order to do the computations.
	* '''~~email quotes~~''' - Normalizing bond quotes in hundreds of different formats soon created more regular expressions than could be figured out. By migrating to a system built using a parser generator reduced the maintainability of the code.		* '''[[regex reuse]]''' - Normalizing bond quotes in hundreds of different formats soon created more regular expressions than could be figured out. By migrating to a system built using a parser generator reduced the maintainability of the code.

Brianegge: /* Parser Presentation for ThoughtWorks Oz Team Hug June 2007 */

2007-06-02T05:50:04Z

Parser Presentation for ThoughtWorks Oz Team Hug June 2007

← Older revision		Revision as of 05:50, 2 June 2007
Line 20:		Line 20:

	In this presentation, I'll show some real life examples where parser generators have saved time and increased simplicity. Here are some of the examples I'll be going into:		In this presentation, I'll show some real life examples where parser generators have saved time and increased simplicity. Here are some of the examples I'll be going into:
	* '''copybook parser''' - On this project we needed to interface with a COBOL mainframe using it's copybook format. Instead of crafting our message code by hand, I wrote a parser which took in the copy book format and generated Java code which could compose the messages.		* '''[[copybook parser]]''' - On this project we needed to interface with a COBOL mainframe using it's copybook format. Instead of crafting our message code by hand, I wrote a parser which took in the copy book format and generated Java code which could compose the messages.
	* '''code quality''' - PMD/Checkstyle can detect all sorts of patterns in your code. I've been collaborating on a project which detects code duplication using Abstract Syntax Trees.		* '''code quality''' - PMD/Checkstyle can detect all sorts of patterns in your code. I've been collaborating on a project which detects code duplication using Abstract Syntax Trees.
	* '''analytics DSL''' - Having a trading systems analytics all written in a DSL provided a number of advantages over directly implementing them in a general programming languages. One of the interesting abilities in this system was being able to do a topology dependency sort. This is similar to how Excel knows what cells in needs to recompute when you make a change, and in what order to do the computations.		* '''analytics DSL''' - Having a trading systems analytics all written in a DSL provided a number of advantages over directly implementing them in a general programming languages. One of the interesting abilities in this system was being able to do a topology dependency sort. This is similar to how Excel knows what cells in needs to recompute when you make a change, and in what order to do the computations.
	* '''email quotes''' - Normalizing bond quotes in hundreds of different formats soon created more regular expressions than could be figured out. By migrating to a system built using a parser generator reduced the maintainability of the code.		* '''email quotes''' - Normalizing bond quotes in hundreds of different formats soon created more regular expressions than could be figured out. By migrating to a system built using a parser generator reduced the maintainability of the code.

Brianegge at 02:20, 24 May 2007

2007-05-24T02:20:52Z

New page

===Parser Presentation for ThoughtWorks Oz Team Hug June 2007===

Official Title: '''Using Parser Generators For Fun & Profit'''

Presentation Type: '''Technical'''

Material used: '''Dead trees'''

Projector/white board: '''Not required'''

Length: '''55 minutes'''

Summary: Parser generators (compiler compilers) are usually taught in a computer science compiler design class, and then quickly forgotten. However, parser generators can be used for a whole range of tasks including:
* Code generation
* External DSLs
* Code quality analysis
* Data transformation

Generally, few people other than language designers know the ins and out of lex & yacc. These days you don't need to be a C programmer to make use of parser generators. Java has quite a few, as do most major programming languages. These modern tools are easier to learn than their C ancestors, and have active community support for creating grammars and troubleshooting problems.

In this presentation, I'll show some real life examples where parser generators have saved time and increased simplicity. Here are some of the examples I'll be going into:
* '''copybook parser''' - On this project we needed to interface with a COBOL mainframe using it's copybook format. Instead of crafting our message code by hand, I wrote a parser which took in the copy book format and generated Java code which could compose the messages.
* '''code quality''' - PMD/Checkstyle can detect all sorts of patterns in your code. I've been collaborating on a project which detects code duplication using Abstract Syntax Trees.
* '''analytics DSL''' - Having a trading systems analytics all written in a DSL provided a number of advantages over directly implementing them in a general programming languages. One of the interesting abilities in this system was being able to do a topology dependency sort. This is similar to how Excel knows what cells in needs to recompute when you make a change, and in what order to do the computations.
* '''email quotes''' - Normalizing bond quotes in hundreds of different formats soon created more regular expressions than could be figured out. By migrating to a system built using a parser generator reduced the maintainability of the code.