Quick Navigator

Search Site

Unix VPS
A - Starter
B - Basic
C - Preferred
D - Commercial
MPS - Dedicated
Previous VPSs
* Sign Up! *

Contact Us
Online Help
Domain Status
Man Pages

Virtual Servers

Topology Map

Server Agreement
Year 2038

USA Flag



Man Pages
y2l(1) FreeBSD General Commands Manual y2l(1)

y2l - Yacc to LaTeX grammar pretty printer

y2l [-- options] file
[-d] [-h] [-O] [-O{0,1,2}] [-p] [-t{regexp,file}] [-v]

This utility takes a yacc(1) grammar description file and generates an EBNF (Extended Backus-Naur Form) grammar from it. By default, the output will be a LaTeX(1) longtable environment, that can be \input{} into any LaTeX document. Automatic substitution of symbolic terminals can also be taken care of. Options control whether any optimization should be done on the grammar, and whether plain ASCII output should be generated instead.

Write out debugging information to standard error.
Display a short usage summary on standard output and exit.
Optimize the yacc grammar. This basic optimization will look for empty rules to make non-terminals optional. It also recursively generates choice groups and optional groups and elements based on common prefix and suffix token lists.
Turn off optimization.
This gives the same optimization as the regular -O option.
Do basic optimization. In addition, multiple rules for the same non-terminal are combined as a choice group. Rules that were optimized by the first phase as optional non-terminals are converted into repetitive rules if possible.
Generate plain ASCII output rather than LaTeX output.
Use the provided regular expression to determine whether a terminal is a lexical token rather than a literal. This is useful for grammars where literal tokens represent string literals that differ only in that the string literals are all lowercase versions of the token. Since this is a fairly common practise in yacc grammars, this option ha sbeen provided.
Use the provided file as a mapping between literal tokens and the literal strings they represent. Each line in the file should contain two identifiers: the first one is the lexical token, and the second one is the literal string it represents.
Display the program version information on standard error prior to doing any processing.

While no known bugs seem to exist, there are probably quite a few unknown bugs.

Kris Van Hees <>
Aedil's Utilities ASI

Search for    or go to Top of page |  Section 1 |  Main Index

Powered by GSP Visit the GSP FreeBSD Man Page Interface.
Output converted with ManDoc.