org.stekikun.dolmen.syntax

Class PGrammars.Dependencies

java.lang.Object

org.stekikun.dolmen.syntax.PGrammars.Dependencies

All Implemented Interfaces:

SCC.Graph<String>

Enclosing class:

PGrammars

public static final class PGrammars.Dependencies
extends Object
implements SCC.Graph<String>

Represents the dependencies between the various non-terminals in some grammar. Dependencies can be useful when computing fix-points on grammar productions.

Author:

Stéphane Lescuyer

Field Summary

Fields

Modifier and Type	Field and Description
Map<String,Set<String>>	backward The backward dependencies associate to each non-terminal the set of non-terminals which mention it in the right-hand side of their productions
Map<String,Set<String>>	forward The forward dependencies associate to each non-terminal the set of non-terminals which appear in the right-hand side of its productions

Constructor Summary

Constructors

Constructor and Description
Dependencies(Map<String,Set<String>> forward, Map<String,Set<String>> backward) Builds the given dependencies

Method Summary

Modifier and Type	Method and Description
int	index(String n) Each node must have a unique index, i.e. for every index 0 <= i < size(), there must be some node n such that index(n) = i.
void	iter(Consumer<String> f) Applies the function f to all the nodes in the graph, in no particular order
int	size()
void	successors(String n, Consumer<String> f) Applies the function f to all the successors of the node n, in no particular order
String	toString()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Field Detail

forward

public final Map<String,Set<String>> forward

The forward dependencies associate to each non-terminal the set of non-terminals which appear in the right-hand side of its productions

backward

public final Map<String,Set<String>> backward

The backward dependencies associate to each non-terminal the set of non-terminals which mention it in the right-hand side of their productions

Constructor Detail

Dependencies

public Dependencies(Map<String,Set<String>> forward,
                    Map<String,Set<String>> backward)

Builds the given dependencies

Parameters:

forward -

backward -

Method Detail

toString

public String toString()

Overrides:

toString in class Object

size

public int size()

Specified by:

size in interface SCC.Graph<String>

Returns:

the number of nodes in the graph

index

public int index(String n)

Description copied from interface: SCC.Graph

Each node must have a unique index, i.e. for every index 0 <= i < size(), there must be some node n such that index(n) = i.

Specified by:

index in interface SCC.Graph<String>

Returns:

the index of node n, which must be between 0 and size() - 1

successors

public void successors(String n,
                       Consumer<String> f)

Description copied from interface: SCC.Graph

Applies the function f to all the successors of the node n, in no particular order

Specified by:

successors in interface SCC.Graph<String>

iter

public void iter(Consumer<String> f)

Description copied from interface: SCC.Graph

Applies the function f to all the nodes in the graph, in no particular order

Specified by:

iter in interface SCC.Graph<String>